Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Wisdom Of Artificial Crowds Feature Selection In Untargeted Metabolomics: An Application To The Development Of A Blood-Based Diagnostic Test For Thrombotic Myocardial Infarction, Patrick J. Trainor, Roman V. Yampolskiy, Andrew P. Defilippis
Wisdom Of Artificial Crowds Feature Selection In Untargeted Metabolomics: An Application To The Development Of A Blood-Based Diagnostic Test For Thrombotic Myocardial Infarction, Patrick J. Trainor, Roman V. Yampolskiy, Andrew P. Defilippis
Faculty Scholarship
Introduction: Heart disease remains a leading cause of global mortality. While acute myocardial infarction (colloquially: heart attack), has multiple proximate causes, proximate etiology cannot be determined by a blood-based diagnostic test. We enrolled a suitable patient cohort and conducted a non-targeted quantification of plasma metabolites by mass spectrometry for developing a test that can differentiate between thrombotic MI, non-thrombotic MI, and stable disease. A significant challenge in developing such a diagnostic test is solving the NP-hard problem of feature selection for constructing an optimal statistical classifier. Objective: We employed a Wisdom of Artificial Crowds (WoAC) strategy for solving the feature …
A Study On The Limitations Of Evolutionary Computation And Other Bio-Inspired Approaches For Integer Factorization, Mohit Mishra, Vaibhav Gupta, Utkarsh Chaturvedi, K. K. Shukla, Roman Yampolskiy
A Study On The Limitations Of Evolutionary Computation And Other Bio-Inspired Approaches For Integer Factorization, Mohit Mishra, Vaibhav Gupta, Utkarsh Chaturvedi, K. K. Shukla, Roman Yampolskiy
Faculty Scholarship
Integer Factorization is a vital number theoretic problem frequently finding application in public-key cryptography like RSA encryption systems, and other areas like Fourier transform algorithm. The problem is computationally intractable because it is a one-way mathematical function. Due to its computational infeasibility, it is extremely hard to find the prime factors of a semi prime number generated from two randomly chosen similar sized prime numbers. There has been a recently growing interest in the community with regards to evolutionary computation and other alternative approaches to solving this problem as an optimization task. However, the results still seem to be very …