Phonological ganging is a type of cumulativity in constraint interaction where one strong constraint C1 can be overtaken by two weaker constraints C2 and C3 together but not by C2 or C3 independently (e.g., Jäger and Rosenbach 2006). In strict-ranking Optimality Theory (OT), phonological ganging is achieved via (local) constraint conjunction (e.g., Smolensky 1993, 2006; Baković 2000; Ito and Me...

If K is a field with discrete valuation ν and D = {a ∈ K : ν(a) ≥ 0}, then an algebra D[x] ⊆ A ⊆ K[x] has associated to it a sequence of fractional ideals {In : n = 0, 1, 2, . . . } with In consisting of 0 and the leading coefficients of elements of A of degree no more than n and a sequence of integers {a(n) : n = 0, 1, 2, . . . } with a(n) = −ν(In). Combinatorial properties of this integer seq...

Differential scanning calorimetry (DSC) was used to determine the transition temperature ranges (TTR) of four types of super-elastic orthodontic nickel-titanium coil springs (Sentalloy). A knowledge of the TTR provides information on the temperature at which a NiTi wire or spring can assume superelastic properties and when this quality disappears. The spring types in this study can be distingui...

Whereas most previous studies on (super-)gang effects examined cases where two weaker constraints jointly beat another stronger constraint (Albright 2012; Shih 2017; Breiss & Albright 2022), this paper addresses gang that arise from multiple violations of a single constraint, which Jäger Rosenbach (2006) referred to as counting cumulativity. The super-additive version cumulativity is th...

We present and illustrate the use of a bottleneck system for the segmentation and super-resolution of ISAR targets. The system is shown to be comprised of three basic subsystems: a compressing transformation, a bottleneck processor, and a decompressing transformation. We describe each subsystem and discuss the processing responsible for segmentation and super-resolution within this framework. R...

The main di culty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (sti ) ordinary di erential equations (ODE's) is to e ciently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a parallel implementation is equivalent to the cost for the implicit Euler method. The preconditioner is ba...