In this study we examined the construct and external validity of the Disgust Scale Revised (Olatunji, Williams, et al., 2007), in a large heterogeneous sample (N = 1427). In addition, we investigated the role of demographic variables on disgust’s sensitivity. The findings reveal that the DS_R adheres to the three-factor structure (i.e., Core disgust, Animal-Reminder Disgust, and Contamination-B...

This paper introduces the Clifford Support Vector Machines as a generalization of the realand complexvalued Support Vector M* chines. The major advantage of this approach is that one requires only one CSVM which can admit multiple multivector inputs and it can carry multi-class classification. In contrast one would need many real valued SVMs for a multi-class problem which is time consuming.

In this paper, we introduce formalization of well-known number theoretic algorithms on the Mizar proof checking system. We formalized the Euclidean algorithm, the extended Euclidean algorithm and the algorithm computing the solution of the Chinese reminder theorem based on the source code of NZMATH which is a Python based number theory oriented calculation system. We prove the accuracy of our f...

The article analyzes the factors, driving forces, directions and socio-economic consequences of return migration from United States to China. Author consider this process in context global shifts taking place modern world. author formulates theoretical methodological approaches that make it possible analyze through prism geopolitical dynamics This contextual approach allows a deeper understandi...

SIFFEA is an automated system for parallel nite element method PFEM with unstructured meshes on distributed memory ma chines It synthesizes mesh generator mesh partitioner linear system assembler and solver and adaptive mesh re ner SIFFEA is an implicit parallel environment The user need only specify the application model in serial semantics all internal communications are transparent to the us...

Improvement in the performance of reminder systems may be facilitated by the use of new representations. A decision-theoretic representation, for example, may enable a reminder system to represent and reason about the probabilities that a reminder will be a true or a false alarm and the relative utilities of these events. We extended a previously described decision-theoretic model to include su...

This chapter provides an accessible and straightforward tour through some of the most basic notions and remarkable phenomena in machine-independent computational complexity. It includes versions of the recursion, compression, speedup, gap, union, and honesty theorems. Where possible, the results are derived from machine-dependent ones, in the particularly convenient concrete setting of space-bo...