This paper proposes a data clustering algorithm that combines the steady-state genetic algorithm and the ensemble learning method, termed as genetic-guided clustering algorithm with ensemble learning operator (GCEL). GCEL adopts the steady-state genetic algorithm to perform the search task, but replaces its traditional recombination operator with an ensemble learning operator. Therefore, GCEL c...

We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate configurations, we maximum achievable fidelity as a function circuit size. This information allows us identify size specific target operation enumerate different configuratio...

A recently developed algebraic approach for constructing coherent states for solvable potentials is used to obtain the displacement operator coherent state of the Pöschl-Teller potential. We establish the connection between this and the annihilation operator coherent state and compare their properties. We study the details of the revival structure arising from different time scales underlying t...

In this paper we study the asymptotic behavior of the ground state energy E(R) of the Schrödinger operator PR = −∆ + V1(x) + V2(x−R), x, R ∈ IR, where the potentials Vi are small perturbations of the Laplacian in IR, n ≥ 3. The methods presented here apply also in the investigation of the ground state energy E(g) of the operator Pg = P + V1(x) + V2(gx), x ∈ X, g ∈ G, where Pg is an elliptic ope...

An incremental development framework which supports a conform construction of Protocol State Machines (PSMs) is presented. We capture design concepts and strategies of PSM construction by sequentially applying some development operators: each operator makes evolve the current PSM to another one. To ensure a conform construction, we introduce three conformance relations, inspired by the specific...

Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Given a widening operator one can compute an upper approximation of a least fixpoint in finite number of steps even if the least fixpoint is uncomputable. We present a widening operator for automata encoding integer sets. ...

A $it{weighted~slant~Toep}$-$it{Hank}$ operator $L_{phi}^{beta}$ with symbol $phiin L^{infty}(beta)$ is an operator on $L^2(beta)$ whose representing matrix consists of all even (odd) columns from a weighted slant Hankel (slant weighted Toeplitz) matrix, $beta={beta_n}_{nin mathbb{Z}}$ be a sequence of positive numbers with $beta_0=1$. A matrix characterization for an operator to be $it{weighte...

We unify the parallel composition rule of assumption-commitment speciications for respectively state-based and message-based concurrent processes. Without providing language-dependent deenitions, we rst assume that the model of a process can be given as a set of`sequences' (e.g., traces, state sequences). Then we assume the existence of a merging operator that captures the compositionality of t...