Associations between schizotypy and belief in conspiracist ideation

Previous studies have reported associations between conspiracist ideation and domain-level facets of schizotypy, but less is known about associations with lower-order facets. In the present study, 447 adults completed measures of conspiracist ideation and the Schizotypal Personality Questionnaire (SPQ), consisting of nine subscales grouped into four domains. Results of a multiple regression showed that two domains of the SPQ significantly predicted conspiracist ideation, but multicollinearity was a limiting factor. In a second regression, we found that the subscales of Odd Beliefs or Magical Thinking and Ideas of Reference significantly predicted conspiracist ideation, without any multicollinearity constraints. We interpret these results as implicating two specific lower-order facets of schizotypy in belief in conspiracy theories. We further contrast the present results with previous studies indicating associations between conspiracist ideation and paranormal beliefs.

Median Filter Architecture by Accumulative Parallel Counters

The time to process each of the W/B processing blocks of a median calculation method on a set of N W-bit integers is improved here by a factor of three compared with literature. The parallelism uncovered in blocks containing B-bit slices is exploited by independent accumulative parallel counters so that the median is calculated faster than any known previous method for any N, W values. The improvements to the method are discussed in the context of calculating the median for a moving set of N integers, for which a pipelined architecture is developed. An extra benefit of a smaller area for the architecture is also reported.

Bit-index sort: A fast non-comparison integer sorting algorithm for permutations

This paper describes a fast integer sorting algorithm, herein referred to as Bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers, supported by machine hardware, to retrieve the ordered output sequence. Results show that Bit-index sort outperforms quicksort and counting sort algorithms when compared in their execution time. A parallel approach for Bit-index sort using two simultaneous threads is also included, which obtains further speedups of up to 1.6 compared to its sequential case.