Sequence analysis and distribution of an IS3-like insertion element isolated from Salmonella enteritidis

The nucleotide sequence of a 3 kb region immediately upstream of the sef operon operon of Salmonella enteritidis was determined. A 1230 base pair insertion sequence which shared sequence identity (> 75%) with members of the IS3 family was revealed. This element, designated IS1230, had almost identical (90% identity) terminal inverted repeats to Escherichia coli IS3 but unlike other IS3-like sequences lacked the two characteristic open reading frames which encode the putative transposase. S. enteritidis possessed only one copy of this insertion sequence although Southern hybridisation analysis of restriction digests of genomic DNA revealed another fragment located in a region different from the sef operon which hybridised weakly which suggested the presence of an IS1230 homologue. The distribution of IS1230 and IS1230-like elements was shown to be widespread amongst salmonellas and the patterns of restriction fragments which hybridised differed significantly between Salmonella serotypes and it is suggested that IS1230 has potential for development as a differential diagnostic tool.

Sequence heterogeneity of an mpb70 gene analogue in Mycobacterium kansasii

The protein antigen MPB70 is a major component of culture supernatants of Mycobacterium bovis and Is an active ingredient of bovine PPD used for skin-testing cattle for tuberculosis. we have shown that Mycobacterium kansasii possesses a similar gene that cross-reacts in a PCR test for M. bovis. Single strand conformational polymorphism analysis, and the DNA sequence of the PCR product, shows differences between M. kansasii strains, supporting the suggestion that M. kansasii is not a homogeneous species.

On the solvability of second kind integral equations on the real line

This paper considers general second kind integral equations of the form(in operator form φ − kφ = ψ), where the functions k and ψ are assumed known, with ψ ∈ Y, the space of bounded continuous functions on R, and k such that the mapping s → k(s, · ), from R to L1(R), is bounded and continuous. The function φ ∈ Y is the solution to be determined. Conditions on a set W ⊂ BC(R, L1(R)) are obtained such that a generalised Fredholm alternative holds: If W satisfies these conditions and I − k is injective for all k ∈ W then I − k is also surjective for all k ∈ W and, moreover, the inverse operators (I − k) − 1 on Y are uniformly bounded for k ∈ W. The approximation of the kernel in the integral equation by a sequence (kn) converging in a weak sense to k is also considered and results on stability and convergence are obtained. These general theorems are used to establish results for two special classes of kernels: k(s, t) = κ(s − t)z(t) and k(s, t) = κ(s − t)λ(s − t, t), where κ ∈ L1(R), z ∈ L∞(R), and λ ∈ BC((R\{0}) × R). Kernels of both classes arise in problems of time harmonic wave scattering by unbounded surfaces. The general integral equation results are here applied to prove the existence of a solution for a boundary integral equation formulation of scattering by an infinite rough surface and to consider the stability and convergence of approximation of the rough surface problem by a sequence of diffraction grating problems of increasingly large period.

A review on the combination of binary classifiers in multiclass problems

Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.

Calixarene and Resorcarene Based Receptors: From Structural and Thermodynamic Studies to the Synthesis of a New Mercury(II) Selective Material

Materials used in current technological approaches for the removal of mercury lack selectivity. Given that this is one of the main features of supramolecular chemistry, receptors based on calix[4]arene and calix[4]resorcarene containing functional groups able to interact selectively with polluting ions while discriminating against biologically essential ones were designed. Thus two receptors, a partially functionalized calix[4]arene derivative, namely, 5,11,17,23-tetra-tert-butyl [25-27-bis(diethyl thiophosphate amino)dihydroxy] calix[4]arene (1) and a fully functionalized calix[4]resorcarene, 4,6,10,12,16,18,22,24-diethyl thiophosphate calix[4]resorcarene (2) are introduced. Mercury(II) was the identified target due to the environmental and health problems associated with its presence in water Thus following the synthesis and characterization of 1 and 2 in solution ((1)HNMR) and in the solid state (X-ray crystallography) the sequence of experimental events leading to cation complexation studies in acetonitrile and methanol ((1)H NMR, conductance, potentiometric, and calorimetric measurements) with the aim of assessing their behavior as mercury selective receptors are described. The cation selectivity pattern observed in acetonitrile follows the sequence Hg(II) > Cu(II) > Ag(I). In methanol 1 is also selective for Hg(II) relative to Ag(I) but no interaction takes place between this receptor and Cu(II) in this solvent. Based on previous results and experimental facts shown in this paper, it is concluded that the complexation observed with Cu(II) in acetonitrile occurs through the acetonitrile-receptor adduct rather than through the free ligand. Receptor 2 has an enhanced capacity for uptaking Hg(II) but forms metalate complexes with Cu(II). These studies in solution guided the inmobilization of receptor 1 into a silica support to produce a new and recyclable material for the removal of Hg(II) from water. An assessment on its capacity to extract this cation from water relative to Cu(II) and Ag (I) shows that the cation selectivity pattern of the inmobilized receptor is the same as that observed for the free receptor in methanol. These findings demonstrate that fundamental studies play a critical role in the selection of the receptor to be attached to silicates as well as in the reaction medium used for the synthesis of the new decontaminating agent.

