There are currently five transformation matrices being considered for use in the linear chromatic-adaptation transform in a revision of the CIECAM97s color appearance model. Four of the matrices were developed independently for the purpose of transforming tristimulus values to spectrally sharpened RGB responses. The fifth is the HuntPointer-Estevez transform of CIE tristimulus values to normali...

In this paper, we consider how to partition the parity-check matrices (PCMs) reduce hardware complexity and increase decoding throughput for row layered of quasi-cyclic low-density (QC-LDPC) codes. First, formulate PCM partitioning as an optimization problem, which targets minimize maximum column weight each layer while maintaining a block cyclic shift property among different layers. As result...

Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...

In this Workshop article a Paradigm that can contribute with some essential aspects to establish a baseline for the development of Computational Sapience (Wisdom) as a new discipline is presented. It is demonstrated here that, under the proposed Paradigm, Computational Sapience (Wisdom) methodologies can be developed as a natural extension of some non-conventional (Soft Computing and Computatio...

This work proposes innovative permutation-based procedures controlling the Familywise Error rate (FWE). It is proofed that weighted procedures control the FWE if weights are a function of the sufficient statistic. Particularly, we focus on the use of the additional information given by the total variance of each variables. The first proposal considers the use of weights applied to the combining...

Several recent studies have examined the effects of replacing the pair-wise recombination operators often used by genetic algorithms with pool-wise recombination operators. In their simplest form, poolwise operators create probabilistic models that represent each parameter independently. Instead of using traditional crossover operators, these models are sampled to generate a new population. Alt...

The paper discusses the problem of performing the prioritization of decision elements within the multicriteria optimization method, analytic hierarchy process (AHP), with incomplete information. An approach is proposed on how to fill in the gap in the pair-wise comparison matrix generated within an AHP standard procedure; that is, to reproduce one missing judgment of the decision maker while as...

this paper consists of three sections. in the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. in the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

We consider functions f v = min A∈K Av and gv = max A∈K Av, where K is a finite set of nonnegative matrices and by " min " and " max " we mean coordinate-wise minimum and maximum. We transfer known results about properties of g to f. In particular we show existence of nonnegative generalized eigenvectors for f , give necessary and sufficient conditions for existence of strictly positive eigenve...

In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class is matrices which represent cuts of a given graph and in online gambling the comparison class is matrices which represent permutations over n teams. Another important example is online collaborative filtering...