Impaired conflict monitoring in Parkinson's disease patients during an oculomotor redirect task

Fallibility is inherent in human cognition and so a system that will monitor performance is indispensable. While behavioral evidence for such a system derives from the finding that subjects slow down after trials that are likely to produce errors, the neural and behavioral characterization that enables such control is incomplete. Here, we report a specific role for dopamine/basal ganglia in response conflict by accessing deficits in performance monitoring in patients with Parkinson's disease. To characterize such a deficit, we used a modification of the oculomotor countermanding task to show that slowing down of responses that generate robust response conflict, and not post-error per se, is deficient in Parkinson's disease patients. Poor performance adjustment could be either due to impaired ability to slow RT subsequent to conflicts or due to impaired response conflict recognition. If the latter hypothesis was true, then PD subjects should show evidence of impaired error detection/correction, which was found to be the case. These results make a strong case for impaired performance monitoring in Parkinson's patients.

Transmembrane domains participate in functions of integral membrane proteins

Integral membrane proteins have one or more transmembrane a-helical domains and carry out a variety of functions such as enzyme catalysis, transport across membranes, transducing signals as receptors of hormones and growth factors, and energy transfer in ATP synthesis. These transmembrane domains are not mere structural units anchoring the protein to the lipid bilayer but seem to-contribute in the overall activity. Recent findings in support of this are described using some typical examples-LDL receptor, growth factor receptor tyrosine kinase, HMG-CoA reductase, F-0-ATPase and adrenergic receptors. The trends in research indicate that these transmembrane domains participate in a variety of ways such as a linker, a transducer or an exchanger in the overall functions of these proteins in transfer of materials, energy and signals.

Synergy between the N-terminal and C-terminal domains of Mycobacterium tuberculosis HupB is essential for high-affinity binding, DNA supercoiling and inhibition of RecA-promoted strand exchange

The occurrence of DNA architectural proteins containing two functional domains derived from two different architectural proteins is an interesting emerging research theme in the field of nucleoid structure and function. Mycobacterium tuberculosis HupB, unlike Escherichia coli HU, is a two-domain protein that, in the N-terminal region, shows broad sequence homology with bacterial HU. The long C-terminal extension, on the other hand, contains seven PAKK/KAAK motifs, which are characteristic of the histone H1/H5 family of proteins. In this article, we describe several aspects of HupB function, in comparison with its truncated derivatives lacking either the C-terminus or N-terminus. We found that HupB binds a variety of DNA repair and replication intermediates with K(d) values in the nanomolar range. By contrast, the N-terminal fragment of M. tuberculosis HupB (HupB(MtbN)) showed diminished DNA-binding activity, with K(d) values in the micromolar range, and the C-terminal domain was completely devoid of DNA-binding activity. Unlike HupB(MtbN), HupB was able to constrain DNA in negative supercoils and introduce negative superhelical turns into relaxed DNA. Similarly, HupB exerted a robust inhibitory effect on DNA strand exchange promoted by cognate and noncognate RecA proteins, whereas HupB(MtbN), even at a 50-fold molar excess, had no inhibitory effect. Considered together, these results suggest that synergy between the N-terminal and C-terminal domains of HupB is essential for its DNA-binding ability, and to modulate the topological features of DNA, which has implications for processes such as DNA compaction, gene regulation, homologous recombination, and DNA repair.

Task Dependent Boundary Mannequins in Statistical DHM

The primary objective of the paper is to make use of statistical digital human model to better understand the nature of reach probability of points in the taskspace. The concept of task-dependent boundary manikin is introduced to geometrically characterize the extreme individuals in the given population who would accomplish the task. For a given point of interest and task, the map of the acceptable variation in anthropometric parameters is superimposed with the distribution of the same parameters in the given population to identify the extreme individuals. To illustrate the concept, the task space mapping is done for the reach probability of human arms. Unlike the boundary manikins, who are completely defined by the population, the dimensions of these manikins will vary with task, say, a point to be reached, as in the present case. Hence they are referred to here as the task-dependent boundary manikins. Simulations with these manikins would help designers to visualize how differently the extreme individuals would perform the task. Reach probability at the points in a 3D grid in the operational space is computed; for objects overlaid in this grid, approximate probabilities are derived from the grid for rendering them with colors indicating the reach probability. The method may also help in providing a rational basis for selection of personnel for a given task.

