James Noonan

dblp:61/4120 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 1Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1

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.

Computer networks
1 paper
Transport protocols and congestion control · 50% Network measurement and analytics · 50%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › internet measurement
internet path measurement
0.112006
Stall and Path Monitoring Issues in SCTP · INFOCOM 2006
Transport protocols and congestion control › reliable transport protocol
stream control transmission protocol
0.112006
Stall and Path Monitoring Issues in SCTP · INFOCOM 2006

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

retransmission timeout adjustment · 0.1karn's algorithm · 0.1
YearPublicationVenuePosition
2020 Interpretable Neuron Structuring with Graph Spectral Regularization
abstract
While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features. Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on the primary task. Taking inspiration from spatial organization and localization of neuron activations in biological networks, we use a graph Laplacian penalty to structure the activations within a layer. This penalty encourages activations to be smooth either on a predetermined graph or on a feature-space graph learned from the data via co-activations of a hidden layer of the neural network. We show numerous uses for this additional structure including cluster indication and visualization in biological and image data sets.
Alexander Tong 0001, David van Dijk, Jay S. Stanley III, Matthew Amodio, Kristina Yim, Rebecca Muhle, James Noonan, Guy Wolf, Smita Krishnaswamy
IDA7
2012 Time Course RNA-seq: A Potential Avenue with Somewhat Different Approach in Tandem of Differential Analysis
abstract
RNA-seq is exponentially becoming the de facto standard approach to compel considerable advantages over conventional technologies such as micro array by directly sequencing transcripts in gene expression profile. As the cost to sequencing is dropping rapidly, studies to dynamic change of gene expression in a given biological system over time have shown steady growth over the past few years as micro array, however, statistical approaches to characterize dynamic temporal complexities are currently elusive. In differential gene expression analysis, as somehow limited but intuitive solutions, static differential expression methods without respect to time can be applied, which do not take into account the inherent dependencies in time series explicitly that the expression patterns at later stages are dependent on patterns at earlier stages. We present a statistical framework to define dynamic gene expression patterns over time using trajectory index and Hidden Markov Model (HMM) approach in time series RNA-seq data, and our methods are validated through Markov Chain Monte Carlo (MCMC) simulation study in time series dependent data. The utility of the dynamic specific methods for temporal RNA-seq is demonstrated by application to the analyses of gene expression patterns in RNA-seq seven real data sets and MCMC simulation study in details.
Sunghee Oh, James Noonan
CISIS3
2006 Stall and Path Monitoring Issues in SCTP
abstract
Abstract — This paper presents how SCTP can stall in multihomed scenarios during failover and under certain circumstances. A stall is where an SCTP end-point ceases to communicate for an extended period of time, but does not report any error to the upper layer. This paper presents two different sets of circumstances where a stall can occur: firstly when there is an underestimation of the Retransmission Time-Out (RTO) value for a redundant network path; and secondly when a network error occurs that causes only SACKs to be lost, which confuses the SCTP sender about which network path is operational. Solutions to both of these stalls are presented that include modifying the RTO value, applying Karn’s algorithm to path monitoring and ensuring the destination address selection policy for SACKs is changed. This paper also presents a mechanism to de-couple data acknowledgement and path monitoring when using multi-homed transport protocols, which should remove the ambiguity about path monitoring and offers a universal solution to the stall. I.
James Noonan, Philip Perry, Seán Murphy, John Murphy 0001
INFOCOM1