Novel Readout Electronics for Thickness Shear-Mode Liquid Sensors Compensating for Spurious Conductivity and Capacitances

In this paper, a readout circuit for a thickness shear-mode (TSM) resonator is presented which can be used for sensing applications in liquids such as viscosity sensing. The system features compensation of both spurious capacitances and conductances in parallel to the resonator. This allows measurements even in conductive liquids without the need for an elaborate sealing of the sensor. The influence of the spurious elements is determined by means of two orthogonal synchronous detectors and eliminated by active compensation using voltage-controlled amplifiers (VCAs). Furthermore, the circuit is robust against possible phase errors. The basic concept is discussed in detail, and a readout circuit is developed. A prototype is presented, and sample results are given, demonstrating the feasibility of the approach     

Assessing Human Impact of Organizational Crises: Reliability and Validity of the Triage Assessment Scale for Organizations (TAS:O)

The present study evaluated the reliability and validity of the Triage Assessment Survey: Organizations (TAS:O), a 27-item, 5-point, Likert summated rating scale. One hundred and seventeen participants responded to the TAS:O after reading mild, moderate, marked and severe organizational crisis scenarios. The overall Cronbach's alpha and split-half reliability were both .93. Confirmatory factor analysis revealed three factors, supporting the hypothesis that the TAS:O is comprised of three distinct factors (i.e., Affect, Behavior, and Cognition). An analysis of variance provided evidence that the TAS:O has the capacity to distinguish among mild, moderate, marked, and severe crises. Because this research is the first to evaluate the TAS:O, further studies are needed to strengthen confidence in the psychometric properties of this scale.     

The marginal cost of CO2 emissions

Haraden's model for estimating the economic cost of global warming is analysed. We change his method of discounting and some of his input parameters in a manner consistent with physical and economic theory as well as empirical data. We then find much higher costs than Haraden found. These costs are compared to the cost of reducing CO₂ emissions and we find that deep cuts of the emissions of CO₂ are preferable. A check of the sensitivity of our results with respect to some crucial parameter values does not alter that conclusion.     

Demonstrative Suffering: The Gestural (Re)embodiment of Symptoms

Despite the long-standing interest in emotion and bodily conduct, there remains relatively little research concerned with how gestures are used with talk and within interaction to reveal emotional and personal experience. In this article, the author considers the medical consultation and, in particular, the ways in which patients attempt to reveal their experience of illness to the doctor. The paper examines how gesture and other forms of bodily conduct are used to transform symptoms into suffering; to display, enact, and (re)embody medical problems and difficulties. The analysis is based on videorecordings of primary health care consultations and focuses on the social and interactional organization of demonstrative suffering.     

Analysis of a master-slave architecture for distributed evolutionary computations.

This paper introduces a new mathematical model of the master-slave architecture for distributed evolutionary computations (EC). This model is validated using a concrete implementation based on the Distributed BEAGLE C++ framework. Results show that contrary to (current) popular belief, master-slave architectures are able to scale well over local area networks of workstations using off-the-shelf networking equipment. The main properties of the master-slave are also compared with those of the more mainstream island-model.     

The complexity of some reachability problems for a system on a finite group

We consider a system defined as the product of a finite set of periodic systems on cyclic groups. It is of interest to determine if certain subgroups and unions of subgroups of the state set are reachable from a specified initial state, and in particular to determine the computational complexity of verifying such reachability. These questions are motivated by certain problems that arise in the modelling and control of discrete event systems and certain forms of periodic scheduling. Our main result is that deciding whether or not the union of a certain set of subgroups is reachable or not is NP-complete.