Results of Bunge and Funk and of Johnstone, providing constructively sound descriptions of the global points of the lower and upper powerlocales, are extended here to describe the generalized points and proved in a way that displays in a symmetric fashion two complementary treatments of frames: as suplattices and as preframes. We then also describe the points of the Vietoris powerlocale. In eac...

In 1965 Tauer produced a countably infinite family of semi-regular masas in the hyperfinite II1 factor, no pair of which are conjugate by an automorphism. This was achieved by iterating the process of passing to the algebra generated by the normalisers and, for each n ∈ N, finding masas for which this procedure terminates at the n-th stage. Such masas are said to have length n. In this paper we...

The closure of a regular language under a [partial, semi-] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial, semi-] commutation still regular? (2) Are there any robust classes of languages closed under [partial, semi-] commutation? We show that the class Pol(G) of polynomials of group l...

This paper describes a method for semi-regular remeshing of arbitrary shapes. The proposed approach is based on building a parameterization map which is smooth with respect to a differential structure built on the base domain. A global parametric energy functional is introduced and optimized in order to establish a globally smooth parameterization. The proposed approach avoids using meta-mesh c...

The concept of γ-semi-regular-open sets and γ-sclosed spaces have been introduced and explored in [6]. In this paper, we continue studying the properties and characterizations of γ-semi-regular open sets and γ-s-closed spaces.

In this article we present a semi-supervised algorithm for pattern discovery in information extraction from textual data. The patterns that are discovered take the form of regular expressions that generate regular languages. We term our approach ‘semi-supervised’ because it requires significantly less effort to develop a training set than other approaches. From the training data our algorithm a...

RÉSUMÉ. Nous présentons un algorithme heuristique pour déterminer une solution d’un problème de satisfaction de contraintes continu. Cet algorithme, appelé Recherche Locale Dichotomique ( ), combine la recherche locale, la bissection et la contraction d’intervalles avec la propagation de contraintes. Nous présentons des résultats expérimentaux et les comparons avec un algorithme de recherche lo...

1 Définir l’ontologie locale Une ontologie locale est définie l’ontologie du domaine, articulée à cette dernière par la relation de subsumption par : Spécialisation des sous-ensemble de classes de l’ontologie de domaine recouvrant les besoins du cahier de charges et par importation sélective des propriétés pertinentes. Enrichissement de l’ontologie locale pour répondre aux objectifs applicatifs...

This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second preframe constructions. The symmetries between these two approaches to locale theory are explored. Given an informal assumption that open locale maps are parallel to proper maps (an assumption hinted at by the underlying fin...

Plant macrofossils extracted from fossil woodrat (Neotoma spp.) middens at a single locale in the northwestern Great Basin were used to examine vegetation dynamics during the last 30 000 yr. Although the modem assemblage of xeric species at the study site is a recent occurrence, a large proportion of the modem plant taxa near the study locale were also found 12 000 30 000 yr BP. The persistence...