Syntaxin 1A inhibits CFTR chloride channels by means of domain-specific protein–protein interactions

Previously we showed that the functional activity of the epithelial chloride channel that is encoded by the cystic fibrosis gene (CFTR) is reciprocally modulated by two components of the vesicle fusion machinery, syntaxin 1A and Munc-18. Here we report that syntaxin 1A inhibits CFTR chloride channels by means of direct and domain-specific protein–protein interactions. Syntaxin 1A stoichiometrically binds to the N-terminal cytoplasmic tail of CFTR, and this binding is blocked by Munc-18. The modulation of CFTR currents by syntaxin 1A is eliminated either by deletion of this tail or by injecting this tail as a blocking peptide into coexpressing Xenopus oocytes. The CFTR binding site on syntaxin 1A maps to the third predicted helical domain (H3) of this membrane protein. Moreover, CFTR Cl− currents are effectively inhibited by a minimal syntaxin 1A construct (i.e., the membrane-anchored H3 domain) that cannot fully substitute for wild-type syntaxin 1A in membrane fusion reactions. We also show that syntaxin 1A binds to and inhibits the activities of disease-associated mutants of CFTR, and that the chloride current activity of recombinant ΔF508 CFTR (i.e., the most common cystic fibrosis mutant) can be potentiated by disrupting its interaction with syntaxin 1A in cultured epithelial cells. Our results provide evidence for a direct physical interaction between CFTR and syntaxin 1A that limits the functional activities of normal and disease-associated forms of this chloride channel.

The concept of time in programming languages.

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

What do we need in programming languages for mathematical software? /

"UIUCDCS-R-74-652"

A formal definition of the SIBYL programming languages /

"UILU-ENG 77 1710."

A generator/grader of problems about syntax of programming languages to be used in an automated exam system /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

An implementation of a system for the formal definition of programming languages /

Originally presented as the author's thesis, University of Illinois at Urbana-Champaign.

Degrees of unsolvability in the theory of programming languages,

Bibliography: p. 120-123.

The effects of domain-specific avoid and prove goal orientations on performance: A multilevel analysis

Recently, goal orientation, a mental framework for understanding how individuals approach learning and achievement situadons, has emerged as an important predictor of performance. This study addressed the effects of domain-specific avoid and prove orientations on performance from the betweenand within-person levels of analysis. One hundred and three participants performed thirty trials of an airtraffic control task. Domain-specific avoid and prove orientations were measured before each trial to assess the effects of changes in goal orientadon on changes in performance (i.e. within-person relationships). Average levels of avoid and prove orientations were calculated to assess the effect of goal orientation on overall performance (i.e. between-person relationships). Findings from the between-person level of analysis revealed that high prove-orientated individuals performed better than low proveorientated individuals. Results also revealed that average goal orientation levels moderated the withinperson relationships. The effect of changes in avoid orientation on changes in performance was stronger for low versus high avoid-oriented individuals while the effect of changes in prove orientadon on changes in performances was stronger for low versus highprove oriented individuals. Implications of these findings are considered.

Concept-based document readability in domain specific information retrieval

Domain specific information retrieval has become in demand. Not only domain experts, but also average non-expert users are interested in searching domain specific (e.g., medical and health) information from online resources. However, a typical problem to average users is that the search results are always a mixture of documents with different levels of readability. Non-expert users may want to see documents with higher readability on the top of the list. Consequently the search results need to be re-ranked in a descending order of readability. It is often not practical for domain experts to manually label the readability of documents for large databases. Computational models of readability needs to be investigated. However, traditional readability formulas are designed for general purpose text and insufficient to deal with technical materials for domain specific information retrieval. More advanced algorithms such as textual coherence model are computationally expensive for re-ranking a large number of retrieved documents. In this paper, we propose an effective and computationally tractable concept-based model of text readability. In addition to textual genres of a document, our model also takes into account domain specific knowledge, i.e., how the domain-specific concepts contained in the document affect the document’s readability. Three major readability formulas are proposed and applied to health and medical information retrieval. Experimental results show that our proposed readability formulas lead to remarkable improvements in terms of correlation with users’ readability ratings over four traditional readability measures.

Educational Games for Learning Programming Languages

A concept of educational game for learning programming languages is presented. The idea of learning programming languages and improving programming skills through programming game characters’ behavior is described. The learning course description rules for using in games are suggested. The concept is implemented in a game for learning C# programming language. A common game architecture is modified for using in the educational game. The game engine is built on the base of the graphical engine Ogre3D and extended with game logic. The game has been developed as an industry level commercial product and is planned for sale to educational institutions.

Where do bright ideas occur in our brain? Meta-analytic evidence from neuroimaging studies of domain-specific creativity

Many studies have assessed the neural underpinnings of creativity, failing to find a clear anatomical localization. We aimed to provide evidence for a multi-componential neural system for creativity. We applied a general activation likelihood estimation (ALE) meta-analysis to 45 fMRI studies. Three individual ALE analyses were performed to assess creativity in different cognitive domains (Musical, Verbal, and Visuo-spatial). The general ALE revealed that creativity relies on clusters of activations in the bilateral occipital, parietal, frontal, and temporal lobes. The individual ALE revealed different maximal activation in different domains. Musical creativity yields activations in the bilateral medial frontal gyrus, in the left cingulate gyrus, middle frontal gyrus, and inferior parietal lobule and in the right postcentral and fusiform gyri. Verbal creativity yields activations mainly located in the left hemisphere, in the prefrontal cortex, middle and superior temporal gyri, inferior parietal lobule, postcentral and supramarginal gyri, middle occipital gyrus, and insula. The right inferior frontal gyrus and the lingual gyrus were also activated. Visuo-spatial creativity activates the right middle and inferior frontal gyri, the bilateral thalamus and the left precentral gyrus. This evidence suggests that creativity relies on multi-componential neural networks and that different creativity domains depend on different brain regions.

CloudMPL:a domain specific language for describing management policies for an autonomic cloud infrastructure

To benefit from the advantages that Cloud Computing brings to the IT industry, management policies must be implemented as a part of the operation of the Cloud. Among others, for example, the specification of policies can be used for the management of energy to reduce the cost of running the IT system or also for security policies while handling privacy issues of users. As cloud platforms are large, manual enforcement of policies is not scalable. Hence, autonomic approaches for management policies have recently received a considerable attention. These approaches allow specification of rules that are executed via rule-engines. The process of rules creation starts by the interpretation of the policies drafted by high-rank managers. Then, technical IT staff translate such policies to operational activities to implement them. Such process can start from a textual declarative description and after numerous steps terminates in a set of rules to be executed on a rule engine. To simplify the steps and to bridge the considerable gap between the declarative policies and executable rules, we propose a domain-specific language called CloudMPL. We also design a method of automated transformation of the rules captured in CloudMPL to the popular rule-engine Drools. As the policies are changed over time, code generation will reduce the time required for the implementation of the policies. In addition, using a declarative language for writing the specifications is expected to make the authoring of rules easier. We demonstrate the use of the CloudMPL language into a running example extracted from a management energy consumption case study.