Sentence examples for generated refinement from inspiring English sources

In fact, the class of primely generated refinement monoids satisfies many other nice cancellation properties, e.g. unperforation.

Investigations (by Ara and Goodearl, see [32]) continue into whether or not every finitely generated refinement monoid is realizable; whether or not the realization passes to direct limits; and whether or not there are wild monoids which are not realizable.

More generally, one can divide the (countable refinement) monoids arising in the Realization Problem into two types: tame (those which can be constructed as direct limits of finitely generated refinement monoids), and the others (called wild).

(1) is established by a careful analysis of the generators and relations which produce the graph monoid M E. On the other hand, (2) follows in part from results of Brookfield [52] on primely generated refinement monoids.

Using direct limit arguments, one can show that the graph monoid M E corresponding to a countable graph E can be realized as V ( R ) for a von Neumann regular algebra R. Indeed, M E is constructed as a direct limit of monoids of the form M F, where the graphs F are finite; in particular, M E is a direct limit of finitely generated refinement monoids.

In this paper, we propose a new method settled on the rough set theory and description logics (DLs) for automatically generating refinements or related terms to queries.

Only in a single case (1AY7), a three-star prediction could be generated after refinement in the CPORT run (results not shown).

While a one-star model could be generated during refinement in 58% of the cases overall, this percentage increased to 80% for enzymes (91% of the rigid enzymes and 25% of the medium/hard enzymes) while it was only 41% for non-enzyme complexes (57% of the rigid non-enzymes and 15% of the medium/hard non-enzyme complexes).

The models thus generated were refined with PHENIX using individual B-factor refinement (occupancies were not refined).

In this section, we discuss the regularity and stability of a scaling function generated by the refinement mask of a smoothed pseudo-spline.

As a result any such diagram can be associated with a formal specification, proof obligations ensuring invariant properties can be automatically generated, and the refinement relations between documents at different abstraction levels can be formally stated and proved.