Reducing implicit prejudice by blurring intergroup boundaries

In two experiments we examined whether and when blurring intergroup boundaries reduces implicit prejudice. In Experiment 1 we observed that when participants first completed a task in which they generated characteristics that overlapped between an ingroup and an outgroup they showed less implicit bias as measured by an Implicit Association Test. In Experiment 2 we found that the effectiveness of blurring intergroup boundaries for reducing implicit bias was moderated by pretask levels of ingroup identification. We discuss these findings in the context of extending differentiation-based interventions for reducing explicit bias to the domain of implicit attitudes.

Implicit memory and consumer choice: the mediating role of brand familiarity

Two experiments investigated the influence of implicit memory on consumer choice for brands with varying levels of familiarity. Priming was measured using a consideration-choice task, developed by Coates, Butler and Berry (2004). Experiment 1 employed a coupon-rating task at encoding that required participants to meaningfully process individual brand names, to assess whether priming could affect participants' final (preferred) choices for familiar brands. Experiment 2 used this same method to assess the impact of implicit memory on consideration and choice for unknown and leader brands, presented in conjunction with familiar competitors. Significant priming was obtained in both experiments, and was shown to directly influence final choice in the case of familiar and highly familiar leader brands. Moreover, it was shown that a single prior exposure could lead participants to consider buying an unknown, and indeed fictitious, brand. Copyright (c) 2006 John Wiley & Sons, Ltd.

Implicit memory: a prime example for brand consideration and choice

Three experiments investigated the influence of implicit memory for familiar brand names on consumer choice. Priming was measured using modified preference judgment tasks that comprised both brand consideration and choice components. Experiment 1 used a 'complex choice task' where consideration and choice stages were characterized as acting in sequence. Experiment 2 explored a different formulation whereby consideration and choice were assumed to act in parallel, Both experiments demonstrated that priming had an influence on brand consideration but not on final or preferred choice. Finally, Experiment 3 replicated and extended these findings under more realistic conditions where participants actually received some of the products that they selected. Overall, the experiments suggested that for many decisions involving the consideration of familiar brands prior to choice, previous exposure to brand names can increase the likelihood that they will enter the consumers' consideration set. However, the advantage does not appear to extend to choice itself. Copyright (C) 2004 John Wiley Sons, Ltd.

Optimization of apodization functions in terahertz transient spectrometry

A quadratic programming optimization procedure for designing asymmetric apodization windows tailored to the shape of time-domain sample waveforms recorded using a terahertz transient spectrometer is proposed. By artificially degrading the waveforms, the performance of the designed window in both the time and the frequency domains is compared with that of conventional rectangular, triangular (Mertz), and Hamming windows. Examples of window optimization assuming Gaussian functions as the building elements of the apodization window are provided. The formulation is sufficiently general to accommodate other basis functions. (C) 2007 Optical Society of America

MARCKS functions as a novel growth/tumour suppressor in cells of melanocyte origin

Protein kinase C (PKC) plays a pivotal role in modulating the growth of melanocytic cells in culture. We have shown previously that a major physiological substrate of PKC, the 80 kDa myristoylated alanine-rich C-kinase substrate (MARCKS), can be phosphorylated in quiescent, non-tumorigenic melanocytes exposed transiently to a biologically active phorbol ester, but cannot be phosphorylated in phorbol ester-treated, syngeneic malignant melanoma cells. Despite its ubiquitous distribution, the function of MARCKS in cell growth and transformation remains to be demonstrated clearly. We report here that MARCKS mRNA and protein levels are down-regulated significantly in the spontaneously derived murine B16 melanoma cell line compared with syngeneic normal Mel-ab melanocytes. In contrast, the tumourigenic v-Ha-ras-transfonned melan-ocytic line, LTR Ras 2, showed a high basal level of MARCKS phosphorylation which was not enhanced by treatment of cells with phorbol ester. Furthermore, protein levels of MARCKS in LTR Ras 2 cells were similar to those expressed in Mel-ab melanocytes. However, in four out of six murine tumour cell lines investigated, levels of MARCKS protein were barely detectable. Transfection of B16 cells with a plasmid containing the MARCKS cDNA in the sense orientation produced two neomycin-resistant clones displaying reduced proliferative capacity and decreased anchorage-independent growth compared with control cells. In contrast, transfection with the antisense MARCKS construct produced many colonies which displayed enhanced growth and transforming potential compared with control cells. Thus, MARCKS appears to act as a novel growth suppressor in the spontaneous transformation of cells of melanocyte origin and may play a more general role in the tumour progression of other carcinomas.

Efficient on the fly calculation of time correlation functions in computer simulations

Time correlation functions yield profound information about the dynamics of a physical system and hence are frequently calculated in computer simulations. For systems whose dynamics span a wide range of time, currently used methods require significant computer time and memory. In this paper, we discuss the multiple-tau correlator method for the efficient calculation of accurate time correlation functions on the fly during computer simulations. The multiple-tau correlator is efficacious in terms of computational requirements and can be tuned to the desired level of accuracy. Further, we derive estimates for the error arising from the use of the multiple-tau correlator and extend it for use in the calculation of mean-square particle displacements and dynamic structure factors. The method described here, in hardware implementation, is routinely used in light scattering experiments but has not yet found widespread use in computer simulations.

An implicit pole-assignment self-tuning regulator

A new self-tuning implicit pole-assignment algorithm is presented which, through the use of a pole compression factor and different RLS model and control structures, overcomes stability and convergence problems encountered in previously available algorithms. Computational requirements of the technique are much reduced when compared to explicit pole-assignment schemes, whereas the inherent robustness of the strategy is retained.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition

This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bezier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bezier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bezier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bezier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.