Graphical constraints: a graphical user interface for constraint problems

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embraces areas like resource allocation, scheduling, timetabling or vehicle routing. Constraint programming is a form of declarative programming in the sense that instead of specifying a sequence of steps to execute, it relies on properties of the solutions to be found, which are explicitly defined by constraints. The idea of constraint programming is to solve problems by stating constraints which must be satisfied by the solutions. Constraint programming is based on specialized constraint solvers that take advantage of constraints to search for solutions. The success and popularity of complex problem solving tools can be greatly enhanced by the availability of friendly user interfaces. User interfaces cover two fundamental areas: receiving information from the user and communicating it to the system; and getting information from the system and deliver it to the user. Despite its potential impact, adequate user interfaces are uncommon in constraint programming in general. The main goal of this project is to develop a graphical user interface that allows to, intuitively, represent constraint satisfaction problems. The idea is to visually represent the variables of the problem, their domains and the problem constraints and enable the user to interact with an adequate constraint solver to process the constraints and compute the solutions. Moreover, the graphical interface should be capable of configure the solver’s parameters and present solutions in an appealing interactive way. As a proof of concept, the developed application – GraphicalConstraints – focus on continuous constraint programming, which deals with real valued variables and numerical constraints (equations and inequalities). RealPaver, a state-of-the-art solver in continuous domains, was used in the application. The graphical interface supports all stages of constraint processing, from the design of the constraint network to the presentation of the end feasible space solutions as 2D or 3D boxes.

Bifurcation Analysis of a Van der Pol-Duffing Circuit with Parallel Resistor

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

cDNA sequence and molecular modeling of a nerve growth factor from Bothrops jararacussu venomous gland

The complete nucleotide sequence of a nerve growth factor precursor from Bothrops jararacussu snake (Bj-NGF) was determined by DNA sequencing of a clone from cDNA library prepared from the poly(A) + RNA of the venom gland of B.jararacussu. cDNA encoding Bj-NGF precursor contained 723 bp in length, which encoded a prepro-NGF molecule with 241 amino acid residues. The mature Bj-NGF molecule was composed of I 18 amino acid residues with theoretical pI and molecular weight of 8.31 and 13,537, respectively. Its amino acid sequence showed 97%, 96%, 93%, 86%, 78%, 74%, 76%, 76% and 55% sequential similarities with NGFs from Crotalus durissus terrificus, Agkistrodon halys pallas, Daboia (Vipera) russelli russelli, Bungarus multicinctus, Naja sp., mouse, human, bovine and cat, respectively. Phylogenetic analyses based on the amino acid sequences of 15 NGFs separate the Elapidae family (Naja and Bungarus) from those Crotalidae snakes (Bothrops, Crotalus and Agkistrodon). The three-dimensional structure of mature Bj-NGF was modeled based on the crystal structure of the human NGF. The model reveals that the core of NGF, formed by a pair of P-sheets, is highly conserved and the major mutations are both at the three beta-hairpin loops and at the reverse turn. (C) 2002 Societe francaise de biochimie et biologic moleculaire/Editions scientifiques et medicales Elsevier SAS. All rights reserved.

Structural basis for the specificity of bipartite nuclear localization sequence binding by importin-alpha

Importin-alpha is the nuclear import receptor that recognizes cargo proteins carrying conventional basic monopartite and bipartite nuclear localization sequences (NLSs) and facilitates their transport into the nucleus. Bipartite NLSs contain two clusters of basic residues, connected by linkers of variable lengths. To determine the structural basis of the recognition of diverse bipartite NLSs by mammalian importin-alpha, we co-crystallized a non-autoinhibited mouse receptor protein with peptides corresponding to the NLSs from human retinoblastoma protein and Xenopus laevis phosphoprotein N1N2, containing diverse sequences and lengths of the linker. We show that the basic clusters interact analogously in both NLSs, but the linker sequences adopt different conformations, whereas both make specific contacts with the receptor. The available data allow us to draw general conclusions about the specificity of NLS binding by importin-alpha and facilitate an improved definition of the consensus sequence of a conventional basic/bipartite NLS (KRX10-12KRRK) that can be used to identify novel nuclear proteins.

