Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we describe an efficient algorithm for computing the transitive closures of difference bounds, octagonal and finite monoid affine relations. On the theoretical side, this framework provides a common solution to the acceleration problem, for all these three classes of r...

beta-expansions and ultimately periodic representations Michel Rigo, Wolfgang Steiner To cite this version: Michel Rigo, Wolfgang Steiner. Abstract beta-expansions and ultimately periodic representations. Journal de Théorie des Nombres de Bordeaux, Société Arithmétique de Bordeaux, 2005, 17, pp.283-299. HAL Id: hal-00023235 https://hal.archives-ouvertes.fr/hal-00023235 Submitted on 21 Apr 2006 ...

Much efforts have been made for the realization of hybrid Josephson junctions incorporating various materials for the fundamental studies of exotic physical phenomena as well as the applications to superconducting quantum devices. Nonetheless, the efforts have been hindered by the diffusive nature of the conducting channels and interfaces. To overcome the obstacles, we vertically sandwiched a c...

This article is concerned with the ultimately bounded filtering problem for a class of linear time-delay systems subject to norm-bounded disturbances and impulsive measurement outliers (IMOs). The considered IMOs are modeled by sequence signals certain known minimum norm (i.e., norms all signals). In order characterize occasional occurrence IMOs, independent identically distributed random varia...