Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem

In this article we present a computational study for solving the distance-dependent rearrangement clustering problem using mixed-integer linear programming (MILP). To address sparse data sets, we present an objective function for evaluating the pair-wise interactions between two elements as a function of the distance between them in the final ordering. The physical permutations of the rows and columns of the data matrix can be modeled using mixed-integer linear programming and we present three models based on (1) the relative ordering of elements, (2) the assignment of elements to a final position, and (3) the assignment of a distance between a pair of elements. These models can be augmented with the use of cutting planes and heuristic methods to increase computational efficiency. The performance of the models is compared for three distinct re-ordering problems corresponding to glass transition temperature data for polymers and two drug inhibition data matrices. The results of the comparative study suggest that the assignment model is the most effective for identifying the optimal re-ordering of rows and columns of sparse data matrices.     

集合概念的扩张与完善

从集合概念的内涵出发,剖析了单值集——Cantor集合、Fuzzy集合、Rough集合、可拓集合概念的内涵;剖析了复值集——Grey集合、未确知集合、Vague集合、泛灰(UG)集合和广义泛灰(GUG)集合的内涵;从而得出广义泛灰集合是内涵最深的集合概念;它具有极强的描述能力,可以描述客观存在的一切现象,故又是外延最广的集合概念.     

模糊参数软区间集及其应用

将模糊参数软集与区间集相结合,定义了模糊参数软区间集的概念,研究了模糊参数软区间集的运算及其性质.然后,给出模糊参数软区间集在决策中的应用,说明了方法的可行性.推广了软区间集的相关研究结果.     

An adjustable approach to intuitionistic fuzzy soft sets based decision making

Molodtsov initiated the concept of soft set theory, which can be used as a generic mathematical tool for dealing with uncertainty. There has been some progress concerning practical applications of soft set theory, especially the use of soft sets in decision making. In this paper we generalize the adjustable approach to fuzzy soft sets based decision making. Concretely, we present an adjustable approach to intuitionistic fuzzy soft sets based decision making by using level soft sets of intuitionistic fuzzy soft sets and give some illustrative examples. The properties of level soft sets are presented and discussed. Moreover, we also introduce the weighted intuitionistic fuzzy soft sets and investigate its application to decision making.     

$G$核开集,$G$核邻域与$G$ 核导集

在拓扑空间中, 在$G$方法意义下以$G$壳与$G$核为基础, 引入$G$壳闭集,$G$核开集,$G$核邻域与$G$核导集的概念, 讨论其相应的一些性质. 特别的, 定义了点式$G$方法, 提供了在此方法下$G$闭集与$G$壳闭集, $G$开集与$G$核开集, $G$邻域与$G$核邻域, $G$导集与$G$核导集的一致性, 丰富了拓扑空间中关于$G$闭集, $G$开集, $G$内部, $G$邻域和$G$导集的一些结果. 同时, 提出一些问题以供进一步研究.     

Indivisible plexes in latin squares

In this paper, we present two constructions of divisible difference sets based on skew Hadamard difference sets. A special class of Hadamard difference sets, which can be derived from a skew Hadamard difference set and a Paley type regular partial difference set respectively in two groups of orders v ₁ and v ₂ with |v ₁ − v ₂| = 2, is contained in these constructions. Some result on inequivalence of skew Hadamard difference sets is also given in the paper. As a consequence of Delsarte’s theorem, the dual set of skew Hadamard difference set is also a skew Hadamard difference set in an abelian group. We show that there are seven pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁵ or 3⁷, and also at least four pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁹. Furthermore, the skew Hadamard difference sets deduced by Ree-Tits slice symplectic spreads are the dual sets of each other when q ≤ 3¹¹.      

A family of permitted trigonometric thin sets

We introduce the notion of perfectly measure zero sets and prove that every perfectly measure zero set is permitted for the families of all pseudo-Dirichlet sets, N-sets, A-sets and N-sets. In particular this means that these families of trigonometric thin sets are closed under adding sets of cardinality less than the additivity of Lebesgue measure.

     

Zero sets and uniqueness sets with one cluster point for the Dirichlet space

Zero sets and uniqueness sets of the Dirichlet space are not completely characterized yet. There are sufficient conditions for zero sets and necessary conditions for uniqueness sets and there is a gap in between. Our goal is to take some preliminary steps to fill this gap.     

强拟闭集与强拟连续