Genetic identification of the sharks Rhizoprionodon porosus and R. lalandii by PCR-RFLP and nucleotide sequence analyses of 5S rDNA

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Discrete approximations for strict convex continuous time problems and duality

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES

Statecharts are an extension to finite state machines with capability for expressing hierarchical decomposition and parallelism. They also have a mechanism called history, to remember the last visit to a superstate. An algorithm to create a reachability tree for statecharts is presented. Also shown is how to use this tree to analyse dynamic properties of statecharts; reachability from any state configuration, usage of transitions, reinitiability, deadlocks, and valid sequence of events. Owing to its powerful notation, building a reachability tree for statecharts presents some difficulties, and we show how these problems were solved in the tree we propose.

Complete nucleotide sequence, genomic organization and phylogenetic analysis of Citrus leprosis virus cytoplasmic type

The complete nucleotide sequence of the genomic RNA 1 (8745 nt) and RNA 2 (4986 nt) of Citrus leprosis virus cytoplasmic type (CiLV-C) was determined using cloned cDNA. RNA 1 contains two open reading frames (ORFs), which correspond to 286 and 29 kDa proteins. The 286 kDa protein is a polyprotein putatively involved in virus replication, which contains four conserved domains: methyltransferase, protease, helicase and polymerase. RNA 2 contains four ORFs corresponding to 15, 61, 32 and 24 kDa proteins, respectively. The 32 kDa protein is apparently involved in cell-to-cell movement of the virus, but none of the other putative proteins exhibit any conserved domain. The 5' regions of the two genomic RNAs contain a 'cap' structure and poly(A) tails were identified in the 3'-terminals. Sequence analyses and searches for structural and non-structural protein similarities revealed conserved domains with members of the genera Furovirus, Bromovirus, Tobravirus and Tobamovirus, although phylogenetic analyses strongly suggest that CiLV-C is a member of a distinct, novel virus genus and family, and definitely demonstrate that it does not belong to the family Rhabdoviridae, as previously proposed. Based on these results it was proposed that Citrus leprosis virus be considered as the type member of a new genus of viruses, Cilevirus.

Entransy and its utilization in problems of thermodynamics and heat transfer

The concept of entransy was recently proposed in terms of the analogy to the electric energy stored in a capacitor. The entransy of a system describes its heat transfer ability, as the exergy of a system quantifies its work production potential. Hence, the concept of entransy can be useful in problems where the heat transfer is the main objective, as for example, in systems collecting solar energy. This concept is quite recent and there are only a few works related to this topic. It is expected, however, that this approach will soon be used more often in the analysis of problems in thermodynamics and heat transfer. The objective of this work is to present a review of the concept of entransy in a systematic way, beginning with its definition, balance equations and a few examples of simple applications. It is hoped that this concept of entransy becomes a useful tool in the analysis and design of more efficient thermal systems. © 2012 Praise Worthy Prize S.r.l.- All rights reserved.

Estimation of spontaneous blinking main sequence in normal subjects and patients with Graves' upper eyelid retraction

Purpose. We quantified the main sequence of spontaneous blinks in normal subjects and Graves' disease patients with upper eyelid retraction using a nonlinear and two linear models, and examined the variability of the main sequence estimated with standard linear regression for 10-minute periods of time. Methods. A total of 20 normal subjects and 12 patients had their spontaneous blinking measured with the magnetic search coil technique when watching a video during one hour. The main sequence was estimated with a power-law function, and with standard and trough the origin linear regressions. Repeated measurements ANOVA was used to test the mean sequence stability of 10-minute bins measured with standard linear regression. Results. In 95% of the sample the correlation coefficients of the main sequence ranged from 0.60 to 0.94. Homoscedasticity of the peak velocity was not verified in 20% of the subjects and 25% of the patients. The power-law function provided the best main sequence fitting for subjects and patients. The mean sequence of 10-minute bins measured with standard linear regression did not differ from the one-hour period value. For the entire period of observation and the slope obtained by standard linear regression, the main sequence of the patients was reduced significantly compared to the normal subjects. Conclusions. Standard linear regression is a valid and stable approximation for estimating the main sequence of spontaneous blinking. However, the basic assumptions of the linear regression model should be examined on an individual basis. The maximum velocity of large blinks is slower in Graves' disease patients than in normal subjects. © 2013 The Association for Research in Vision and Ophthalmology, Inc.