Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael J. Wilson

dblp:00/4680 · DBLP profile ↗
← Back
18ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 11Applied, interdisciplinary, general and emerging computing · 5 · 2 first-authorSystems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 81% Emerging computing paradigms · 19%
Computer graphics and multimedia
4 papers
Geometric modeling and processing · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
gene expression analysis
0.312017
Combining multiple tools outperforms individual methods in gene set enrichment analyses · Bioinform. 2017
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
gene set enrichment analysis
0.312017
Combining multiple tools outperforms individual methods in gene set enrichment analyses · Bioinform. 2017
Bioinformatics and computational biology › transcriptomics
RNA-seq analysis
0.112017
Combining multiple tools outperforms individual methods in gene set enrichment analyses · Bioinform. 2017
Electronic design automation › logic synthesis
programmable logic array
0.012004
Nanowire-based sublithographic programmable logic arrays · FPGA 2004
Geometric modeling and processing › shape representation › surface representation
PDE surfaces
0.031996
Spectral approximations to PDE surfaces · Comput. Aided Des. 1996
Representing PDE surfaces in terms of B-splines · Comput. Aided Des. 1990
Using partial differential equations to generate free-form surfaces · Comput. Aided Des. 1990
Electronic design automation
logic synthesis
0.012004
Nanowire-based sublithographic programmable logic arrays · FPGA 2004
Emerging computing paradigms › nanotechnology
nanoscale computing
0.012004
Nanowire-based sublithographic programmable logic arrays · FPGA 2004
Geometric modeling and processing › shape modeling › parametric modeling › spline curves
b-spline
0.011990
Representing PDE surfaces in terms of B-splines · Comput. Aided Des. 1990
Geometric modeling and processing › shape modeling
free-form surface
0.011990
Using partial differential equations to generate free-form surfaces · Comput. Aided Des. 1990

Methods — techniques the papers use, named apart from their topics

