A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...

Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...

This paper reports the experimental characterization of the noise performance of monolithically integrated quantum dot and quantum well 10GHz passively mode locked laser diodes. Keywords-passive mode locking, quantum dot, quantum well,

Backscattering can dramatically modify the response of ring resonators and be the limiting parameter of the Q-factor. We present evidence of backscattering, a model, and a fitting procedure that provides a complete characterization of the resonance. Keywords—resonators; backscattering;

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.