Docking and free energy simulations to predict conformational domains involved in hCG-LH receptor interactions using recombinant antibodies

Single chain fragment variables (ScFvs) have been extensively employed in studying the protein-protein interactions. ScFvs derived from phage display libraries have an additional advantage of being generated against a native antigen, circumventing loss of information on conformational epitopes. In the present study, an attempt has been made to elucidate human chorionic gonadotropin (hCG)-luteinizing hormone (LH) receptor interactions by using a neutral and two inhibitory ScFvs against hCG. The objective was to dock a computationally derived model of these ScFvs onto the crystal structure of hCG and understand the differential roles of the mapped epitopes in hCG-LH receptor interactions. An anti-hCG ScFv, whose epitope was mapped previously using biochemical tools, served as the positive control for assessing the quality of docking analysis. To evaluate the role of specific side chains at the hCG-ScFv interface, binding free energy as well as residue interaction energies of complexes in solution were calculated using molecular mechanics Poisson-Boltzmann/surface area method after performing the molecular dynamic simulations on the selected hCG-ScFv models and validated using biochemical and SPR analysis. The robustness of these calculations was demonstrated by comparing the theoretically determined binding energies with the experimentally obtained kinetic parameters for hCG-ScFv complexes. Superimposition of hCG-ScFv model onto a model of hCG complexed with the 51-266 residues of LH receptor revealed importance of the residues previously thought to be unimportant for hormone binding and response. This analysis provides an alternate tool for understanding the structure-function analysis of ligand-receptor interactions. Proteins 2011;79:3108-3122. (C) 2011 Wiley-Liss, Inc.

Multi-UAV Task Allocation using Team Theory

A multiple UAV search and attack mission in a battlefield involves allocating UAVs to different target tasks efficiently. This task allocation becomes difficult when there is no communication among the UAVs and the UAVs sensors have limited range to detect the targets and neighbouring UAVs, and assess target status. In this paper, we propose a team theoretic approach to efficiently allocate UAVs to the targets with the constraint that UAVs do not communicate among themselves and have limited sensor range. We study the performance of team theoretic approach for task allocation on a battle field scenario. The performance obtained through team theory is compared with two other methods, namely, limited sensor range but with communication among all the UAVs, and greedy strategy with limited sensor range and no communication. It is found that the team theoretic strategy performs the best even though it assumes limited sensor range and no communication.

Homogenization of eigenvalue problems in perforated domains

In this paper, we treat some eigenvalue problems in periodically perforated domains and study the asymptotic behaviour of the eigenvalues and the eigenvectors when the number of holes in the domain increases to infinity Using the method of asymptotic expansion, we give explicit formula for the homogenized coefficients and expansion for eigenvalues and eigenvectors. If we denote by ε the size of each hole in the domain, then we obtain the following aysmptotic expansion for the eigenvalues: Dirichlet: λε = ε−2 λ + λ0 +O (ε), Stekloff: λε = ελ1 +O (ε2), Neumann: λε = λ0 + ελ1 +O (ε2).Using the method of energy, we prove a theorem of convergence in each case considered here. We briefly study correctors in the case of Neumann eigenvalue problem.

Some Aspects of the Kobayashi and Carath,odory Metrics on Pseudoconvex Domains

