Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enumerator of a parametric polytope) is a function of the symbolic parameters that may appear in the constraints. In an extended problem (the “integer projection” of a parametric polytope), some of the variables that appear in the ...

Consider linear systems whose input data are linear functions of uncertain parameters varying within given intervals. We are interested in an explicit description of the so-called AE parametric solution sets (where all universally quantified parameters precede all existentially quantified ones) by a set of inequalities not involving the parameters. This work presents how to obtain explicit desc...

Data Envelopment Analysis (DEA) is a technique used to compare efficiency in various sectors such as hospitals, chain stores, and dealerships. It represents a set of linear programming techniques and uses deter-ministic data (inputs and outputs), in stable conditions. The DEA technique cannot be used when there is data with indeterministic nature, or when there is an environment with dynamic co...

A mode-constrained corpus-based synthesis strategy was developed for fundamental frequency (F0) contours of Japanese sentences. In the training phase, the relationship between linguistic factors and the command values (amplitudes and locations) of F0 contour generation process model was learned for a prediction module; a neural network in the current paper. Input parameters consist of linguisti...

For any l > 0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P1 ≤ 0, . . . , Ps ≤ 0, where each Pi ∈ R[X1, . . . ,Xk ] has degree ≤ 2, and computes the top l Betti numbers of S, bk−1(S), . . . , bk−l(S), in polynomial time. The complexity of the algorithm, stated more precisely, is ∑l+2 i=0 ( s i ) k2 O(min(l,s)) . For fixed l, the complexity of the algorithm ...

In this paper, we present a method for synthesizing photorealistic visual speech using a parametric model based on quadtree splines. In an image-based visual speech synthesis system, visemes are used for generating an arbitrary new image sequence. The images between visemes are usually synthesized using a certain mapping. Such a mapping can be characterized by motion parameters estimated from t...

We propose an improved region based segmentation model with shape priors that uses labels of confidence/interest to exclude the influence of certain regions in the image that may not provide useful information for segmentation. These could be regions in the image which are expected to have weak, missing or corrupt edges or they could be regions in the image which the user is not interested in s...