In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.

We present data structures and an eecient algorithm realizing eecient performance driven generation of integer adders. The generator is parameterized in n, the operands' bitlength, and tn, the delay of the addition. It outputs an area minimal n-bit adder of the conditional-sum type with delay tn, if such a circuit exists.

We give a new short proof of the fact that the CastelnuovoMumford regularity of a strongly stable ideal is the highest degree of a minimal monomial generator. Our proof depends on results due to D. Maclagan and G. Smith on multigraded regularity. More precisely, we construct a Stanley filtration for strongly stable ideals which provides a bound for the Castelnuovo-Mumford regularity.

Extracting a minimal relevant segment of an extensive domain ontology is an often recurring problem in ontology engineering. We present a software solution to this problem that is the combination of an ontology-independent user interface generator and a module implementing an ontology segmentation algorithm. We describe the algorithm and compare it with other ontology segmentation methods propo...

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm [30,10]. It has gradually become apparent that linear block codes also/]ave a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-1ike algorithn] [2,31,22,11,27,14,12,16,24,25,8,15]....

We characterize the image of the Poisson transform on any distinguished boundary of a Riemannian symmetric space of the noncompact type by a system of differential equations. The system corresponds to a generator system of two-sided ideals of a universal enveloping algebra, which are explicitly given by analogues of minimal polynomials of matrices.

We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.

A photovoltaic (PV)/wind/battery/Generator-Set hybrid power system's energy dispatch is discussed in this research, along with the ideal solution. The optimization model enables generating devices to share appropriately. main goals are minimize fuel consumption and costs maximize usage of Renewable Energy Sources (RES). proposed simulation plan succeeds lowering because diesel generator only ki...

We investigate the computational complexity of some decision and counting problems related to generators of closed sets fundamental in Formal Concept Analysis. We recall results from the literature about the problem of checking the existence of a generator with a specified cardinality, and about the problem of determining the number of minimal generators. Moreover, we show that the problem of c...