In many group-living animals dominant individuals occupy the center of a group. This is generally thought to reflect a preference for locations, that provide optimal protection against predators. However, in this paper I will show that such spatial-structure also emerges among artificial entities that lack preference for any spatial location. The artificial entities dwell in a homogeneous world...

We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes interleave geometry and connectivity coding, and are thus typically unable to utilise information from vertices (mesh regions) they have not yet processed. With the advent of competitive point cloud compression scheme...

BACKGROUND Constructing coexpression networks and performing network analysis using large-scale gene expression data sets is an effective way to uncover new biological knowledge; however, the methods used for gene association in constructing these coexpression networks have not been thoroughly evaluated. Since different methods lead to structurally different coexpression networks and provide di...

the data of this study was collected from 252 teachers, principals and vice-principals offemales’ high schools in district one through one researcher-administered questionnaire, and was then analyzed. the validity of the questionnaire was approved by seven university professors. cronbach’s alpha was used in order to measure the reliability of the questionnaire. the total calculated alpha was 0....

ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. in spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (cv index), distance between fuzzy set...

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time group algebra setting rank-metric codes and in Hamming metric. allows to construct twisted linearized Reed-Solomon new family maximum distance extending Sheekey's Gabidulin rank Furthermore, we analogue Trombetti-Zhou construction, which also pro...

Although there are hundreds of search engines no single search engine can satisfy all web users and can be considered broadly acceptable that Sufficiently comprehensive in its coverage of the web moreover they consist the “spam pages” when a web page gets an undeservedly high rank. Therefore, a robust technique for Meta Search Engine is required that can effectively combat “spam pages”, a serio...

Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2  , where the cod...

Various bounds on minimum rank distances of linear block codes have been proposed. In this paper, we derive a Singleton bound on minimum rank distances of m-by-n array codes. Our Singleton bound not only applies to nonlinear codes, but also implies several previously proposed bounds as special cases. In addition, we derive one upper bound and one lower bound on the size of array codes which par...