This paper presents a tool which synthesizes timed circuits from reduced state graphs. Using timing information to reduce state graphs can lead to significantly smaller and faster circuits. The tool uses implicit techniques (binary decision diagrams) to represent these graphs. This allows us to synthesize larger, more complex systems which may be intractable with an explicit representation. We ...

Fuel cells belong to an avant-garde technology family for a wide variety of applications including micro-power, transportation power, stationary power for buildings and other distributed generation applications. The first objective of this contribution is to find a suitable reduced model of a Solid Oxide Fuel Cell (SOFC). The derived reduced model is then used to design a state estimator. I...

The focus of current researches in geometric modelling is the extension of the representational power in order to encompass the non-manifold objects. In the present paper a non-manifold boundary representation is proposed. New types of topological elements are introduced to extend the dimension of the non-manifold condition at a face. This structure is based on the theory of simplicial complexe...

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

The ability of an automatic speech recognition system (ASR) to output multiple recognition hypotheses is becoming increasingly important. For example in dialogue systems and machine translation systems where the ASR must interact with modules that handle discourse, semantics and pragmatics. Passing multiple recognition hypotheses to the higher levels of the system is a way of increasing the cou...

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

Introduction: Until now, many models have been presented for optical study of the human eye. In recent years, surgery on the anterior section of the eye (such as cataract and photo-refractive surgery) has increased, so a study on the optics of the eye and evaluation of vision quality has become more important. Material and Methods: In this article, some of these models are considered. They incl...