Results 21 to 30 of about 2,250,867 (343)
Pseudo o-Minimality for Double Stone Algebras [PDF]
Mathematics Interdisciplinary Research, 2023 Pseudo o-minimality is a generalization of o-minimality of linear orders to partial orders. Recently Lei Chen, Niandong Shi and Guohua Wu provided pseudo o-minimality for the class of Stone algebras. In this note we use quantifier elimination property to
Farhad Jahanian, Jafar Sadegh Eivazloo
doaj +1 more source
Orders between Channels and Implications for Partial Information Decomposition
Entropy, 2023 The partial information decomposition (PID) framework is concerned with decomposing the information that a set of random variables has with respect to a target variable into three types of components: redundant, synergistic, and unique.
André F. C. Gomes +1 more
doaj +1 more source
Ordering Strict Partial Orders to Model Behavioral Refinement [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Software is now ubiquitous and involved in complex interactions with the human users and the physical world in so-called cyber-physical systems where the management of time is a major issue.
Mathieu Montin, Marc Pantel
doaj +1 more source
Poset Codes: Partial Orders, Metrics and Coding Theory
, 2018 Marcelo Firer +3 more
openalex +2 more sources
Partially ordered secretaries [PDF]
Electronic Communications in Probability, 2010 The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's task is to choose online a maximal element.
Freij, Ragnar, Wästlund, Johan
openaire +3 more sources
Partial Order Rank Features in Colour Space
Applied Sciences, 2020 Partial orders are the natural mathematical structure for comparing multivariate data that, like colours, lack a natural order. We introduce a novel, general approach to defining rank features in colour spaces based on partial orders, and show that it is
Fabrizio Smeraldi +3 more
doaj +1 more source
On Information Orders on Metric Spaces
Information, 2021 Information orders play a central role in the mathematical foundations of Computer Science. Concretely, they are a suitable tool to describe processes in which the information increases successively in each step of the computation.
Oliver Olela Otafudu, Oscar Valero
doaj +1 more source
Virtual function placement for service chaining with partial orders and anti‐affinity rules [PDF]
Networks, 2017 Software‐Defined Networking and Network Function Virtualization are two paradigms that offer flexible software‐based network management. Service providers are instantiating Virtualized Network Functions, for example, firewalls, DPIs, gateways—to highly ...
Zaid Allybokus +4 more
semanticscholar +1 more source
Axioms, 2019 We continue the presentation of new results in the calculus for interval-valued functions of a single real variable. We start here with the results presented in part I of this paper, namely, a general setting of partial orders in the space of compact ...
Luciano Stefanini +2 more
doaj +1 more source
Stochastic Partial Ordering [PDF]
The Annals of Probability, 1978 A probability measure $P$ on a partially ordered Polish space $E$ is called stochastically smaller than $Q$ (notation: $P \leqslant Q$) if $\int f dP \leqslant \int f dQ$ holds for all bounded increasing measurable $f$. We investigate the question when for a stochastically increasing family $\{P_t, t \in \mathbb{R}\}$ there exists an increasing process
Kamae, T., Krengel, U.
openaire +3 more sources