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 Casey

dblp:91/3353 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 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 graphics and multimedia
1 paper
Audio and music processing · 100%
Artificial intelligence
2 papers
Knowledge representation and reasoning · 82% Probabilistic and Bayesian machine learning · 18%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology
0.012003
Ontology support for web service processes · ESEC / SIGSOFT FSE 2003
Services computing and microservices › service composition
web service composition
0.012003
Ontology support for web service processes · ESEC / SIGSOFT FSE 2003
Audio and music processing › source separation › speech separation
audio-visual speech separation
0.012001
Audio-Visual Sound Separation Via Hidden Markov Models · NIPS 2001
Audio and music processing › source separation
speech separation
0.012001
Audio-Visual Sound Separation Via Hidden Markov Models · NIPS 2001
Logic in computer science › knowledge representation and reasoning
description logic
0.012003
Ontology support for web service processes · ESEC / SIGSOFT FSE 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.012001
Audio-Visual Sound Separation Via Hidden Markov Models · NIPS 2001

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

process calculi · 0.1modal logic · 0.1description logic reasoning · 0.1hidden markov model · 0.1factorial model · 0.1approximate inference · 0.1
YearPublicationVenuePosition
2003 Ontology support for web service processes
abstract
Web Services are software services that can be advertised by providers and deployed by customers using Web technologies. This concept is currently carried further to address Web service choreography. Choreography refers to the composition of individual services to services processes that can communicate and interact with another.We propose a formal ontology framework for these Web service processes that supports the description, matching, and composition through logic reasoning techniques. The Semantic Web, based on a description logic-based knowledge representation and reasoning framework, provides the foundations. Integrating aspects from modal logics and process calculi into this framework will prove essential.
Claus Pahl, Michael Casey
ESEC / SIGSOFT FSE2
2001 Audio-Visual Sound Separation Via Hidden Markov Models
abstract
It is well known that under noisy conditions we can hear speech much more clearly when we read the speaker's lips. This sug(cid:173) gests the utility of audio-visual information for the task of speech enhancement. We propose a method to exploit audio-visual cues to enable speech separation under non-stationary noise and with a single microphone. We revise and extend HMM-based speech enhancement techniques, in which signal and noise models are fac(cid:173) tori ally combined, to incorporate visual lip information and em(cid:173) ploy novel signal HMMs in which the dynamics of narrow-band and wide band components are factorial. We avoid the combina(cid:173) torial explosion in the factorial model by using a simple approxi(cid:173) mate inference technique to quickly estimate the clean signals in a mixture. We present a preliminary evaluation of this approach using a small-vocabulary audio-visual database, showing promising improvements in machine intelligibility for speech enhanced using audio and visual information.
John R. Hershey, Michael Casey
NIPS2
1999 Network Stability from Activity-Dependent Regulation of Neuronal Conductances
abstract
Activity-dependent plasticity appears to play an important role in the modification of neurons and neural circuits that occurs during development and learning. Plasticity is also essential for the maintenance of stable patterns of activity in the face of variable environmental and internal conditions. Previous theoretical and experimental results suggest that neurons stabilize their activity by altering the number or characteristics of ion channels to regulate their intrinsic electrical properties. We present both experimental and modeling evidence to show that activity-dependent regulation of conductances, operating at the level of individual neurons, can also stabilize network activity. These results indicate that the stomatogastric ganglion of the crab can generate a characteristic rhythmic pattern of activity in two fundamentally different modes of operation. In one mode, the rhythm is strictly conditional on the presence of neuromodulatory afferents from adjacent ganglia. In the other, it is independent of neuromodulatory input but relies on newly developed intrinsic properties of the component neurons.
Jorge Golowasch, Michael Casey, L. F. Abbott, Eve Marder
Neural Comput.2
1998 Correction To Proof That Recurrent Neural Networks Can Robustly Recognize Only Regular Languages
abstract
Our earlier article, “The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine Extraction” (Casey, 1996), contains a corollary that shows that finite dimensional recurrent neural networks with noise in their state variables that perform algorithmic computations can perform only finite state machine computations. The proof of the corollary is technically incorrect. The problem resulted from the fact that the proof of the theorem on which the corollary is based was more general than the statement of the theorem, and it was the contents of the proof rather than the statement that were used to prove the corollary. In this note, we state the theorem in the necessary generality and then give the corrected proof of the corollary.
Michael Casey
Neural Comput.1