Although the confusion of individual phonemes and features have been studied and analyzed since Miller and Nicely [8], there has been little work done on extending this to a predictive theory of word-level confusions. The PGPfone alphabet is a good touchstone problem for developing such word-level confusion metrics. This paper presents some difficulties incurred, along with their proposed solut...

We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While structured meshes, one can refine elements alternatingly in horizontal and vertical direction, such approach cannot be generalized directly to where no two unique global mesh directions assigned. To resolve this issue, we introduce the concept of direction indices, i.e., integers associated each edge, whi...

I thank Alice Leonhardt for typing (and retyping) the manuscript so nicely and accurately.

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, which contains in particular, the nicely locally treedecomposable classes. For every class of bounded expansion we prove that every bounded formula has an O(log(n))-labeling scheme. We also prove that, for fixed k, every ...

Commentary NMDA-type glutamate receptors (NMDARs) have been front and center in synaptic plasticity (1) since they were first distinguished from other glutamate receptors pharmacologically in the 1980s. NMDARs are typically assembled from GluN subunits (GluN1, 2A-D) as tetrameric heteromers containing two GluN1 subunits and two, not necessarily the same, GluN2 subunits (2). Subunit " guidelines...

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of s...

The main approach of traditional information retrieval (IR) is to examine how many words from a query appear in a document. A drawback of this approach, however, is that it may fail to detect relevant documents where no or only few words from a query are found. The semantic analysis methods such as LSA (latent semantic analysis) and LDA (latent Dirichlet allocation) have been proposed to addres...

An analytical solution for the case of transient, pumping-induced drawdown in a nonuniform aquifer is presented. The nonuniform aquifer is conceptualized as a uniform matrix into which a disk of anomalous properties has been placed. The disk can be arbitrarily located with respect tothe pumping well. This solution can be used to develop considerable insight concerning the nature of drawdown i n...

We show examples for higher-order functional logic programming in which both programming concepts nicely complement each other. These include modeling distributed systems, parsing and hardware synthesis.