For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain. 1991 Mathematics Subject classification: primary 52C07; secondary 11H55 An n-dimensional lattice determines two normal partitions of the ...

An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...

Sleep mode and exploiting it to maximize sleep time are of great importance in low power synthesis of digital circuits. The motivation is to de-activate the memory refresh circuitry, apply power down or just disable the clock signals during the inactive periods of operation of circuit elements, and thus minimize the power consumption. Since it is impractical to have a separate set of control si...

In this work, we propose a pseudometric based on a fuzzy relation, which is itself derived from a fuzzy partition. This pseudometric is a metric in the particular case in which the fuzzy partition is composed solely by triangular fuzzy sets. We prove that these functions are indeed a pseudometric and a metric and illustrate their use in an experiment for the classification of land use in an are...

The conformal spectra of the critical dilute A–D–E lattice models are studied numerically. The results strongly indicate that, in branches 1 and 2, these models provide realizations of the complete A–D–E classification of unitary minimal modular invariant partition functions given by Cappelli, Itzykson and Zuber. In branches 3 and 4 the results indicate that the modular invariant partition func...

Flow visualization has been a very active subfield of scientific visualization in recent years. From the resulting large variety of methods this paper discusses partition-based techniques. The aim of these approaches is to partition the flow in areas of common structure. Based on this partitioning, subsequent visualization techniques can be applied. A classification is suggested and advantages/...

We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we experiment with several partitioning algorithms and also propose a novel vari...

This paper focuses on a new direction for packet classification, which can substantially improve the performance of a classifier by decreasing the rule-base lookup latency. The classifier partitions the rule-base into smaller independent sub-rule bases by using the hash key of hashing technique. We apply the concept of maximum entropy to select the hash key for optimal partitioning of rule-base...

Feature Extraction is a mechanism used to extract key phrases from any given text documents. This extraction can be weighted, ranked or semantic based. Weighted and Ranking based feature extraction normally assigns scores to extracted words based on various heuristics. Highest scoring words are seen as important. Semantic based extractions normally try to understand word meanings, and words wit...

A pattern recognition technique, the linear learning machine method, has been used to determine structure-activity relatiorrships for certain steroids. The steroids used in this study were classified into two categories according to their observed parti tion coefficient and a correlation made with certain substructural descriptors. The linear learning machine method was employed to calculate a ...