let $g$ be a simple graph of order $n$. the domination polynomial of $g$ is the polynomial $d(g, x)=sum_{i=gamma(g)}^{n} d(g,i) x^{i}$, where $d(g,i)$ is the number of dominating sets of $g$ of size $i$ and $gamma(g)$ is the domination number of $g$. in this paper we present some families of graphs whose domination polynomials are unimodal.

The aim of this research was to investigate what emotions are perceived from incongruent vocal and facial emotional expressions as an integrated emotional expression. Our approach is unimodal and bimodal perceptual emotional information mapping to dimensions of emotional space created with principal component analysis (PCA). Unimodal perception tests and a bimodal congruent/incongruent percepti...

Relaxation oscillators can usually be represented as a feedback system with hysteresis. The relay relaxation oscillator consists of relay hysteresis and a linear system in feedback. The objective of this work is to study the existence of periodic orbits and the dynamics of coupled relay oscillators. In particular, we give a complete analysis for the case of unimodal periodic orbits, and illustr...

Density functions that represent sample data are often multimodal, i.e. they exhibit more than one maximum. Typically this behavior is taken to indicate that the underlying data deserves a more detailed representation as a mixture of densities with individually simpler structure. The usual specification of a component density is quite restrictive, with log-concave the most general case consider...

ABSTRACT Unimodal systems have limited information that can be used for identity recognition systems. The multimodal system was created to improve the unimodal system. in this study is combination of face and palms at matching score level. Matching scores done using Weighted Sum Rule method. Extract features from each sample Local Binary Pattern (LBP) Meanwhile, large data dimensions are reduce...

We prove a number of limiting distributions for statistics unimodal sequences positive integers by adapting probabilistic framework integer partitions introduced Fristedt. The difficulty in applying the direct analogue Fristedt's techniques to lies fact that generating function is an infinite product, while not. Essentially, we get around this conditioning on size largest part and working unifo...