A Component of the Xanthomonadaceae Type IV Secretion System Combines a VirB7 Motif with a N0 Domain Found in Outer Membrane Transport Proteins

Type IV secretion systems (T4SS) are used by Gram-negative bacteria to translocate protein and DNA substrates across the cell envelope and into target cells. Translocation across the outer membrane is achieved via a ringed tetradecameric outer membrane complex made up of a small VirB7 lipoprotein (normally 30 to 45 residues in the mature form) and the C-terminal domains of the VirB9 and VirB10 subunits. Several species from the genera of Xanthomonas phytopathogens possess an uncharacterized type IV secretion system with some distinguishing features, one of which is an unusually large VirB7 subunit (118 residues in the mature form). Here, we report the NMR and 1.0 angstrom X-ray structures of the VirB7 subunit from Xanthomonas citri subsp. citri (VirB7(XAC2622)) and its interaction with VirB9. NMR solution studies show that residues 27-41 of the disordered flexible N-terminal region of VirB7(XAC2622) interact specifically with the VirB9 C-terminal domain, resulting in a significant reduction in the conformational freedom of both regions. VirB7(XAC2622) has a unique C-terminal domain whose topology is strikingly similar to that of N0 domains found in proteins from different systems involved in transport across the bacterial outer membrane. We show that VirB7(XAC2622) oligomerizes through interactions involving conserved residues in the N0 domain and residues 42-49 within the flexible N-terminal region and that these homotropic interactions can persist in the presence of heterotropic interactions with VirB9. Finally, we propose that VirB(7XAC2622) oligomerization is compatible with the core complex structure in a manner such that the N0 domains form an extra layer on the perimeter of the tetradecameric ring.

The cultural adaptation and validation of the ""Burn Specific Health Scale-Revised"" (BSHS-R): Version for Brazilian burn victims

