This article conceptualizes algorithmic consumer culture, and offers a framework that sheds new light on two previously conflicting theorizations: (1) digitalization tends to liquefy culture thus acts primarily as an empowering force, (2) digitalized marketing big data surveillance practices tend deprive consumers of all autonomy. By drawing critical social theories algorithms AI, we define his...

The number of solutions involved in many algorithmic composition problems is too large to be tractable without simplification. Given this, it is critical that composition algorithms be able to move through different levels of abstraction while maintaining a well-organized solution space. In this paper we present the following contributions: (1) extended formalizations and proofs needed to imple...

This paper presents a novel approach to building an integrated uncertainty quantification (UQ) methodology suitable for modern-day component-based approach for multi-physics simulation development. Our “hybrid” UQ methodology supports independent development of the most suitable UQ method, intrusive or non-intrusive, for each physics module by providing an algorithmic framework to couple these ...

This paper describes Knitro 5.0, a C-package for nonlinear optimization that combines complementary approaches to nonlinear optimization to achieve robust performance over a wide range of application requirements. The package is designed for solving large-scale, smooth nonlinear programming problems, and it is also effective for the following special cases: unconstrained optimization, nonlinear...

An algebraic model generalizing submodular polytopes is presented, where modular functions on partially ordered sets take over the role of vectors in R . This model unifies various generalizations of combinatorial models in which the greedy algorithm and the Monge algorithm are successful and generalizations of the notions of core and Weber set in cooperative game theory. As a further applicati...