Conscious and unconscious sensory inflows allow effective control of the functions of the human brain and heart at the initial ageing stage

The authors of the present article based their assumption on the concept that the sensory systems are the "windows to the brain" through which various functions of the human organism can be controlled. Comprehension of the fundamental mechanisms of the optimization of the sensory systems, brain, and cardiac functions has increased based on the prolonged sensory flows using conscious and unconscious aromatherapy and multimodal sensory activation. Sensory flow evoked stable systemic responses, including adaptive alteration of psycho-emotional state, attention, memory, sensorimotor reactions, intersensory interaction, visual information processing, statokinetic stability, and autonomic heart rhythm control. The efficacy and expediency of the use of sensory flow for non-medicinal correction of vital functions of the human organism at the initial stages of ageing was revealed.     

Nine, seven, five, or three: how many figures do we need for assessing body image?

320 Croatian female students (M=20.4 yr.) were recruited to examine the validity and reliability of figural scales using different numbers of stimuli (3, 5, 7, and 9) and different serial presentation (serial and nonserial order). A two-way analysis of variance (4 numbers x 2 orders of stimuli) was performed on ratings of current self-size and ideal size as dependent variables. Analysis indicated a significant main effect of number of stimuli. This, together with post hoc tests indicated that ratings were significantly different for a scale of three figures from scales of more figures, which in turn did not differ among themselves. Main effects of order of stimuli, as well as the interaction, were not significant. The results support the hypothesis that the optimal number of figures on a scale is seven plus (or minus) two.     

A Critique of Langsam's “The Theory of Appearing Defended”

In this paper we consider, and reject, Harold Langsams defenceof the Theory of Appearing, in this journal (1997), in the faceof three standard arguments against it. These arguments are:the argument from hallucination; the argument from the samecause-same effect principle; and the argument from perceptualtime-gap.     

Criticisms of the criminal justice system: A decision making analysis

When a decision making analysis is applied to key decisions within the criminal justice system, e.g., bail, sentencing, and plea bargaining, a wide range of evidence suggests that the decision makers believe they follow policies other than those that actually guide their decisions; that the policies that are followed are often simple ones, involving only a few decision factors; and that the decision outcomes are often assigned to defendants in a reasonable manner but that, even so, the outcomes are often ineffective. Because many proposals for the reform of the criminal justice system are based on the testimony of decision makers and “experts” whose knowledge of the system is often flawed, it is unlikely that reforms will have a beneficial impact on criminal behavior until much more is known about the day-to-day decisions of judges, prosecutors, and probation officers.     

The completeness of the factor semantics for Łukasiewicz's infinite-valued logics

In [12] it was shown that the factor semantics based on the notion ofT-F-sequences is a correct model of the ukasiewicz's infinite-valued logics. But we could not consider some important aspects of the structure of this model because of the short size of paper. In this paper we give a more complete study of this problem: A new proof of the completeness of the factor semantic for ukasiewicz's logic using Wajsberg algebras [3] (and not MV-algebras in [1]) and Symmetrical Heyting monoids [7] is proposed. Some consequences of such an approach are investigated.     

A mathematical analysis of a natural class of partitions of a graph

Any finite graph (nondirected, no loops) can be coupled with its complementary graph producing what we term a completed graph. This paper studies completed graphs in the context of a structural concept called stratification that is motivated by theoretical work in social psychology and sociology. A completed graph is stratified in case its node (vertex) set can be divided into two nonempty subsets with exactly one of the two types of ties holding between every pair of nodes from distinct sets. A completed graph is totally stratified in case every one of its nontrivial completed subgraphs is stratified. The first part of the paper relates the concept of stratification to the familiar graph property of connectedness. In particular, a completed graph is totally stratified if and only if it does not have a four point completed subgraph that is connected in both the original graph relation and its complementary relation. Using the concept of stratification, completed graphs can be decomposed uniquely into taxonomic structures, that is, nested sets of partitions. An algorithm for the decomposition based on the work with the concept of stratification is developed. The relationship between the notion of stratification and the ideas in balance theory is examined, and stratification is viewed as a generalization of Davis' notion of clustering. It turns out that the concepts of clique, status, and structural equivalence used throughout the social networks literature can be defined in an interesting way for completed graphs. Cliques are sets of nodes with similar internal links and statuses are sets of nodes with similar external links. Structurally equivalent sets are both cliques and statuses. The concepts of status and structural equivalence are closely related to the decomposition algorithm. In particular, for any totally stratified completed graph, the set of all statuses and the set of all maximal structurally equivalent sets can be generated by mathematical operations performed on the taxonomic decomposition of the completed graph. Finally some of our resuls are informally related to the blockmodeling approach to analyzing social network data discussed in several previous Journal of Mathematical Psychology articles.