Background: The Burns Specific Health Scale-Revised (BSHS-R) is of easy application, can be self-administered, and it is considered a good scale to evaluate various important life aspects of burn victims. Objectives: To translate and culturally adapt the BSHS-R into the Brazilian-Portuguese language and to evaluate the internal consistency and convergent validity of the translated BSHS-R. Methods: The cultural adaptation of the BSHS-R included translation and back-translation, discussions with professionals and patients to ensure conceptual equivalence, semantic evaluation, and pre-test of the instrument. The Final Brazilian-Portuguese Version (FBPV) of the BSHS-R was tested on a group of 115 burn patients for internal consistency and validity of construct (using the Rosenberg Self-Esteem Scale (RSES) and the Beck Depression Inventory (BDI)). Results: All values of Cronbach`s alpha were greater than. 8, demonstrating that the internal consistency of the FBPV was very high. Self-esteem was highly correlated with affect and body image (r = .59, p < .001), and with interpersonal relationships (T = .51, p < .001). Correlations between the domains of the FBPV and the BDI were all negative but larger in magnitude than the correlations with RSES. Depression was highly correlated with affect and body image (r = -77, p < .001), and with interpersonal relationships (r = -67, p < .001). Conclusions: The results showed that the adapted version of the BSHS-R into Brazilian-Portuguese fulfills the validity and reliability criteria required from an instrument of health status assessment for burn patients. (C) 2008 Elsevier Ltd and ISBI. All rights reserved.

Embedded DSP-Based Compact Fuzzy System and Its Application for Induction-Motor V/f Speed Control

This paper presents a compact embedded fuzzy system for three-phase induction-motor scalar speed control. The control strategy consists in keeping constant the voltage-frequency ratio of the induction-motor supply source. A fuzzy-control system is built on a digital signal processor, which uses speed error and speed-error variation to change both the fundamental voltage amplitude and frequency of a sinusoidal pulsewidth modulation inverter. An alternative optimized method for embedded fuzzy-system design is also proposed. The controller performance, in relation to reference and load-torque variations, is evaluated by experimental results. A comparative analysis with conventional proportional-integral controller is also achieved.

Work domain analysis for training-system definition and acquisition

Training-needs analysis is critical for defining and procuring effective training systems. However, traditional approaches to training-needs analysis are not suitable for capturing the demands of highly automated and computerized work domains. In this article, we propose that work domain analysis can identify the functional structure of a work domain that must be captured in a training system, so that workers can be trained to deal with unpredictable contingencies that cannot be handled by computer systems. To illustrate this argument, we outline a work domain analysis of a fighter aircraft that defines its functional structure in terms of its training objectives, measures of performance, basic training functions, physical functionality, and physical context. The functional structure or training needs identified by work domain analysis can then be used as a basis for developing functional specifications for training systems, specifically its design objectives, data collection capabilities, scenario generation capabilities, physical functionality, and physical attributes. Finally, work domain analysis also provides a useful framework for evaluating whether a tendered solution fulfills the training needs of a work domain.

An L-system-based plant modeling language

Cpfg is a program for simulating and visualizing plant development, based on the theory of L-systems. A special-purpose programming language, used to specify plant models, is an essential feature of cpfg. We review postulates of L-system theory that have influenced the design of this language. We then present the main constructs of this language, and evaluate it from a user's perspective.

Targeting of EBNA1 for rapid intracellular degradation overrides the inhibitory effects of the Gly-Ala repeat domain and restores CD8+T cell recognition

Epstein-Barr virus (EBV)-encoded nuclear antigen 1 (EBNA1) includes a unique glycine-alanine repeat domain that inhibits the endogenous presentation of cytotoxic T lymphocyte (CTL) epitopes through the class I pathway by blocking proteasome-dependent degradation of this antigen. This immune evasion mechanism has been implicated in the pathogenesis of EBV-associated diseases. Here, we show that cotranslational ubiquitination combined with N-end rule targeting enhances the intracellular degradation of EBNA1, thus resulting in a dramatic reduction in the half-life of the antigen. Using DNA expression vectors encoding different forms of ubiquitinated EBNA1 for in vivo studies revealed that this rapid degradation, remarkably, leads to induction of a very strong CTL response to an EBNA1-specific CTL epitope. Furthermore, this targeting also restored the endogenous processing of HLA class I-restricted CTL epitopes within EBNA1 for immune recognition by human EBV-specific CTLs. These observations provide, for the first time, evidence that the glycine-alanine repeat-mediated proteasomal block on EBNA1 can be reversed by specifically targeting this antigen for rapid degradation resulting in enhanced CD8+ T cell-mediated recognition in vitro and in vivo.

The GRIP domain is a specific targeting sequence for a population of trans-Golgi network derived tubulo-vesicular carriers

Vesicular carriers for intracellular transport associate with unique sets of accessory molecules that dictate budding and docking on specific membrane domains. Although many of these accessory molecules are peripheral membrane proteins, in most cases the targeting sequences responsible for their membrane recruitment have yet to be identified. We have previously defined a novel Golgi targeting domain (GRIP) shared by a family of coiled-coil peripheral membrane Golgi proteins implicated in membrane trafficking. We show here that the docking site for the GRIP motif of p230 is a specific domain of Golgi. membranes. By immunoelectron microscopy of HeLa cells stably expressing a green fluorescent protein (GFP)-p230(GRIP) fusion protein, we show binding specifically to a subset of membranes of the trans-Golgi network (TGN). Real-time imaging of live HeLa cells revealed that the GFP-p230(GRIP) was associated with highly dynamic tubular extensions of the TGN, which have the appearance and behaviour of transport carriers. To further define the nature of the GRIP membrane binding site, in vitro budding assays were performed using purified rat liver Golgi membranes and cytosol from GFP-p230(GRIP) transfected cells. Analysis of Golgi-derived vesicles by sucrose gradient fractionation demonstrated that GFP-p230(GRIP) binds to a specific population of vesicles distinct from those labelled for beta -COP or gamma -adaptin. The GFP-p230(GRIP) fusion protein is recruited to the same vesicle population as full-length p230, demonstrating that the GRIP domain is solely proficient as a targeting signal for membrane binding of the native molecule. Therefore, p230 GRIP is a targeting signal for recruitment to a highly selective membrane attachment site on a specific population of trans-Golgi network tubulovesicular carriers.

Database technologies for l-system simulations in virtual plant applications on bioinformatics

One of the most important advantages of database systems is that the underlying mathematics is rich enough to specify very complex operations with a small number of statements in the database language. This research covers an aspect of biological informatics that is the marriage of information technology and biology, involving the study of real-world phenomena using virtual plants derived from L-systems simulation. L-systems were introduced by Aristid Lindenmayer as a mathematical model of multicellular organisms. Not much consideration has been given to the problem of persistent storage for these simulations. Current procedures for querying data generated by L-systems for scientific experiments, simulations and measurements are also inadequate. To address these problems the research in this paper presents a generic process for data-modeling tools (L-DBM) between L-systems and database systems. This paper shows how L-system productions can be generically and automatically represented in database schemas and how a database can be populated from the L-system strings. This paper further describes the idea of pre-computing recursive structures in the data into derived attributes using compiler generation. A method to allow a correspondence between biologists' terms and compiler-generated terms in a biologist computing environment is supplied. Once the L-DBM gets any specific L-systems productions and its declarations, it can generate the specific schema for both simple correspondence terminology and also complex recursive structure data attributes and relationships.

Learning the dynamics of embedded clauses

Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.

Decision support system with incomplete and domain incoherent information management

Many of the most common human functions such as temporal and non-monotonic reasoning have not yet been fully mapped in developed systems, even though some theoretical breakthroughs have already been accomplished. This is mainly due to the inherent computational complexity of the theoretical approaches. In the particular area of fault diagnosis in power systems however, some systems which tried to solve the problem, have been deployed using methodologies such as production rule based expert systems, neural networks, recognition of chronicles, fuzzy expert systems, etc. SPARSE (from the Portuguese acronym, which means expert system for incident analysis and restoration support) was one of the developed systems and, in the sequence of its development, came the need to cope with incomplete and/or incorrect information as well as the traditional problems for power systems fault diagnosis based on SCADA (supervisory control and data acquisition) information retrieval, namely real-time operation, huge amounts of information, etc. This paper presents an architecture for a decision support system, which can solve the presented problems, using a symbiosis of the event calculus and the default reasoning rule based system paradigms, insuring soft real-time operation with incomplete, incorrect or domain incoherent information handling ability. A prototype implementation of this system is already at work in the control centre of the Portuguese Transmission Network.

EMMON - EMbedded MONitoring

Despite the steady increase in experimental deployments, most of research work on WSNs has focused only on communication protocols and algorithms, with a clear lack of effective, feasible and usable system architectures, integrated in a modular platform able to address both functional and non–functional requirements. In this paper, we outline EMMON [1], a full WSN-based system architecture for large–scale, dense and real–time embedded monitoring [3] applications. EMMON provides a hierarchical communication architecture together with integrated middleware and command and control software. Then, EM-Set, the EMMON engineering toolset will be presented. EM-Set includes a network deployment planning, worst–case analysis and dimensioning, protocol simulation and automatic remote programming and hardware testing tools. This toolset was crucial for the development of EMMON which was designed to use standard commercially available technologies, while maintaining as much flexibility as possible to meet specific applications requirements. Finally, the EMMON architecture has been validated through extensive simulation and experimental evaluation, including a 300+ nodes testbed.

EMMON: a system architecture for large- scale, dense and real-time WSNs

In spite of the significant amount of scientific work in Wireless Sensor Networks (WSNs), there is a clear lack of effective, feasible and usable WSN system architectures that address both functional and non-functional requirements in an integrated fashion. This poster abstract outlines the EMMON system architecture for large-scale, dense, real-time embedded monitoring. EMMON relies on a hierarchical network architecture together with integrated middleware and command&control mechanisms. It has been designed to use standard commercially– available technologies, while maintaining as much flexibility as possible to meet specific applications’ requirements. The EMMON WSN architecture has been validated through extensive simulation and experimental evaluation, including through a 300+ node test-bed, the largest WSN test-bed in Europe to date

Building adaptable, QoS-aware dependable embedded systems

Most of today’s embedded systems are required to work in dynamic environments, where the characteristics of the computational load cannot always be predicted in advance. Furthermore, resource needs are usually data dependent and vary over time. Resource constrained devices may need to cooperate with neighbour nodes in order to fulfil those requirements and handle stringent non-functional constraints. This paper describes a framework that facilitates the distribution of resource intensive services across a community of nodes, forming temporary coalitions for a cooperative QoSaware execution. The increasing need to tailor provided service to each application’s specific needs determines the dynamic selection of peers to form such a coalition. The system is able to react to load variations, degrading its performance in a controlled fashion if needed. Isolation between different services is achieved by guaranteeing a minimal service quality to accepted services and by an efficient overload control that considers the challenges and opportunities of dynamic distributed embedded systems.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Type System for the ComponentJ Programming Language

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Informática.