Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms offer inexpensive iterations by sampling a subset of the terms in the sum; these methods can make great progress initially, but often slow as they approach a solution. In contrast, full-gradient methods achieve...

Deterministic blind beamforming algorithms try to separate superpositions of source signals impinging on a phased antenna array by using deterministic properties of the signals or the channels such as their constant modulus or directions-of-arrival. Progress in this area has been abundant over the past ten years and has resulted in several powerful algorithms. Unlike optimal or adaptive methods...

This paper introduces OC1, a new algorithm for generating multivariate decision trees. Multivariate trees classify examples by testing linear combinations of the features at each non-leaf node of the tree. Each test is equivalent to a hyperplane at an oblique orientation to the axes. Because of the computational intractability of nd-ing an optimal orientation for these hyperplanes, heuristic me...

Estuarine ecosystems are becoming increasingly altered by the concentration of human populations near the coastline, however a robust indicator of this change is lacking. We developed an index of waterbird community integrity (IWCI) and tested its sensitivity to anthropogenic activities within 28 watersheds and associated subestuaries of Chesapeake Bay, USA. The IWCI was used as a tool to gain ...

Let A and B be simple separable nuclear monotracial C⁎-algebras, let α β strongly outer actions of a countable discrete amenable group Γ on B, respectively. In this paper, we show that α⊗idW A⊗W β⊗idW B⊗W are cocycle conjugate where W is the Razak-Jacelon algebra. Also, characterize such by using fixed point subalgebras Kirchberg's central sequence C⁎-algebras.