On January 24, 2015, the folk punk band Dropkick Murphys penned a tweet to former Wisconsin Governor Scott Walker that read “please stop using our music in any way…We literally hate you!!!” Within hours, thousands of users interacted with post and contentious mediated discussion materialized. By exporting full conversation program BrandWatch applying Sonja Foss’s ideological criticism approach,...

Although m a n y methods exist f o r nested loop partitioning, most of t hem perform poorly when parallelizing loops with non-uniform dependences. This paper addresses the issue of parallelizing nested loops with non-uniform dependences. Our approach is based o n convex hull theory, which has adequate information t o handle non-uniform dependences. W e introduce the concept of Complete Dependen...

On a fixed finite set {1, . . . , n}, we consider the set of metrics for which the metric space can be isometrically embedded in the real line. To understand the geometry of this set, we study its convex hull, Qn, and the closure of its convex hull, Qn. We first show how the set of metrics is contained in its convex hull and characterize all unbounded one-dimensional extreme subsets of Qn combi...

This paper deals with set invariance for time delay systems. The first goal of the paper is to review the known necessary or sufficient conditions for the existence of invariant sets with respect to dynamical systems described by discrete-time delay difference equations (dDDEs). Secondly, we address the construction of invariant sets in the original state space (also called D-invariant sets) by...

A set of meet-irreducible ideals is described for a class of maximal triangular almost finite algebras. This set forms a topological space under the hull-kernel closure, and there is a one-to-one correspondence between closed sets in this space and ideals in the AF algebra. Some connections with nest representations and nestprimitive ideals are also described.

The output-sensitive “ultimate planar convex hull algorithm” of Kirkpatrick and Seidel [16] recently has been shown by Afshani et al. [1] to be instance-optimal. We revisit this algorithm with a focus on space-efficiency and prove that it can be implemented as an in-place algorithm, i.e., using O(1) working space.

In this paper, two cardinal inequalities for functionally Hausdorff spaces are established. A bound on the cardinality of the τθ-closed hull of a subset of a functionally Hausdorff space is given. Moreover, the following theorem is proved: ifX is a functionally Hausdorff space, then |X| ≤ 2χ(X)wcd(X).

We have shown genetic programming (GP) can automatically fuse given classifiers of diverse types to produce a hybrid classifier. Combinations of neural networks, decision trees and Bayes classifiers have been formed. On a range of benchmarks the evolved multiple classifier system is better than all of its components. Indeed its Receiver Operating Characteristics (ROC) are better than [Scott et ...

• Charles Shearer, University of New Mexico, Co-chair (former chair CAPTEM) • Clive Neal, University of Notre Dame, Co-chair (chair LEAG) • Lou Allamandola, Ames Research Center • Jacob Bleacher, Goddard Space Flight Center • Jesse Buffington, Johnson Space Center • Simon Clemett, Johnson Space Center • Dean Eppler, Johnson Space Center • Fred Hörz, Jacobs Technology • Lindsay Keller, Johnson S...