Confounds in pictorial sets: The role of complexity and familiarity in basic-level picture processing

Complexity is conventionally defined as the level of detail or intricacy contained within a picture. The study of complexity has received relatively little attention-in part, because of the absence of an acceptable metric. Traditionally, normative ratings of complexity have been based on human judgments. However, this study demonstrates that published norms for visual complexity are biased. Familiarity and learning influence the subjective complexity scores for nonsense shapes, with a significant training x familiarity interaction [F(1,52) = 17.53, p <.05]. Several image-processing techniques were explored as alternative measures of picture and image complexity. A perimeter detection measure correlates strongly with human judgments of the complexity of line drawings of real-world objects and nonsense shapes and captures some of the processes important in judgments of subjective complexity, while removing the bias due to familiarity effects.

Unite and conquer: univariate and multivariate approaches for finding differentially expressed gene sets

Motivation: Recently, many univariate and several multivariate approaches have been suggested for testing differential expression of gene sets between different phenotypes. However, despite a wealth of literature studying their performance on simulated and real biological data, still there is a need to quantify their relative performance when they are testing different null hypotheses.

Results: In this article, we compare the performance of univariate and multivariate tests on both simulated and biological data. In the simulation study we demonstrate that high correlations equally affect the power of both, univariate as well as multivariate tests. In addition, for most of them the power is similarly affected by the dimensionality of the gene set and by the percentage of genes in the set, for which expression is changing between two phenotypes. The application of different test statistics to biological data reveals that three statistics (sum of squared t-tests, Hotelling's T2, N-statistic), testing different null hypotheses, find some common but also some complementing differentially expressed gene sets under specific settings. This demonstrates that due to complementing null hypotheses each test projects on different aspects of the data and for the analysis of biological data it is beneficial to use all three tests simultaneously instead of focusing exclusively on just one.

A general framework for measuring inconsistency through minimal inconsistent sets

Hunter and Konieczny explored the relationships between measures of inconsistency for a belief base and the minimal inconsistent subsets of that belief base in several of their papers. In particular, an inconsistency value termed MIVC, defined from minimal inconsistent subsets, can be considered as a Shapley Inconsistency Value. Moreover, it can be axiomatized completely in terms of five simple axioms. MinInc, one of the five axioms, states that each minimal inconsistent set has the same amount of conflict. However, it conflicts with the intuition illustrated by the lottery paradox, which states that as the size of a minimal inconsistent belief base increases, the degree of inconsistency of that belief base becomes smaller. To address this, we present two kinds of revised inconsistency measures for a belief base from its minimal inconsistent subsets. Each of these measures considers the size of each minimal inconsistent subset as well as the number of minimal inconsistent subsets of a belief base. More specifically, we first present a vectorial measure to capture the inconsistency for a belief base, which is more discriminative than MIVC. Then we present a family of weighted inconsistency measures based on the vectorial inconsistency measure, which allow us to capture the inconsistency for a belief base in terms of a single numerical value as usual. We also show that each of the two kinds of revised inconsistency measures can be considered as a particular Shapley Inconsistency Value, and can be axiomatically characterized by the corresponding revised axioms presented in this paper.

The exponentiated convex variable step-size (ECVSS) algorithm

For some time there is a large interest in variable step-size methods for adaptive filtering. Recently, a few stochastic gradient algorithms have been proposed, which are based on cost functions that have exponential dependence on the chosen error. However, we have experienced that the cost function based on exponential of the squared error does not always satisfactorily converge. In this paper we modify this cost function in order to improve the convergence of exponentiated cost function and the novel ECVSS (exponentiated convex variable step-size) stochastic gradient algorithm is obtained. The proposed technique has attractive properties in both stationary and abrupt-change situations. (C) 2010 Elsevier B.V. All rights reserved.

Quantifying the influence of humic acid adsorption on colloidal microsphere deposition onto iron-oxide-coated sand.

This article describes an approach for quantifying microsphere deposition onto iron-oxide-coated sand under the influence of adsorbed Suwannee River Humic Acid (SRHA). The experimental technique involved a triple pulse injection of model latex microspheres (microspheres) in pulses of (1) microspheres, followed by (2) SRHA, and then (3) microspheres, into a column filled with iron-coated quartz sand as a water-saturated porous medium. A random sequential adsorption model (RSA) simulated the gradual rise in the first (microsphere) breakthrough curve (BTC). Using the same model calibration parameters a dramatic increase in concentration at the start of the second particle BTC, generated after SRHA injection, could be simulated by matching microsphere concentrations to extrapolated RSA output. RSA results and microsphere/SRHA recoveries showed that 1 mg of SRHA could block 5.90 plus or minus 0.14 x 10^9 microsphere deposition sites. This figure was consistent between experiments injecting different SRHA masses, despite contrasting microsphere deposition/release regimes generating the second microsphere BTC.

Kinetic and thermodynamic investigations on arsenic adsorption onto dolomitic sorbents

Arsenic and its compounds are toxic pollutants for the environment and all living organisms. At present, there is considerable interest in studying new sorbent materials for the removal of arsenic from aqueous solutions. This work discusses the feasibility of arsenic uptake onto dolomite which is considered to be a potential inexpensive adsorbent. Thermodynamic and kinetic experiments were undertaken to assess the capacity and rate of As uptake onto dolomite. Experimental data were mathematically described using adsorption kinetic models, namely pseudo-first-order and pseudo-second-order models. The arsenic removal was found to be dependent on the dosage of dolomite, adsorbent particle size and the presence of various anions. Thermodynamic results indicate that the adsorption follows an exothermic chemisorption process. The experimental data indicate successful removal of As(V) ion from aqueous solution indicating that dolomite be used as an inexpensive treatment process. (C) 2010 Elsevier B.V. All rights reserved.

A comparative analysis of multidimensional features of objects resembling sets of graphs

In the present paper, we introduce a notion of a style representing abstract, complex objects having characteristics that can be represented as structured objects. Furthermore, we provide some mathematical properties of such styles. As a main result, we present a novel approach to perform a meaningful comparative analysis of such styles by defining and using graph-theoretic measures. We compare two styles by comparing the underlying feature sets representing sets of graph structurally. To determine the structural similarity between the underlying graphs, we use graph similarity measures that are computationally efficient. More precisely, in order to compare styles, we map each feature set to a so-called median graph and compare the resulting median graphs. As an application, we perform an experimental study to compare special styles representing sets of undirected graphs and present numerical results thereof. (C) 2007 Elsevier Inc. All rights reserved.