Related papers: Satisfaction of the Condition of Order Preservatio…
Deriving a priority vector from a pairwise comparison matrix (PCM) is a crucial step in the Analytical Hierarchy Process (AHP). Although there exists a priority vector that satisfies the conditions of order preservation (COP), the priority…
This article explores a relationship between inconsistency in the pairwise comparisons method and conditions of order preservation. A pairwise comparisons matrix with elements from an alo-group is investigated. This approach allows for a…
The present article considers stability of the solutions to nonlinear and nonautonomous compartmental systems governed by ordinary differential equations (ODEs). In particular, compartmental systems with a right-hand side that can be…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
We consider the problem of estimating the number of hidden states (the order) of a nonparametric hidden Markov model (HMM). We propose two different methods and prove their almost sure consistency without any prior assumption, be it on the…
The pairwise comparisons method is a convenient tool used when the relative order of preferences among different concepts (alternatives) needs to be determined. There are several popular implementations of this method, including the…
The topologies permitted in joint ocular dominance (OD), orientation preference (OP), and direction preference (DP) maps in the primary visual cortex (V1) are considered, with the aim of finding a maximally symmetric periodic case that can…
A recent work of the authors on the analysis of pairwise comparison matrices that can be made consistent by the modification of a few elements is continued and extended. Inconsistency indices are defined for indicating the overall quality…
Recently, order-preserving pattern (OPP) mining has been proposed to discover some patterns, which can be seen as trend changes in time series. Although existing OPP mining algorithms have achieved satisfactory performance, they discover…
We study breakdown of $CPT$ symmetry which can occur in the decay process $B \bar B \to l^\pm X^\mp f$ with $f$ being a CP eigenstate. In this process, the standard model expectations for time ordered semi-leptonic and hadronic events, i.e.…
Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard…
We investigate the processes of synchronization and phase ordering in a system of globally coupled maps possessing bistable, chaotic local dynamics. The stability boundaries of the synchronized states are determined on the space of…
Consistent approximations obtained by geometric means ($GM$) and the principal eigenvector ($EV$), turned out to be close enough for 1,000,000 not-so-inconsistent pairwise comparisons matrices. In this respect both methods are accurate…
We study the spontaneous $CP$ violation through the stabilization of the modulus $\tau$ in modular invariant flavor models. The $CP$-invaraiant potentential has the minimum only at ${\rm Re}[\tau] = 0$ or 1/2. From this prediction, we study…
Superposition is an essential feature of quantum mechanics. From the Schrodinger's cat to quantum algorithms such as Deutsch-Jorsza algorithm, quantum superposition plays an important role. It is one fundamental and crucial question how to…
The article is devoted to the problem of inconsistency in the pairwise comparisons based prioritization methodology. The issue of "inconsistency" in this context has gained much attention in recent years. The literature provides us with a…
The stable principal component pursuit (SPCP) problem is a non-smooth convex optimization problem, the solution of which has been shown both in theory and in practice to enable one to recover the low rank and sparse components of a matrix…
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a full picture of the relationships existing between four…
A memory consistency model specifies the allowed behaviors of shared memory concurrent programs. At the language level, these models are known to have a non-trivial impact on the safety of program optimizations, limiting the ability to…
We study a system of $y=2$ coupled copies of a well-known constraint satisfaction problem (random hypergraph bicoloring) to examine how the ferromagnetic coupling between the copies affects the properties of the solution space. We solve the…