About: Hyperplane separation theorem is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 142 citations. The topic is also known as: Minkowski's theorem.
TL;DR: In this paper, the authors introduce the concept of modal reliability, which is defined as the amount of uncertainty the system can tolerate before failure, i.e., a system is reliable if it can tolerate a large amount of unknownness before failure can occur.
TL;DR: The general problem to be considered in this paper is to find a meaningful partition of systems’ behaviors using an order preserving mapping from a space of m attributes into an m‐dimensional Euclidean space.
Abstract: The general problem to be considered in this paper is as follows: Given a general system defined by m attributes, find a meaningful partition of systems’ behaviors Using an order preserving mapping from a space of m attributes into an m‐dimensional Euclidean space, a partitioning criterion of systems' behaviors is defined Then, its mathematical properties are studied, on the basis of the usual hyperplane separation theorem and of the existence theorem of ton Neumann and Morgenstern's utility function
TL;DR: In this article, the authors focus on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006), and develop necessary and sufficient constraint characterizations of Torders within Harmonic Grammar and Optimality Theory.
Abstract: This paper focuses on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006). It develops necessary and sufficient constraint characterizations of T-orders within Harmonic Grammar and Optimality Theory. These conditions rest on the rich convex geometry underlying these frameworks. They are phonologically intuitive and have significant algorithmic implications.