Kevin Mcilhany

Prof. Kevin Mcilhany

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 August 2010 in Microfluidics and Nanofluidics
Verified
Journal Article
Closed access
PDF file
KMKevin Mcilhany
Kevin Mcilhany
SWStephen Wiggins
Stephen Wiggins

16 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
SSSomya Sharma
Somya Sharma
MTMarten Thompson
Marten Thompson
Debra LaeferDebra Laefer
Debra Laefer
MLMichael J. Lawler
Michael J. Lawler
KMKevin Mcilhany
Kevin Mcilhany
SCSnigdhansu Chatterjee
Snigdhansu Chatterjee
We present an overview of four challenging research areas in multiscale physics and engineering as well as four data science topics that may be developed for addressing these challenges. We focus on multiscale spatiotemporal problems in light of the importance of understanding the accompanying scientific processes and engineering ideas, where “multiscale” refers to concurrent, non-trivial and coupled models over scales separated by orders of magnitude in either space, time, energy, momenta, or any other relevant parameter. Specifically, we consider problems where the data may be obtained at various resolutions; analyzing such data and constructing coupled models led to open research questions in various applications of data science. Numeric studies are reported for one of the data science techniques discussed here for illustration, namely, on approximate Bayesian computations.

13 October 2017 in arXiv
Verified
Preprint
Open access
PDF file
KMKevin Mcilhany
Kevin Mcilhany
SWStephen Wiggins
Stephen Wiggins
A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering, however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-Of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a robust clustering technique is discussed based on reaching a consensus among the multiple approaches, overcoming the weaknesses found individually.