General frame constructions for Z-cyclic triplewhist tournaments

Frames are useful in dealing with resolvable designs such as resolvable balanced incomplete block designs and triplewhist tournaments. Z-cyclic triplewhist tournament frames are also useful in the constructions of Z-cyclic triplewhist tournaments. In this paper, the concept of an (h₁,h₂,…,hn;u)-regular Z-cyclic triplewhist tournament frame is defined, and used to establish several quite general recursive constructions for Z-cyclic triplewhist tournaments. As corollaries, we are able to unify many known constructions for Z-cyclic triplewhist tournaments. As an application, some new Z-cyclic triplewhist tournament frames and Z-cyclic triplewhist tournaments are obtained. The known existence results of such designs are then extended.     

Constructions of optimal GDRP’s of type

Generalized doubly resolvable packings (GDRPs) represent a combinatorial characterization of constant composition codes (CCCs). In this paper, we develop a number of general constructions of GDRPs of type λ¹μ^m−1. As a consequence, a new series of optimal CCCs is obtained.     

Hypergroups on two tori

We classify all hypergroup structures on two disjoint tori and on two disjoint real lines. We show that both spaces admit many hypergroup structures, and that all examples can be constructed from group cases by substitution of open subhypergroups together with certain deformations of the group convolutions.     

Generalized balanced tournament designs and related codes

A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k − 1)-BIBD defined on a km-set V. Its blocks can be arranged into an m × (km − 1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we present a new construction for GBTDs and show that a GBTD(4, m) exists for any integer m ≥ 5 with at most eight possible exceptions. A link between a GBTD(k, m) and a near constant composition code is also mentioned. The derived code is optimal in the sense of its size.      

Singular Double Porosity Model

We consider the linear parabolic equation describing the transport of a contaminant in a porous media crossed by a net of infinitely thin fractures. The permeability is very high in the fractures but very low in the porous blocks. We derive the homogenized model corresponding to a net of infinitely thin fractures, by means of the singular measures technique. We assume that these singular measures are supported by hyperplanes of codimension one. We prove in a second step that this homogenized model could be obtained indistinctly either by letting the fracture thickness, in the standard double porosity model, tend to zero, or by homogenizing a model with infinitely thin fractures.     

Mean shift based clustering of neutrosophic domain for unsupervised constructions detection

Automation has been a hot issue in constructions extraction, but there has not yet been a universally accepted algorithm. Commonly, constructions are extracted by user-defined thresholds, and they have to be adjusted with the variation of images and types of constructions. To overcome the shortages, an unsupervised algorithm to extract constructions is proposed in this paper. It adopts mean shift clustering in neutrosophic set domain to segment images, which makes it possible to detect constructions with a stable threshold. The algorithm is compared with three welcomed and recently developed supervised techniques by six study images with two sorts of resolutions. Experiments show that among the four algorithms, the method proposed in this paper performs best in constructions detection. It not only maintains the original shape of buildings, but also generates extracted constructions as a neat whole. Furthermore, the new method has stronger robustness when faced with images with different resolutions and imaging qualities. As tests show that the new algorithm can reach a kappa coefficient of 0.7704 and an accuracy of 89.8054%, which are relatively high in constructions extraction, it can be a robust unsupervised technique to extract constructions.     

一种基于中性集和均值漂移的彩色遥感图像非监督建筑物提取方法

建筑物的纹理和光谱信息的多样性一直是自动化识别的瓶颈。针对此问题,提出了一种彩色遥感图像建筑物提取方法,该算法结合中性集和均值漂移,对转换到中性集空间的影像进行均值漂移分割,生成以影像中主要地物类型为核心的光谱类别图像,提取建筑物。通过中性集空间的增强及分割,克服了传统均值漂移分割稳定性低、光谱不连续及信息混杂的缺陷,避免了地物识别前提取连通区等操作。实验证明,提出的算法可以简捷、完整、准确、稳定地提取建筑物,满足高分辨率遥感影像建筑物的提取要求。     

A sequence approach to linear perfect hash families

A linear (q ^d , q, t)-perfect hash family of size s in a vector space V of order q ^d over a field F of order q consists of a set of linear functionals from V to F with the following property: for all t subsets there exists such that is injective when restricted to F. A linear (q ^d , q, t)-perfect hash family of minimal size d(t − 1) is said to be optimal. In this paper, we extend the theory for linear perfect hash families based on sequences developed by Blackburn and Wild. We develop techniques which we use to construct new optimal linear (q ², q, 5)-perfect hash families and (q ⁴, q, 3)-perfect hash families. The sequence approach also explains a relationship between linear (q ³, q, 3)-perfect hash families and linear (q ², q, 4)-perfect hash families.      

Concepts and Recipes

If concepts are explicated as abstract procedures, then we can easily show that each empirical concept is a not an effective procedure. Some, but not all empirical concepts are shown to be of a special kind: they cannot in principle guarantee that the object they identify satisfies the intended conditions.

A class of optimal constant composition codes from GDRPs

As a common generalization of constant weight binary codes and permutation codes, constant composition codes (CCCs) have attracted recent interest due to their numerous applications. In this paper, a class of new CCCs are constructed using design-theoretic techniques. The obtained codes are optimal in the sense of their sizes. This result is established, for the most part, by means of a result on generalized doubly resolvable packings which is of combinatorial interest in its own right.