This document contains the proofs to the theorems of the original paper. Some lemmas are also introduced. Theorem 1. Let qδ ∈ LT S(LI , LU ∪ {δ}) be a valid suspension automaton. Then, there exists a labelled transition system q ∈ LT S(LI , LU ) such that Straces(q) = traces(qδ). Proof. Follows directly from Theorem 2 in [18]. u t Algorithm 1 Construct Hypothesis H Input: A closed and consisten...

In this paper we propose a training method for a Piece-wise Linear (PL) binary classifier used in a multi-modal person verification system. The training criterion used minimizes the false acceptance rate as well as false rejection rate, leading to a lower Total Error (TE) made by a multi-modal verification system. The performance of the PL classifier and Support Vector Machine (SVM) binary clas...

We describe a new technique for the analysis of data which is given in matrix form. We consider two sets of objects, the “row” and the “column” objects, and we represent these objects by a matrix of numerical values which describe their mutual relationships. We then introduce a new technique, the “Potential Support Vector Machine” (P-SVM), as a large-margin based method for the construction of ...

In supply chain management, achieving effective coordination among manufacturers and retailers has become a pertinent research issue. Supply chain coordination is a joint decision policy achieved by the manufacturer and a retailer. This work proposes ajoint two-level supply chain model with a singlemanufacturer and a single-retailer. The novelty of the proposed model is that the demand is expre...