An important predictor of historical sound change, functional load, fails to capture insights from speech perception. Building on ideal observer models of word recognition, we devise a new definition of functional load that incorporates both a priori expectedness and perceptual information. We explore this new measure with a simple model and find that it outperforms tra-

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

We develop a new approach for establishing the Macaulayness of posets representable as cartesian powers of other posets. This approach is based on a problem of constructing an ideal of maximum rank in a poset. Using the relations between the maximum rank ideal problem and the edge-isoperimetric problem on graphs we demonstrate an application of our approach to specification of all posets with a...

Let IA be the toric ideal of a homogeneous normal configuration A ⊂ Z . We prove that IA is generated by circuits if and only if each unbalanced circuit of IA has a “connector” which is a linear combination of circuits with a square-free term. In particular if each circuit of IA with non-square-free terms is balanced, then IA is generated by circuits. As a consequence we prove that the toric id...

Let G be a finite simple graph with edge ideal I (G). Let I (G)∨ denote the Alexander dual of I (G). We show that a description of all induced cycles of odd length in G is encoded in the associated primes of (I (G)∨)2. This result forms the basis for a method to detect odd induced cycles of a graph via ideal operations, e.g., intersections, products and colon operations. Moreover, we get a simp...

Stereoscopic surface detection of human and ideal observers was assessed using a signal detection paradigm. Signal displays were disparity defined sinusoidal or square wave corrugations in depth containing various amounts of additive disparity noise. Distracter displays were created by scrambling pure signal stimuli along the vertical dimension destroying surface representation while leaving th...

The logic construction of a double-edge-triggered (DET) flip-flop, which can receive input signal at two levels of the clock, is analyzed and a new circuit design of CMOS DET flip-flop is proposed. Simulation using SPICE and a 1 micron technology shows that this DET flip-flop has ideal logic functionality, a simpler structure, lower delay time and higher maximum data rate compared to other exis...

Let (X, g) be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold. We calculate the various polynomially weighted de Rham cohomology spaces of X , as well as the associated spaces of harmonic forms. In the unweighted case, this is closely related to recent...