Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (1329)
- Artificial Intelligence and Robotics (515)
- Engineering (356)
- Computer Engineering (169)
- Data Science (148)
-
- Social and Behavioral Sciences (143)
- Electrical and Computer Engineering (139)
- Statistics and Probability (129)
- Medicine and Health Sciences (117)
- Life Sciences (102)
- Databases and Information Systems (100)
- Earth Sciences (79)
- Theory and Algorithms (74)
- Mathematics (72)
- Physics (70)
- Environmental Sciences (69)
- Information Security (69)
- Numerical Analysis and Scientific Computing (69)
- Software Engineering (68)
- Other Computer Sciences (64)
- Business (58)
- Applied Mathematics (51)
- Arts and Humanities (45)
- Education (40)
- Medical Specialties (36)
- Chemistry (34)
- Applied Statistics (32)
- Operations Research, Systems Engineering and Industrial Engineering (32)
- Oceanography and Atmospheric Sciences and Meteorology (30)
- Institution
-
- Old Dominion University (115)
- Singapore Management University (104)
- Brigham Young University (74)
- Air Force Institute of Technology (66)
- TÜBİTAK (61)
-
- Zayed University (48)
- University of Texas at Arlington (44)
- New Jersey Institute of Technology (42)
- Technological University Dublin (40)
- Portland State University (38)
- University of Nebraska - Lincoln (38)
- Edith Cowan University (30)
- Western University (30)
- Chapman University (27)
- San Jose State University (26)
- City University of New York (CUNY) (25)
- University of Kentucky (25)
- University of South Florida (24)
- Boise State University (21)
- Utah State University (21)
- Louisiana State University (19)
- University of Texas Rio Grande Valley (19)
- University at Albany, State University of New York (18)
- University of Louisville (18)
- Wright State University (18)
- Southern Methodist University (17)
- University of Nevada, Las Vegas (17)
- University of Tennessee, Knoxville (17)
- California Polytechnic State University, San Luis Obispo (16)
- Dartmouth College (16)
- Publication Year
- Publication
-
- Theses and Dissertations (152)
- Research Collection School Of Computing and Information Systems (86)
- Electronic Theses and Dissertations (65)
- Turkish Journal of Electrical Engineering and Computer Sciences (60)
- Dissertations (51)
-
- All Works (48)
- Faculty Publications (40)
- Computer Science and Engineering Dissertations (24)
- Electrical & Computer Engineering Faculty Publications (24)
- Electronic Thesis and Dissertation Repository (23)
- Dissertations and Theses (22)
- Master's Projects (21)
- Conference papers (20)
- Doctoral Dissertations (20)
- Computer Science Faculty Publications (19)
- Computer Science and Engineering Theses (19)
- Legacy Theses & Dissertations (2009 - 2024) (18)
- Articles (17)
- USF Tampa Graduate Theses and Dissertations (17)
- Master's Theses (16)
- Browse all Theses and Dissertations (15)
- Research outputs 2022 to 2026 (15)
- SMU Data Science Review (15)
- Boise State University Theses and Dissertations (14)
- Dissertations, Theses, and Capstone Projects (13)
- LSU Doctoral Dissertations (13)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (13)
- CCE Theses and Dissertations (12)
- Honors Theses (12)
- Journal of System Simulation (12)
- Publication Type
Articles 1531 - 1560 of 1686
Full-Text Articles in Physical Sciences and Mathematics
An Urgent Precaution System To Detect Students At Risk Of Substance Abuse Through Classification Algorithms, Faruk Bulut, İhsan Ömür Bucak
An Urgent Precaution System To Detect Students At Risk Of Substance Abuse Through Classification Algorithms, Faruk Bulut, İhsan Ömür Bucak
Turkish Journal of Electrical Engineering and Computer Sciences
In recent years, the use of addictive drugs and substances has turned out to be a challenging social problem worldwide. The illicit use of these types of drugs and substances appears to be increasing among elementary and high school students. After becoming addicted to drugs, life becomes unbearable and gets even worse for their users. Scientific studies show that it becomes extremely difficult for an individual to break this habit after being a user. Hence, preventing teenagers from addiction becomes an important issue. This study focuses on an urgent precaution system that helps families and educators prevent teenagers from developing …
Online Portfolio Selection: A Survey, Bin Li, Steven C. H. Hoi
Online Portfolio Selection: A Survey, Bin Li, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Online portfolio selection is a fundamental problem in computational finance, which has been extensively studied across several research communities, including finance, statistics, artificial intelligence, machine learning, and data mining. This article aims to provide a comprehensive survey and a structural understanding of online portfolio selection techniques published in the literature. From an online machine learning perspective, we first formulate online portfolio selection as a sequential decision problem, and then we survey a variety of state-of-the-art approaches, which are grouped into several major categories, including benchmarks, Follow-the-Winner approaches, Follow-the-Loser approaches, Pattern-Matching--based approaches, and Meta-Learning Algorithms. In addition to the problem formulation …
An Incremental Reseeding Strategy For Clustering, Xavier Bresson, Huiyi Hu, Thomas Laurent, Arthur Szlam, James Von Brecht
An Incremental Reseeding Strategy For Clustering, Xavier Bresson, Huiyi Hu, Thomas Laurent, Arthur Szlam, James Von Brecht
Mathematics, Statistics and Data Science Faculty Works
In this work we propose a simple and easily parallelizable algorithm for multiway graph partitioning. The algorithm alternates between three basic components: diffusing seed vertices over the graph, thresholding the diffused seeds, and then randomly reseeding the thresholded clusters. We demonstrate experimentally that the proper combination of these ingredients leads to an algorithm that achieves state-of-the-art performance in terms of cluster purity on standard benchmarks datasets. Moreover, the algorithm runs an order of magnitude faster than the other algorithms that achieve comparable results in terms of accuracy. We also describe a coarsen, cluster and refine approach similar to GRACLUS and …
Complementary Layered Learning, Sean Mondesire
Complementary Layered Learning, Sean Mondesire
Electronic Theses and Dissertations
Layered learning is a machine learning paradigm used to develop autonomous robotic-based agents by decomposing a complex task into simpler subtasks and learns each sequentially. Although the paradigm continues to have success in multiple domains, performance can be unexpectedly unsatisfactory. Using Boolean-logic problems and autonomous agent navigation, we show poor performance is due to the learner forgetting how to perform earlier learned subtasks too quickly (favoring plasticity) or having difficulty learning new things (favoring stability). We demonstrate that this imbalance can hinder learning so that task performance is no better than that of a suboptimal learning technique, monolithic learning, which …
The Gaussian Radon Transform For Banach Spaces, Irina Holmes
The Gaussian Radon Transform For Banach Spaces, Irina Holmes
LSU Doctoral Dissertations
The classical Radon transform can be thought of as a way to obtain the density of an n-dimensional object from its (n-1)-dimensional sections in diff_x001B_erent directions. A generalization of this transform to infi_x001C_nite-dimensional spaces has the potential to allow one to obtain a function de_x001C_fined on an infi_x001C_nite-dimensional space from its conditional expectations. We work within a standard framework in in_x001C_finite-dimensional analysis, that of abstract Wiener spaces, developed by L. Gross. The main obstacle in infinite dimensions is the absence of a useful version of Lebesgue measure. To overcome this, we work with Gaussian measures. Specifically, we construct Gaussian measures …
Can Clustering Improve Requirements Traceability? A Tracelab-Enabled Study, Brett Taylor Armstrong
Can Clustering Improve Requirements Traceability? A Tracelab-Enabled Study, Brett Taylor Armstrong
Master's Theses
Software permeates every aspect of our modern lives. In many applications, such in the software for airplane flight controls, or nuclear power control systems software failures can have catastrophic consequences. As we place so much trust in software, how can we know if it is trustworthy? Through software assurance, we can attempt to quantify just that.
Building complex, high assurance software is no simple task. The difficult information landscape of a software engineering project can make verification and validation, the process by which the assurance of a software is assessed, very difficult. In order to manage the inevitable information overload …
Using Machine Learning Techniques To Customize The User's Profile, Helps Intelligent Tv Decoder’S Design, Alketa Hyso, Roneda Mucaj
Using Machine Learning Techniques To Customize The User's Profile, Helps Intelligent Tv Decoder’S Design, Alketa Hyso, Roneda Mucaj
UBT International Conference
In today's society due to the increase of the quantity of information is becoming more difficult to find the information we search. "Data mining" offers us the most important methods and techniques in data analysis. Through this work, we aim to study the several data mining techniques, methods and applications in specific areas. We experiment with an “open software" WEKA, to perform some data analysis, presenting the reliability and advantages of data mining classification technique. We use the decision trees technique to achieve the task of classification, to customize user profiles based on their requirements and needs. This paper presents …
What You Want Is Not What You Get: Predicting Sharing Policies For Text-Based Content On Facebook, Arunesh Sinha, Li Yan, Lujo Bauer
What You Want Is Not What You Get: Predicting Sharing Policies For Text-Based Content On Facebook, Arunesh Sinha, Li Yan, Lujo Bauer
Research Collection Lee Kong Chian School Of Business
As the amount of content users publish on social networking sites rises, so do the danger and costs of inadvertently sharing content with an unintended audience. Studies repeatedly show that users frequently misconfigure their policies or misunderstand the privacy features offered by social networks. A way to mitigate these problems is to develop automated tools to assist users in correctly setting their policy. This paper explores the viability of one such approach: we examine the extent to which machine learning can be used to deduce users' sharing preferences for content posted on Facebook. To generate data on which to evaluate …
Variable Importance And Prediction Methods For Longitudinal Problems With Missing Variables, Ivan Diaz, Alan E. Hubbard, Anna Decker, Mitchell Cohen
Variable Importance And Prediction Methods For Longitudinal Problems With Missing Variables, Ivan Diaz, Alan E. Hubbard, Anna Decker, Mitchell Cohen
U.C. Berkeley Division of Biostatistics Working Paper Series
In this paper we present prediction and variable importance (VIM) methods for longitudinal data sets containing both continuous and binary exposures subject to missingness. We demonstrate the use of these methods for prognosis of medical outcomes of severe trauma patients, a field in which current medical practice involves rules of thumb and scoring methods that only use a few variables and ignore the dynamic and high-dimensional nature of trauma recovery. Well-principled prediction and VIM methods can thus provide a tool to make care decisions informed by the high-dimensional patient’s physiological and clinical history. Our VIM parameters can be causally interpreted …
Asymptotically Unbiased Estimator Of The Informational Energy With Knn, Angel Caţaron, Răzvan Andonie, Chinmei Y. Chueh
Asymptotically Unbiased Estimator Of The Informational Energy With Knn, Angel Caţaron, Răzvan Andonie, Chinmei Y. Chueh
All Faculty Scholarship for the College of the Sciences
Motivated by machine learning applications (e.g., classification, function approximation, feature extraction), in previous work, we have introduced a non- parametric estimator of Onicescu’s informational energy. Our method was based on the k-th nearest neighbor distances between the n sample points, where k is a fixed positive integer. In the present contribution, we discuss mathematical properties of this estimator. We show that our estimator is asymptotically unbiased and consistent. We provide further experimental results which illustrate the convergence of the estimator for standard distributions.
Enabling Richer Insight Into Runtime Executions Of Systems, Karthik Swaminathan Nagaraj
Enabling Richer Insight Into Runtime Executions Of Systems, Karthik Swaminathan Nagaraj
Open Access Dissertations
Systems software of very large scales are being heavily used today in various important scenarios such as online retail, banking, content services, web search and social networks. As the scale of functionality and complexity grows in these software, managing the implementations becomes a considerable challenge for developers, designers and maintainers. Software needs to be constantly monitored and tuned for optimal efficiency and user satisfaction. With large scale, these systems incorporate significant degrees of asynchrony, parallelism and distributed executions, reducing the manageability of software including performance management. Adding to the complexity, developers are under pressure between developing new functionality for customers …
Practical Cost-Conscious Active Learning For Data Annotation In Annotator-Initiated Environments, Robbie A. Haertel
Practical Cost-Conscious Active Learning For Data Annotation In Annotator-Initiated Environments, Robbie A. Haertel
Theses and Dissertations
Many projects exist whose purpose is to augment raw data with annotations that increase the usefulness of the data. The number of these projects is rapidly growing and in the age of “big data” the amount of data to be annotated is likewise growing within each project. One common use of such data is in supervised machine learning, which requires labeled data to train a predictive model. Annotation is often a very expensive proposition, particularly for structured data. The purpose of this dissertation is to explore methods of reducing the cost of creating such data sets, including annotated text corpora.We …
Online Multi-Stage Deep Architectures For Feature Extraction And Object Recognition, Derek Christopher Rose
Online Multi-Stage Deep Architectures For Feature Extraction And Object Recognition, Derek Christopher Rose
Doctoral Dissertations
Multi-stage visual architectures have recently found success in achieving high classification accuracies over image datasets with large variations in pose, lighting, and scale. Inspired by techniques currently at the forefront of deep learning, such architectures are typically composed of one or more layers of preprocessing, feature encoding, and pooling to extract features from raw images. Training these components traditionally relies on large sets of patches that are extracted from a potentially large image dataset. In this context, high-dimensional feature space representations are often helpful for obtaining the best classification performances and providing a higher degree of invariance to object transformations. …
Segmentation And Model Generation For Large-Scale Cyber Attacks, Steven E. Strapp
Segmentation And Model Generation For Large-Scale Cyber Attacks, Steven E. Strapp
Theses
Raw Cyber attack traffic can present more questions than answers to security analysts. Especially with large-scale observables it is difficult to identify which packets are relevant and what attack behaviors are present. Many existing works in Host or Flow Clustering attempt to group similar behaviors to expedite analysis; these works often phrase the problem directly as offline unsupervised machine learning. This work proposes online processing to simultaneously model coordinating actors and segment traffic that is relevant to a target of interest, all while it is being received. The goal is not just to aggregate similar attack behaviors, but to provide …
Computer Sketch Recognition, Richard Steigerwald
Computer Sketch Recognition, Richard Steigerwald
Master's Theses
Tens of thousands of years ago, humans drew sketches that we can see and identify even today. Sketches are the oldest recorded form of human communication and are still widely used. The universality of sketches supersedes that of culture and language. Despite the universal accessibility of sketches by humans, computers are unable to interpret or even correctly identify the contents of sketches drawn by humans with a practical level of accuracy.
In my thesis, I demonstrate that the accuracy of existing sketch recognition techniques can be improved by optimizing the classification criteria. Current techniques classify a 20,000 sketch crowd-sourced dataset …
Mind Change Speed-Up For Learning Languages From Positive Data, Sanjay Jain, Efim Kinber
Mind Change Speed-Up For Learning Languages From Positive Data, Sanjay Jain, Efim Kinber
School of Computer Science & Engineering Faculty Publications
Within the frameworks of learning in the limit of indexed classes of recursive languages from positive data and automatic learning in the limit of indexed classes of regular languages (with automatically computable sets of indices), we study the problem of minimizing the maximum number of mind changes by a learner on all languages with indices not exceeding . For inductive inference of recursive languages, we establish two conditions under which can be made smaller than any recursive unbounded non-decreasing function. We also establish how is affected if at least one of these two conditions does not hold. In the case …
Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara
Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara
Ole J Mengshoel
Document Classification, Shane K. Panter
Document Classification, Shane K. Panter
Boise State University Theses and Dissertations
We present an overview of the document classification process and present research conducted against the newly constructed SBIR-STTR corpus. Specifically, the current methods in use for annotation, corpus construction, feature construction, feature weighting, and classifier algorithms are surveyed. We introduce a new dataset derived from public data downloaded from sbir.gov and the Text Annotation Toolkit (TAT) 1 for use in classification research.
TAT is a collection of independent components packaged together into one open source software application. TAT was engineered to support the document classification process and workflow. Tracking of changes in a working corpus, saving data used in the …
Probabilistic Explicit Topic Modeling, Joshua Aaron Hansen
Probabilistic Explicit Topic Modeling, Joshua Aaron Hansen
Theses and Dissertations
Latent Dirichlet Allocation (LDA) is widely used for automatic discovery of latent topics in document corpora. However, output from analysis using an LDA topic model suffers from a lack of identifiability between topics not only across corpora, but across runs of the algorithm. The output is also isolated from enriching information from knowledge sources such as Wikipedia and is difficult for humans to interpret due to a lack of meaningful topic labels. This thesis introduces two methods for probabilistic explicit topic modeling that address these issues: Latent Dirichlet Allocation with Static Topic-Word Distributions (LDA-STWD), and Explicit Dirichlet Allocation (EDA). LDA-STWD …
Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange
Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange
Dissertations
The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …
Object Detection And Recognition In Natural Settings, George William Dittmar
Object Detection And Recognition In Natural Settings, George William Dittmar
Dissertations and Theses
Much research as of late has focused on biologically inspired vision models that are based on our understanding of how the visual cortex processes information. One prominent example of such a system is HMAX [17]. HMAX attempts to simulate the biological process for object recognition in cortex based on the model proposed by Hubel & Wiesel [10]. This thesis investigates the ability of an HMAX-like system (GLIMPSE [20]) to perform object-detection in cluttered natural scenes. I evaluate these results using the StreetScenes database from MIT [1, 8]. This thesis addresses three questions: (1) Can the GLIMPSE-based object detection system replicate …
Using Methods From The Data-Mining And Machine-Learning Literature For Disease Classification And Prediction: A Case Study Examining Classification Of Heart Failure Subtypes, Peter C. Austin
Peter Austin
OBJECTIVE: Physicians classify patients into those with or without a specific disease. Furthermore, there is often interest in classifying patients according to disease etiology or subtype. Classification trees are frequently used to classify patients according to the presence or absence of a disease. However, classification trees can suffer from limited accuracy. In the data-mining and machine-learning literature, alternate classification schemes have been developed. These include bootstrap aggregation (bagging), boosting, random forests, and support vector machines.
STUDY DESIGN AND SETTING: We compared the performance of these classification methods with that of conventional classification trees to classify patients with heart failure (HF) …
Artificial Intelligence And Data Mining: Algorithms And Applications, Jianhong Xia, Fuding Xie, Yong Zhang, Craig Caulfield
Artificial Intelligence And Data Mining: Algorithms And Applications, Jianhong Xia, Fuding Xie, Yong Zhang, Craig Caulfield
Research outputs 2013
Artificial intelligence and data mining techniques have been used in many domains to solve classification, segmentation, association, diagnosis, and prediction problems. The overall aim of this special issue is to open a discussion among researchers actively working on algorithms and applications. The issue covers a wide variety of problems for computational intelligence, machine learning, time series analysis, remote sensing image mining, and pattern recognition. After a rigorous peer review process, 20 papers have been selected from 38 submissions. The accepted papers in this issue addressed the following topics: (i) advanced artificial intelligence and data mining techniques; (ii) computational intelligence in …
Automated Detection Of Vehicles With Machine Learning, Michael N. Johnstone, Andrew Woodward
Automated Detection Of Vehicles With Machine Learning, Michael N. Johnstone, Andrew Woodward
Australian Information Security Management Conference
Considering the significant volume of data generated by sensor systems and network hardware which is required to be analysed and intepreted by security analysts, the potential for human error is significant. This error can lead to consequent harm for some systems in the event of an adverse event not being detected. In this paper we compare two machine learning algorithms that can assist in supporting the security function effectively and present results that can be used to select the best algorithm for a specific domain. It is suggested that a naive Bayesian classiifer (NBC) and an artificial neural network (ANN) …
Concept Drift Datasets, Patrick Lindstrom
Concept Drift Datasets, Patrick Lindstrom
Doctoral
This zip file contains the datasets used in the PhD thesis:
Lindstrom, P., 2013. Handling Concept Drift in the Context of Expensive Labels. Technological University Dublin. For more information about the datasets please see the README file and the aforementioned thesis.
Human Intention Recognition Based Assisted Telerobotic Grasping Of Objects In An Unstructured Environment, Karan Hariharan Khokar
Human Intention Recognition Based Assisted Telerobotic Grasping Of Objects In An Unstructured Environment, Karan Hariharan Khokar
USF Tampa Graduate Theses and Dissertations
In this dissertation work, a methodology is proposed to enable a robot to identify an object to be grasped and its intended grasp configuration while a human is teleoperating a robot towards the desired object. Based on the detected object and grasp configuration, the human is assisted in the teleoperation task. The environment is unstructured and consists of a number of objects, each with various possible grasp configurations. The identification of the object and the grasp configuration is carried out in real time, by recognizing the intention of the human motion. Simultaneously, the human user is assisted to preshape over …
Teaching Law And Digital Age Legal Practice With An Ai And Law Seminar: Justice, Lawyering And Legal Education In The Digital Age, Kevin D. Ashley
Teaching Law And Digital Age Legal Practice With An Ai And Law Seminar: Justice, Lawyering And Legal Education In The Digital Age, Kevin D. Ashley
Articles
A seminar on Artificial Intelligence ("Al") and Law can teach law students lessons about legal reasoning and legal practice in the digital age. Al and Law is a subfield of Al/computer science research that focuses on designing computer programs—computational models—that perform legal reasoning. These computational models are used in building tools to assist in legal practice and pedagogy and in studying legal reasoning in order to contribute to cognitive science and jurisprudence. Today, subject to a number of qualifications, computer programs can reason with legal rules, apply legal precedents, and even argue like a legal advocate.
This article provides a …
An Automated Prognosis System For Estrogen Hormone Status Assessment In Breast Cancer Tissue Samples, Fati̇h Sarikoç, Adem Kalinli, Hülya Akgün, Fi̇gen Öztürk
An Automated Prognosis System For Estrogen Hormone Status Assessment In Breast Cancer Tissue Samples, Fati̇h Sarikoç, Adem Kalinli, Hülya Akgün, Fi̇gen Öztürk
Turkish Journal of Electrical Engineering and Computer Sciences
Estrogen receptor (ER) status evaluation is a widely applied method in the prognosis of breast cancer. However, testing for the existence of the ER biomarker in a patient's tumor sample mainly depends on the subjective decisions of the doctors. The aim of this paper is to introduce the usage of a machine learning tool, functional trees (FTs), to attain an ER prognosis of the disease via an objective decision model. For this aim, 27 image files, each of which came from a biopsy sample of an invasive ductal carcinoma patient, were scanned and captured by a light microscope. From these …
A Machine Learning Approach To Diagnosis Of Parkinson’S Disease, Sumaiya F. Hashmi
A Machine Learning Approach To Diagnosis Of Parkinson’S Disease, Sumaiya F. Hashmi
CMC Senior Theses
I will investigate applications of machine learning algorithms to medical data, adaptations of differences in data collection, and the use of ensemble techniques.
Focusing on the binary classification problem of Parkinson’s Disease (PD) diagnosis, I will apply machine learning algorithms to a primary dataset consisting of voice recordings from healthy and PD subjects. Specifically, I will use Artificial Neural Networks, Support Vector Machines, and an Ensemble Learning algorithm to reproduce results from [MS12] and [GM09].
Next, I will adapt a secondary regression dataset of PD recordings and combine it with the primary binary classification dataset, testing various techniques to consolidate …
On Identifying Critical Nuggets Of Information During Classification Task, David Sathiaraj
On Identifying Critical Nuggets Of Information During Classification Task, David Sathiaraj
LSU Doctoral Dissertations
In large databases, there may exist critical nuggets - small collections of records or instances that contain domain-specific important information. This information can be used for future decision making such as labeling of critical, unlabeled data records and improving classification results by reducing false positive and false negative errors. In recent years, data mining efforts have focussed on pattern and outlier detection methods. However, not much effort has been dedicated to finding critical nuggets within a data set. This work introduces the idea of critical nuggets, proposes an innovative domain-independent method to measure criticality, suggests a heuristic to reduce the …