In the basic paper defining the Gröbner Cover [16] for discussing parametric polynomial systems of equations, we 8 introduced algorithms that have been improved since then. We used our own algorithm buildtree for computing 9 the initial Comprehensive Gröbner System (CGS), needed for the Gröbner Cover, now substituted in the Singular [7] 10 library “grobcov.lib” by themore efficientKapur–Sun–Wan...

We present a logspace algorithm for computing a canonical interval representation and a canonical labeling of interval graphs. As a consequence, the isomorphism and automorphism problems for interval graphs are solvable in logspace.

This paper describes a systematic method and an experimental software system for high-level transformations of designs specified at behavioral level. The goal is to transform the initial design specifications into an optimized data flow graph (DFG) better suited for high-level synthesis. The optimizing transformations are based on a canonical Taylor Expansion Diagram (TED) representation, follo...

A deterministic function of a Markov process is called an aggregated Markov process. We give necessary and suucient conditions for the equivalence of continuous-time aggregated Markov processes. For both discrete-and continuous-time, we show that any aggregated Markov process which satisses mild regularity conditions can be directly converted to a canonical representation which is unique for ea...

Human performance in the recognition of 3-D objects, as measured by response times and error rates, frequently depends on the orientation of the object with respect to the observer. We investigated the dependence of response time (RT) and error rate (ER) on stimulus orientation for a class of random wire-like objects. First, we found no evidence for universally valid canonical views: the best v...

Let M be a frame matroid or a lifted-graphic matroid and let (G,B) be a biased graph representing M . Given a field F, a canonical F-representation of M particular to (G,B) is a matrix A arising from a gain function over the multiplicative or additive group of F that realizes (G,B). First, for a biased graph (G,B) that is properly unbalanced, loopless, and vertically 2-connected, we show that t...

operation canonical sign digit plays an important roll in processing signal. Advantage of this implementation is to reduce the number of adders in hardware and also increase the speed of operation. Filter bank filters the low resolution information using lowpass filter and high resolution information by using high pass filter. Wavelet coefficient decides the characteristic of filter. In this me...

Fuzzy numbers, and more generally linguistic values, are approximate assessments, given by experts and accepted by decision-makers when obtaining more accurate values is impossible or unnecessary. To simplify the task of representing and handling fuzzy numbers, several authors have introduced real indices in order to capture the information contained in a fuzzy number. In this paper we propose ...

In mathematics, complete classification of structures, such as groups and rings, is often a primary goal. Linear transformations are no exception to this. Certain canonical forms exist to classify linear transformations, therefore creating a unique representative of linear transformations in the same similarity class. Diagonal representation is of course one of the simplest examples of a canoni...