利用半闭集引入强拟闭集概念,研究了半开集、强拟开集、强拟闭集概念之间的关系,得到了强拟闭集是连续闭映射下的不变量及其相关性质;最后给出强拟连续概念并得到其等价刻画.     

A novel approach to interval-valued intuitionistic fuzzy soft set based decision making

The soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. The interval-valued intuitionistic fuzzy soft set is a combination of an interval-valued intuitionistic fuzzy set and a soft set. The aim of this paper is to investigate the decision making based on interval-valued intuitionistic fuzzy soft sets. By means of level soft sets, we develop an adjustable approach to interval-valued intuitionistic fuzzy soft sets based decision making and some numerical examples are provided to illustrate the developed approach. Furthermore, we also define the concept of the weighted interval-valued intuitionistic fuzzy soft set and apply it to decision making.     

Exclusive and essential sets of implicates of Boolean functions

In this paper we study relationships between CNF representations of a given Boolean function f and certain sets of implicates of f. We introduce two definitions of sets of implicates which are both based on the properties of resolution. The first type of sets, called exclusive sets of implicates, is shown to have a functional property useful for decompositions. The second type of sets, called essential sets of implicates, is proved to possess an orthogonality property, which implies that every CNF representation and every essential set must intersect. The latter property then leads to an interesting question, to which we give an affirmative answer for some special subclasses of Horn Boolean functions.     

On a Family of Covering Extended Building Sets

Recently Davis and Jedwab introduced the notion of covering extended building sets to construct abelian difference sets. In this paper we consider a family of covering extended building sets similar to the ones corresponding to Hadamard difference sets and Spence difference sets and derive some numerical restrictions on the parameters.     

预不变凸模糊集的一些性质

在下半连续的条件下,给出了一个模糊集是预不变凸模糊集的充分条件,并将模糊凸集上相关性质在模糊不变凸集上作了相应的推广.所给出的条件和证明都是新的.     

Exponential number of inequivalent difference sets in ℤ

Kantor [ 5 ] proved an exponential lower bound on the number of pairwise inequivalent difference sets in the elementary abelian group of order 2^2s+2. Dillon [ 3 ] generalized a technique of McFarland [ 6 ] to provide a framework for determining the number of inequivalent difference sets in 2‐groups with a large elementary abelian direct factor. In this paper, we consider the opposite end of the spectrum, the rank 2 group ? , and compute an exponential lower bound on the number of pairwise inequivalent difference sets in this group. In the process, we demonstrate that Dillon difference sets in groups ? can be constructed via the recursive construction from [ 2 ] and we show that there are exponentially many pairwise inequivalent difference sets that are inequivalent to any Dillon difference set. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 249–259, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10046     

Arithmetic structure in sparse difference sets

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any configuration {v₁,…,v?} of vectors in Zd, we show that if A⊂d[1,N] with |A|/Nd?CN−1/?, then there necessarily exists r≠0 such that {rv₁,…,rv?}⊆A−A.     

Two fuzzier implication operators in the theory of fuzzy power sets

The theory of fuzzy power sets requires the use of an implication operator acting within the set of values taken by the membership functions of the fuzzy sets. Two such operators and resulting relationships between fuzzy sets are studied here, and the results compared with previous ones obtained with other implication operators.     

Simploidals sets: Definitions, operations and comparison with simplicial sets

The combinatorial structure of simploidal sets generalizes both simplicial complexes and cubical complexes. More precisely, cells of simploidal sets are cartesian product of simplices. This structure can be useful for geometric modeling (e.g. for handling hybrid meshes) or image analysis (e.g. for computing topological properties of parts of n-dimensional images). In this paper, definitions and basic constructions are detailed. The homology of simploidal sets is defined and it is shown to be equivalent to the classical homology. It is also shown that products of Bézier simplicial patches are well suited for the embedding of simploidal sets.     

关于粗糙模糊集的相似度量

基于对不确定性信息处理的背景,定义了粗糙模糊值与粗糙模糊集的相似度量,研究了它们的有关性质.     

Codebooks from almost difference sets

In direct spread CDMA systems, codebooks meeting the Welch bounds are used to distinguish among the signals of different users. Recently, constructions of codebooks with difference sets meeting Welch’s bound on the maximum cross-correlation amplitude were developed. In this paper, a generic construction of codebooks using almost difference sets is considered and several classes of codebooks nearly meeting the Welch bound are obtained. The parameters of the codebooks constructed in this paper are new.