Alcoholism and family interaction

In i6 families, half of which had an alcoholic parent, both parents and an adolescent were videotaped interacting with each other. Mothers, fathers and the adolescent in each family viewed the videotaped interaction and completed ratings of themselves and the other two family members on levels of anxiety, involvement, dominance and friendliness. In families with an alcoholic parent, adolescents and their mothers rated family members as less anxious than did adolescents and mothers in families without a drinking problem. Also mothers in the alcoholic families rated family members as being more involved, and their ratings were higher than mothers in other families. Alcoholic families rated parent-adolescent interactions as more dominant and friendlier. At least in these videotaped interactions where alcohol was not being consumed, mothers in alcoholic families adopted a more positive view of family members than mothers in other families. In addition, possibly due to the efforts of fathers not to drink and memories of interactions when he was drunk, alcoholic families perceived their family interactions as more dominant and friendlier than families without an alcohol-related problem. [Schweitzer R, Wilks j, Callan vJ. Alcoholism and family interaction.

Visual front-end wars : Viola-Jones face detector vs Fourier Lucas-Kanade

The performance of visual speech recognition (VSR) systems are significantly influenced by the accuracy of the visual front-end. The current state-of-the-art VSR systems use off-the-shelf face detectors such as Viola- Jones (VJ) which has limited reliability for changes in illumination and head poses. For a VSR system to perform well under these conditions, an accurate visual front end is required. This is an important problem to be solved in many practical implementations of audio visual speech recognition systems, for example in automotive environments for an efficient human-vehicle computer interface. In this paper, we re-examine the current state-of-the-art VSR by comparing off-the-shelf face detectors with the recently developed Fourier Lucas-Kanade (FLK) image alignment technique. A variety of image alignment and visual speech recognition experiments are performed on a clean dataset as well as with a challenging automotive audio-visual speech dataset. Our results indicate that the FLK image alignment technique can significantly outperform off-the shelf face detectors, but requires frequent fine-tuning.

Enhancement of nonvolatile polarization and pyroelectric sensitivity in lithium tantalate (LT)/poly(vinylidene fluoride) (PVDF) nanocomposite

We report the ferroelectric and pyroelectric properties of the composite films of lithium tantalate (LT) nanoparticle in poly(vinylidene fluoride) PVDF matrix at different volume fractions of LT (f(LT) = 0.047, 0.09 and 0.17). For an applied electric field of 150 kV cm(-1) the nonvolatile polarization of the composite was observed to increase from 0.014 mu C cm(-2) at f(LT) = 0 to 2.06 mu C cm(-2) at f(LT) = 0.17. For f(LT) = 0.17, the composite films exhibit a saturated ferroelectric hysteresis loop with a remanent polarization (2P(r) = 4.13 mu C cm(-2)). Compared with pure poled PVDF the composite films also showed a factor of about five enhancement in the pyroelectric coefficient at f(LT) = 0.17. When used in energy detection mode the pyroelectric voltage sensitivity of the composite films was found to increase from 3.93 to 18.5 VJ(-1) with an increase in f(LT) from 0.0 to 0.17.

Oxidation of Thioketens by Singlet Oxygen and Ozone

Di-t-butylthioketen (1) readily reacts with SINGLET-OXYGaEdNdi tion to heterocumulenes is of current singlet oxygen to yield unexpected products (based on interest1 and products derived from the interaction of the behaviour of other heterocumulenes) and reacts with singlet oxygen with the carbon-carbon double bond have ozone to give, quantitatively, the corresponding sul- been characterised. Investigations of the oxidation of phoxide (2). thioketens using di-t-butylthioketen (1) as a model have

Developmental regulation of cytochrome P-450 (b+e) and glutathione transferase (Ya+Yc) gene expression in rat liver

The expression of cytochrome P-450 (b+e) and glutathione transferase (Ya+Yc) genes has been studied as a function of development in rat liver. The levels of cytochrome P-450 (b+e) mRNAs and their transcription rates are too low for detection in the 19-day old fetal liver before or after phenobarbitone treatment. However, glutathione transferase (Ya+Yc) mRNAs can be detected in the fetal liver as well as their induction after phenobarbitone treatment can be demonstrated. These mRNAs contents as well as their inducibility with phenobarbitone are lower in maternal liver than that of adult nonpregnant female rat liver. Steroid hormone administration to immature rats blocks substantially the phenobarbitone mediated induction of the two mRNA families as well as their transcription. It is suggested that steroid hormones constitute one of the factors responsible for the repression of the cytochrome P-450 (b+e) and glutathione transferase (Ya+Yc) genes in fetal liver.

Relationship between the controllability grammian and closed-loop eigenvalues: the single input case

The controllability grammian is important in many control applications. Given a set of closed-loop eigenvalues the corresponding controllability grammian can be obtained by computing the controller which assigns the eigenvalues and then by solving the Lyapunov equation that defines the grammian. The relationship between the controllability grammian, resulting from state feedback, and the closed-loop eigenvalues of a single input linear time invariant (LTI) system is obtained. The proposed methodology does not require the computation of the controller that assigns the specified eigenvalues. The closed-loop system matrix is obtained from the knowledge of the open-loop system matrix, control influence matrix and the specified closed-loop eigenvalues. Knowing the closed-loop system matrix, the grammian is then obtained from the solution of the Lyapunov equation that defines it. Finally the proposed idea is extended to find the state covariance matrix for a specified set of closed-loop eigenvalues (without computing the controller), due to impulsive input in the disturbance channel and to solve the eigenvalue assignment problem for the single input case.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. Solution of the matrix equation, involving unknown controller gams, open-loop system matrices, and desired eigenvalues and eigenvectors, results hi the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether.

Matrix method for eigenvalue assignment: The single input case

The eigenvalue assignment/pole placement procedure has found application in a wide variety of control problems. The associated literature is rather extensive with a number of techniques discussed to that end. In this paper a method for assigning eigenvalues to a Linear Time Invariant (LTI) single input system is proposed. The algorithm determines a matrix, which has eigenvalues at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenvalues. Solution of the matrix equation, involving unknown controller gains, open-loop system matrices and desired eigenvalues, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint is easily overcome by a negligible shift in the values. Two examples are considered to verify the proposed algorithm. The first one pertains to the in-plane libration of a Tethered Satellite System (TSS) while the second is concerned with control of the short period dynamics of a flexible airplane. Finally, the method is extended to determine the Controllability Grammian, corresponding to the specified closed-loop eigenvalues, without computing the controller gains.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a Linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. solution of the matrix equation, involving unknown controller gains, open-loop system matrices, and desired eigenvalues and eigenvectors, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether,

Matrix method for eigenvalue assignment: The single input case

The eigenvalue assignment/pole placement procedure has found application in a wide variety of control problems. The associated literature is rather extensive with a number of techniques discussed to that end. In this paper a method for assigning eigenvalues to a Linear Time Invariant (LTI) single input system is proposed. The algorithm determines a matrix, which has eigenvalues at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenvalues. Solution of the matrix equation, involving unknown controller gains, open-loop system matrices and desired eigenvalues, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint is easily overcome by a negligible shift in the values. Two examples are considered to verify the proposed algorithm. The first one pertains to the in-plane libration of a Tethered Satellite System (TSS) while the second is concerned with control of the short period dynamics of a flexible airplane. Finally, the method is extended to determine the Controllability Grammian, corresponding to the specified closed-loop eigenvalues, without computing the controller gains.

Experimental investigation of link between growth and decay of fiber Bragg gratings

We report here an experimental investigation for establishing and quantifying a link between the growth and decay characteristics of fiber Bragg gratings. One of the key aspects of our work is the determination of the defect energy distribution from the grating characteristics measured during their fabrication. We observe a strong correlation between the growth-based defect energy distribution and that obtained through accelerated aging experiments, paving the way for predicting the decay characteristics of fiber Bragg gratings from their growth data. Such a prediction is significant in simplifying the postfabrication steps required to enhance the thermal stability of fiber Bragg gratings. (c) 2011 Optical Society of America

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.