Consensus Measures for Qualitative Order Relations

1990 ◽  
pp. 219-230 ◽  
Author(s):  
Piera Mazzoleni
Keyword(s):  
Order Relations

On the numerical semigroup generated by {bn+1+i+bn+i−1b−1∣i∈N}$\begin{array}{} \{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\} \end{array}$

2020 ◽  
Vol 30 (4) ◽  
pp. 257-264
Author(s):  
Ze Gu
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Embedding Dimension ◽  
Order Relations ◽  
Positive Integers

AbstractLet b, n be two positive integers such that b ≥ 2, and S(b, n) be the numerical semigroup generated by $\begin{array}{} \{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\} \end{array}$. Applying two order relations, we give formulas for computing the embedding dimension, the Frobenius number, the type and the genus of S(b, n).

Personality and psychopathology: Higher order relations between the five factor model of personality and the MMPI-2 Restructured Form

2013 ◽  
Vol 47 (5) ◽  
pp. 572-579 ◽  
Author(s):  
Paul T. van der Heijden ◽  
Gina M.P. Rossi ◽  
William M. van der Veld ◽  
Jan J.L. Derksen ◽  
Jos I.M. Egger
Keyword(s):  
Factor Model ◽  
Five Factor Model ◽  
Higher Order ◽  
Order Relations

General coalescence conditions for the exact wave functions. II. Higher-order relations for many-particle systems

2014 ◽  
Vol 140 (21) ◽  
pp. 214103 ◽  
Author(s):  
Yusaku I. Kurokawa ◽  
Hiroyuki Nakashima ◽  
Hiroshi Nakatsuji
Keyword(s):  
Higher Order ◽  
Particle Systems ◽  
Wave Functions ◽  
Order Relations

On the comparison of waiting times in tandem queues

1981 ◽  
Vol 18 (03) ◽  
pp. 707-714 ◽  
Author(s):  
Shun-Chen Niu
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Waiting Times ◽  
Distribution Functions ◽  
Partial Ordering ◽  
Tandem Queues ◽  
Order Relations ◽  
Service Distribution ◽  
In Series ◽  
Definition Of

Using a definition of partial ordering of distribution functions, it is proven that for a tandem queueing system with many stations in series, where each station can have either one server with an arbitrary service distribution or a number of constant servers in parallel, the expected total waiting time in system of every customer decreases as the interarrival and service distributions becomes smaller with respect to that ordering. Some stronger conclusions are also given under stronger order relations. Using these results, bounds for the expected total waiting time in system are then readily obtained for wide classes of tandem queues.

Sign in / Sign up

Export Citation Format

Share Document