A local characterization of the johnson scheme

Within the Johnson schemeI(m, d) we find the graphK(m, d) ofd-subsets of anm-set, two such adjacent when disjoint. Among all connected graphs,K(m, d) is characterized by the isomorphism type of its vertex neighborhoods providedm is sufficiently large compared tod. Partial support provided by NSF (USA), SERC (UK), ZWO (NL).     

Stereochemical aspects of the formation of toxisterols A

Mechanisms for the formation of toxisterol A are suggested. The connection between the conformation of the initial previtamin and the stereochemistry of the reaction products is discussed.Lensoviet Leningrad Technological Institute. Translated from Khimiya Prirodnykh Soedinenii, No. 2, pp. 225–229, March–April, 1989.     

Partially ordered baer involutive algebras

A survey is given of the basic results of the theory of AW^*-algebras, the properties of the rings of measurable and locally measurable operators associated with von Neumann algebras and AW^*-algebras are described, Baer^*-algebras admitting partial orderings compatible with their algebraic structures are investigated.Translated from Itogi Nauki i Tekhniki, Seriya Sovremennye Problemy Matematiki (Noveishie Dostizheniya), Vol. 27, pp. 99–128, 1985.     

Three-dimensional trajectory study of the I + HI → IH + I, H + I2 reactions

The quasiclassical trajectory calculation of the I + HI collision is performed in order to study the exchange and endothermic reaction channels. The rate constant of the exchange reaction I′ + HI → HI′ + I is found to be equal to 7.7 × 10¹¹ cm³/mol s at room temperature of 300 K. The study of the endothermic reaction I + HI → H + I₂ shows that it takes place only in configurations with large bend angles. Due to the non-collinear character of this reaction its threshold (2 eV) exceeds significantly the threshold of the minimal energy (collinear) reaction path (1.55 eV).     

High order linear initial-value problems and Schauder bases

In this paper we approximate the solution of a linear initial-value problem, making use of a Schauder basis for certain Banach space associated with such a differential problem. In addition, we apply that results in order to calculate numerically the response from a structure modelled by a three degree-of-freedom mass–damper–spring system.     

Learning and transfer in dynamic decision environments

An important aspect of learning is the ability to transfer knowledge to new contexts. However, in dynamic decision tasks, such as bargaining, firefighting, and process control, where decision makers must make repeated decisions under time pressure and outcome feedback may relate to any of a number of decisions, such transfer has proven elusive. This paper proposes a two-stage connectionist model which hypothesizes that decision makers learn to identify categories of evidence requiring similar decisions as they perform in dynamic environments. The model suggests conditions under which decision makers will be able to use this ability to help them in novel situations. These predictions are compared against those of a one-stage decision model that does not learn evidence categories, as is common in many current theories of repeated decision making. Both models' predictions are then tested against the performance of decision makers in an Internet bargaining task. Both models correctly predict aspects of decision makers' learning under different interventions. The two-stage model provides closer fits to decision maker performance in a new, related bargaining task and accounts for important features of higher-performing decision makers' learning. Although frequently omitted in recent accounts of repeated decision making, the processes of evidence category formation described by the two-stage model appear critical in understanding the extent to which decision makers learn from feedback in dynamic tasks. Faison (Bud) Gibson is an Assistant Professor at College of Business, Eastern Michigan University. He has extensive experience developing and empirically testing models of decision behavior in dynamic decision environments.     

Necessary conditions and duality for inexact nonlinear semi-infinite programming problems

First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii–Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given.