visualization · 0.3ensemble methods · 0.3stochastic restoration · 0.0bottom-up synthesis · 0.0partial differential equations · 0.0closed-form solution · 0.0spectral methods · 0.0b-spline · 0.0
YearPublicationVenuePosition
2017 Combining multiple tools outperforms individual methods in gene set enrichment analyses
abstract
Motivation: Gene set enrichment (GSE) analysis allows researchers to efficiently extract biological insight from long lists of differentially expressed genes by interrogating them at a systems level. In recent years, there has been a proliferation of GSE analysis methods and hence it has become increasingly difficult for researchers to select an optimal GSE tool based on their particular dataset. Moreover, the majority of GSE analysis methods do not allow researchers to simultaneously compare gene set level results between multiple experimental conditions. Results: The ensemble of genes set enrichment analyses (EGSEA) is a method developed for RNA-sequencing data that combines results from twelve algorithms and calculates collective gene set scores to improve the biological relevance of the highest ranked gene sets. EGSEA's gene set database contains around 25 000 gene sets from sixteen collections. It has multiple visualization capabilities that allow researchers to view gene sets at various levels of granularity. EGSEA has been tested on simulated data and on a number of human and mouse datasets and, based on biologists' feedback, consistently outperforms the individual tools that have been combined. Our evaluation demonstrates the superiority of the ensemble approach for GSE analysis, and its utility to effectively and efficiently extrapolate biological functions and potential involvement in disease processes from lists of differentially regulated genes. Availability and Implementation: EGSEA is available as an R package at http://www.bioconductor.org/packages/EGSEA/ . The gene sets collections are available in the R package EGSEAdata from http://www.bioconductor.org/packages/EGSEAdata/ . Contacts: [email protected] [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Monther Alhamdoosh, Milica Ng, Nicholas J. Wilson, Julie M. Sheridan, Huy Huynh, Michael J. Wilson, Matthew E. Ritchie
Bioinform.6
2013 Enhancing a Simple MODIS Cloud Mask Algorithm for the Landsat Data Continuity Mission
abstract
The upcoming Landsat Data Continuity Mission (LDCM) will include new channels centered around 1.38$\mu\hbox{m}$and 12$\mu \hbox{m}$. This work studies the potential impact of these new channels on LDCM's cloud detection capabilities by using MODerate resolution Imaging Spectroradiometer (MODIS) data as a proxy. Thresholds for the 1.38$\mu\hbox{m}$band and the so-called “split window” technique (using the brightness temperature difference of bands centered at 11$ \mu\hbox{m}$and 12$\mu\hbox{m}$) are derived using atmospheric profiles from the ECMWF ERA-40 reanalysis and a MODIS-band radiance simulator. The thresholds are incorporated into a previously published cloud mask scheme and applied on low- and mid-latitude (60$^{\circ}$S to 60$^{\circ}\ \hbox{N}$) MODIS radiance data from two different days, six months apart. While the previous scheme yields agreement rates to the MODIS cloud mask just below 80$\%$, the addition of the 1.38$\mu\hbox{m}$and split window tests increases the agreement by 7–9%. The earlier scheme is still appropriate for cloud masking of historical Landsat images and for carrying consistent cloud detection into the future. The enhanced scheme of this paper, on the other hand, with its improved masking of primarily high thin clouds, can be either used independently or combined with other masking techniques for generating reliable LDCM cloud mask products that can potentially include confidence indicators based on the degree of agreement between multiple cloud masks.
Michael J. Wilson, Lazaros Oreopoulos
IEEE Trans. Geosci. Remote. Sens.1
2011 Implementation on Landsat Data of a Simple Cloud-Mask Algorithm Developed for MODIS Land Bands
abstract
This letter assesses the performance on Landsat-7 images of a modified version of a cloud-masking algorithm originally developed for clear-sky compositing of Moderate Resolution Imaging Spectroradiometer images at northern midlatitudes. While most historical Landsat data include measurements at thermal wavelengths and such measurements are also planned for the next mission, thermal tests are not included in the suggested algorithm in order to maintain greater versatility and ease of use. The evaluation of the masking algorithm takes advantage of the availability of manual (visual) cloud masks developed at the U.S. Geological Survey for a collection of Landsat scenes. As part of the evaluation, we also include the automated cloud cover assessment (ACCA) algorithm which does include thermal tests and is used operationally by the Landsat-7 mission to provide scene cloud fractions but no cloud masks. We show that the proposed algorithm performs on par with the ACCA both in terms of scene cloud fraction and pixel-level mask agreement. Specifically, the algorithm gives an error of 0.8% for the scene cloud fraction of 156 scenes and a root-mean-square error of 7.1%, while it agrees with the manual mask for 93.1% of the pixels. These performance indicators are very similar to those of the ACCA (1.2%, 7.1%, and 93.7%).
Lazaros Oreopoulos, Michael J. Wilson, Tamás Várnai
IEEE Geosci. Remote. Sens. Lett.2
2006 Packet Switched vs. Time Multiplexed FPGA Overlay Networks
abstract
Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited degree of PE interconnectivity (e.g. wiring up gates and datapaths). Applications which virtualize PEs may require a large number of distinct PE-to-PE connections (e.g. using one PE to simulate 100s of operators, each requiring input data from thousands of other operators), but with each connection having low throughput compared with the PE's operating cycle time. In these highly interconnected conditions, dedicating spatial interconnect resources for all possible connections is costly and inefficient. Alternatively, we can time share physical network resources by virtualizing interconnect links, either by statically scheduling the sharing of resources prior to runtime or by dynamically negotiating resources at runtime. We explore the tradeoffs (e.g. area, route latency, route quality) between time-multiplexed and packet-switched networks overlayed on top of commodity FPGAs. We demonstrate modular and scalable networks which operate on a Xilinx XC2V6000-4 at 166MHz. For our applications, time-multiplexed, offline scheduling offers up to a 63% performance increase over online, packet-switched scheduling for equivalent topologies. When applying designs to equivalent area, packet-switching is up to 2times faster for small area designs while time-multiplexing is up to 5times faster for larger area designs. When limited to the capacity of a XC2V6000, if all communication is known, time-multiplexed routing outperforms packet-switching; however when the active set of links drops below 40% of the potential links, packet-switched routing can outperform time-multiplexing
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, Raphael Rubin, Henry Barnor, Michael J. Wilson, Michael G. Wrighton, André DeHon
FCCM6
2005 An analytic pseudo-spectral method to generate a regular 4-sided PDE surface patch
Malcolm I. G. Bloor, Michael J. Wilson
Comput. Aided Geom. Des.2
2004 Nanowire-based sublithographic programmable logic arrays
abstract
How can Programmable Logic Arrays (PLAs) be built without relying on lithography to pattern their smallest features? In this paper, we detail designs which exploit emerging, bottom-up material synthesis techniques to build PLAs using molecular-scale nanowires. Our new designs accommodate technologies where the only post-fabrication programmable element is a non-restoring diode. We introduce stochastic techniques which allow us to restore the diode logic at the nanoscale so that it can be cascaded and interconnected for general logic evaluation. Under conservative assumptions using 10nm nanowires and 90nm lithographic support, we project yielded logic density around 500,000nm2/or term for a 60 or-term array; a complete 60-term, two-level PLA is roughly the same size as a single 4-LUT logic block in 22nm lithography. Each or term is comparable in area to a 4-transistor hardwired gate at 22nm. Mapping sample datapaths and conventional programmable logic benchmarks, we estimate that each 60-or-term PLA plane will provide equivalent logic to 5--10 4-input LUTs.
André DeHon, Michael J. Wilson
FPGA2
2004 The utilization of MISR for polar cloud modeling
abstract
Satellites measure radiance, and inspection of data from the Multi-angle Imaging SpectroRadiometer (MISR) reveals that cloud cover does have an effect on the measured radiances over bright surfaces. MISR observations by employing a radiative transfer model to examine the effects of cloud micro- and macrophysical properties, surface albedo, sun and view angle on the top-of-atmosphere (TOA) measured bidirectional reflectance factor (BRF). In this paper, the effects of cloud optical depth and solar zenith angle on the transition surface albedo, defined here as the Lambertian surface albedo at which an atmosphere with a specified cloud cover has the same TOA BRF as an atmosphere without cloud cover, are presented. Above this transition surface albedo, cloudy regions are darker than clear regions, while below this albedo, the cloudy regions appear brighter than clear regions. This transition albedo varies dramatically with cloud optical depth solar zenith angle
Michael J. Wilson, Larry Di Girolamo
IGARSS1
2004 Interactive design using higher order PDEs
Sebastian Kubiesa, Hassan Ugail, Michael J. Wilson
Vis. Comput.3
2003 A first look at band-differenced angular signatures for cloud detection from MISR
abstract
We present the first observational study on the potential of band-differenced angular signatures for cloud detection. A band-differenced angular signature is the reflectance difference between the blue and near-infrared channels examined as a function of view angle, and it is observed in this study from the Multi-angle Imaging SpectroRadiometer (MISR). The observed band-differenced angular signatures over a variety of scene types qualitatively compare well with previously published theoretical predictions. Examples of cloud detection in polar and desert regions using band-differenced angular signatures from MISR are shown to highlight its contribution to cloud detection in areas where traditional spectral techniques tend to perform poorly.
Larry Di Girolamo, Michael J. Wilson
IEEE Trans. Geosci. Remote. Sens.2
1999 Time-Dependent Parametric Surface Models of the Human Heart
abstract
A method is presented for generating a time-dependent parametric surface. The application on which this paper concentrates is that of producing a parametric surface description of the surfaces of the left and right ventricles of the human heart. The model is generated from two-dimensional section data obtained from MRI images of the heart. The method views surface generation as a boundary-value problem and produces surfaces as the solutions to elliptic partial differential equations. Shape parameters controlling the geometry of the surface model are introduced through the boundary conditions on the solution of the partial differential equation. These parameters are functions of time, and the surface model can be used to produce an animation of the heart during the cardiac cycle.
Malcolm I. G. Bloor, Michael J. Wilson, Zuzana Knudsen, Carsten Knudsen, Arun V. Holden
Computer Graphics International2
1999 Manipulation of PDE surfaces using an interactively defined parameterisation
Hassan Ugail, Malcolm I. G. Bloor, Michael J. Wilson
Comput. Graph.3
1999 Techniques for interactive design using the PDE method
abstract
Interactive design of practical surfaces using the partial differential equation (PDE) method is considered. The PDE method treats surface design as a boundary value problem (ensuring that surfaces can be defined using a small set of design parameters). Owing to the elliptic nature of the PDE operator, the boundary conditions imposed around the edges of the surface control the internal shape of the surface. Moreover, surfaces obtained in this manner tend to be smooth and fair. The PDE chosen has a closed form solution allowing the interactive manipulation of the surfaces in real time. Thus we present efficient techniques by which we show how surfaces of practical significance can be constructed interactively in real time.
Hassan Ugail, Malcolm I. G. Bloor, Michael J. Wilson
ACM Trans. Graph.3
1996 Spectral approximations to PDE surfaces
Malcolm I. G. Bloor, Michael J. Wilson
Comput. Aided Des.2
1995 The smoothing properties of variational schemes for surface design
Malcolm I. G. Bloor, Michael J. Wilson, Hans Hagen
Comput. Aided Geom. Des.2
1994 Local control of surfaces generated using partial differential equations
Malcolm I. G. Bloor, Michael J. Wilson
Comput. Graph.2
1990 Using partial differential equations to generate free-form surfaces
Malcolm I. G. Bloor, Michael J. Wilson
Comput. Aided Des.2
1990 Representing PDE surfaces in terms of B-splines
Malcolm I. G. Bloor, Michael J. Wilson
Comput. Aided Des.2
1990 Functionality in blend design
Timothy J. Lowe, Malcolm I. G. Bloor, Michael J. Wilson
Comput. Aided Des.3