The purpose of this article is to consider two themes, both of which emanate from and involve the Kobayashi and the Carath,odory metric. First, we study the biholomorphic invariant introduced by B. Fridman on strongly pseudoconvex domains, on weakly pseudoconvex domains of finite type in C (2), and on convex finite type domains in C (n) using the scaling method. Applications include an alternate proof of the Wong-Rosay theorem, a characterization of analytic polyhedra with noncompact automorphism group when the orbit accumulates at a singular boundary point, and a description of the Kobayashi balls on weakly pseudoconvex domains of finite type in C (2) and convex finite type domains in C (n) in terms of Euclidean parameters. Second, a version of Vitushkin's theorem about the uniform extendability of a compact subgroup of automorphisms of a real analytic strongly pseudoconvex domain is proved for C (1)-isometries of the Kobayashi and Carath,odory metrics on a smoothly bounded strongly pseudoconvex domain.

Holomorphic Mappings between Domains in C-2

An extension theorem for holomorphic mappings between two domains in C-2 is proved under purely local hypotheses.

Cross-Guided Clustering: Transfer of Relevant Supervision across Tasks

Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically transferred for clustering a target task, by providing a relevant supervised partitioning of a dataset from a different source task. The target clustering is made more meaningful for the human user by trading-off intrinsic clustering goodness on the target task for alignment with relevant supervised partitions in the source task, wherever possible. We propose a cross-guided clustering algorithm that builds on traditional k-means by aligning the target clusters with source partitions. The alignment process makes use of a cross-task similarity measure that discovers hidden relationships across tasks. When the source and target tasks correspond to different domains with potentially different vocabularies, we propose a projection approach using pivot vocabularies for the cross-domain similarity measure. Using multiple real-world and synthetic datasets, we show that our approach improves clustering accuracy significantly over traditional k-means and state-of-the-art semi-supervised clustering baselines, over a wide range of data characteristics and parameter settings.

How Do Glassy Domains Grow?

We construct equations for the growth kinetics of structural glass within mode-coupling theory, through a nonstationary variant of the three-density correlator defined by G. Biroli et al. Phys. Rev. Lett. 97, 195701 (2006)]. We solve a schematic form of the resulting equations to obtain the coarsening of the three-point correlator chi(3)(t, t(w)) as a function of waiting time tw. For a quench into the glass, we find that chi(3) attains a peak value similar to t(w)(0.5) at t - t(w) similar to t(w)(0.8), providing a theoretical basis for the numerical observations of Parisi J. Phys. Chem. B 103, 4128 (1999)] and Kob and Barrat Phys. Rev. Lett. 78, 4581 (1997)]. The aging is not ``simple'': the t(w) dependence cannot be attributed to an evolving effective temperature.

Model Pseudoconvex Domains and Bumping

The Levi geometry at weakly pseudoconvex boundary points of domains in C-n, n >= 3, is sufficiently complicated that there are no universal model domains with which to compare a general domain. Good models may be constructed by bumping outward a pseudoconvex, finite- type Omega subset of C-3 in such a way that: (i) pseudoconvexity is preserved, (ii) the (locally) larger domain has a simpler defining function, and (iii) the lowest possible orders of contact of the bumped domain with partial derivative Omega, at the site of the bumping, are realized. When Omega subset of C-n, n >= 3, it is, in general, hard to meet the last two requirements. Such well-controlled bumping is possible when Omega is h-extendible/semiregular. We examine a family of domains in C-3 that is strictly larger than the family of h-extendible/semiregular domains and construct explicit models for these domains by bumping.

Analysis of an Interior Penalty Method for Fourth Order Problems on Polygonal Domains

Error analysis for a stable C (0) interior penalty method is derived for general fourth order problems on polygonal domains under minimal regularity assumptions on the exact solution. We prove that this method exhibits quasi-optimal order of convergence in the discrete H (2), H (1) and L (2) norms. L (a) norm error estimates are also discussed. Theoretical results are demonstrated by numerical experiments.

Totally geodesic discs in strongly convex domains

We prove that every isometry from the unit disk Delta in , endowed with the Poincar, distance, to a strongly convex bounded domain Omega of class in , endowed with the Kobayashi distance, is the composition of a complex geodesic of Omega with either a conformal or an anti-conformal automorphism of Delta. As a corollary we obtain that every isometry for the Kobayashi distance, from a strongly convex bounded domain of class in to a strongly convex bounded domain of class in , is either holomorphic or anti-holomorphic.