Andrew R. Plummer

Learn More
We present updates to the Speech Recognition Virtual Kitchen (SRVK) environment, a repository of pre-configured Virtual Machines (VMs) containing tools and experiments in the speech and language field. SRVK promotes community sharing of research techniques, fosters innovative experimentation, and provides solid reference systems as a tool for education,(More)
Let G = (V,E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V − S is adjacent to a vertex in V − S. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The total restrained domination number of G (restrained(More)
Automatic Speech Recognition systems suffer from severe performance degradation in the presence of myriad complicating factors such as noise, reverberation, multiple speech sources, multiple recording devices, etc. Previous challenges have sparked much innovation when it comes to designing systems capable of handling these complications. In this spirit, the(More)
As a child acquires language, he or she: perceives acoustic information in his or her surrounding environment; identifies portions of the ambient acoustic information as languagerelated; and associates that language-related information with his or her perception of his or her own language-related acoustic productions. The present work models the third task.(More)
Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize(More)
Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. We define the restrained bondage number br(G) of a nonempty graph G to be the minimum(More)
Plummer [3] showed that categorial grammars based on NLS4, the non-associative multimodal Lambek Calculus enriched with S4 axioms, weakly recognize context-free languages. However, the proof contains a gap. We correct the earlier proof, utilizing a technique given in Buszkowski [1]. This technique immediately proves that NLS4 is decidable in polynomial time.
Traditionally the positioning of pneumatic actuators has been limited to movement between preset stops or switches. The restricting factors preventing the use of pneumatic cylinders for accurate servo-control arise from highly nonlinear dynamic properties such as air compressibility and friction effects, which combine to severely degrade time response and(More)
Let G = (V,E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V − S is adjacent to a vertex in V − S. The total restrained domination number of G, denoted by γtr(G), is the smallest cardinality of a total restrained dominating set of G. We show that if T is a tree of order n, then(More)
A switched inertance hydraulic system uses a fast switching valve to control flow or pressure and is potentially very efficient as it does not rely on dissipation of power by throttling. This article studies its performance using an analytical method which efficiently describes the system in the time domain and frequency domain. A lumped parameter model and(More)