This paper presents a stochastic subspace identification algorithm to compute stable, minimum phase models from a stationary time-series data. The algorithm is based on spectral factorization techniques and a stochastic subspace identification method via a block LQ decomposition (Tanaka and Katayama, 2003c). Two Riccati equations are solved to ensure both stability and minimum phase property of...

We obtain a formula for the S-class number of an algebraic torus defined over a number field in terms of the étale and Galois cohomology groups of its character module. As applications, we give different proofs of some classical class number formulas of Shyr, Ono, Katayama and Morishita.

A commercial indirect hemagglutination (IHA) test using erythrocytes coated with Schistosoma mansoni adult worm antigens (WA) and an enzyme-linked immunosorbent assay (ELISA) with S. mansoni egg antigens (SEA) were assessed for their use in serodiagnosis of imported schistosomiasis (hereafter these tests are designated WA/IHA and SEA/ELISA, respectively). The sensitivity of the tests was evalua...

BACKGROUND Katayama fever is an acute clinical condition characterised by high fever, dry cough and general malaise occurring during early Schistosoma spp. infection. It is predominantly reported in travellers from non-endemic regions. Whereas the immunological response to Schistosoma infection is well characterised, alterations in inflammatory markers and coagulation in response to acute infec...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.

Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming this, we introduce incremental learning, a process in which an inductive programming system automatically modifies its inductive bias towards some domain through solving a sequence of gradually more difficult problems ...

2 H optimization was conceived to remove stochastics from LQG optimization (Doyle, Glover, Khargonekar, and Francis, 1989.) It relies on the observation that the customary signal-based mean square criterion of LQG optimization may be re-interpreted as a system norm (in particular, the 2 H norm), without direct reference to the signals that are involved. A moment's thought, however, reveals that...

we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.