Worldwide HLA-E nucleotide and haplotype variability reveals a conserved gene for coding and 3 ' untranslated regions

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

Desempenho de escolares com dislexia e transtorno do déficit de atenção e hiperatividade nos processos de leitura

This study aimed to characterize and to compare the performance of students with an interdisciplinary diagnosis of dyslexia and attention deficit hyperactivity disorder (ADHD) in students with good academic performance on the reading processes. Sixty students from both genders, from 2nd to 4th grades of municipal public schools in Marília - SP participated in this study, they were distributed as follows: GI, 20 students with interdisciplinary diagnosis of dyslexia; GII, 20 students with ADHD and GIII, 20 students with good academic performance, paired according to gender, age and grade level with GI and GII. The students were submitted to the application of the assessment of reading processes (PROLEC) composed by four processes: letters identification, lexical, syntactical and semantic. The results highlighted that the students of GIII showed superior performance comparing with GI and GII. There was difference between GI and GII only in low frequency word reading and non words reading of the lexical process. The inferior performance from GI and GII in the PROLEC tests can be justified by the difficulty on the coding and decoding abilities. In ADHD students this difficulty was due to impaired interaction between the visual, linguistic, attention and auditory processing and in the dyslexic students was due to failure at the phonological mediation process, which depends on the knowledge of rules of grapheme - phoneme conversion to the acquisition of word reading. These changes affect the reading achievement and the comprehension of the read text.

Controllability and stabilizability of linear time-varying distributed hereditary control systems

This paper is concerned with the controllability and stabilizability problem for control systems described by a time-varyinglinear abstract differential equation with distributed delay in the state variables. An approximate controllability propertyis established, and for periodic systems, the stabilization problem is studied. Assuming that the semigroup of operatorsassociated with the uncontrolled and non delayed equation is compact, and using the characterization of the asymptoticstability in terms of the spectrum of the monodromy operator of the uncontrolled system, it is shown that the approximatecontrollability property is a sufficient condition for the existence of a periodic feedback control law that stabilizes thesystem. The result is extended to include some systems which are asymptotically periodic. Copyright © 2014 John Wiley &Sons, Ltd.

Alterações epigenéticas do gene RASSF1 e investigação de modulação gene-específica por non-coding RNA em linhagens celulares derivadas de carcinomas mamários

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

Comparative floral micromorphology and anatomy of species of Bulbophyllum section Napelli (Orchidaceae), a Neotropical section widely distributed in forest habitats

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

Active power reserve for frequency control provided by distributed generators in distribution networks

In a smart grid environment, attention should be paid not only to the power supplied to satisfy loads and system losses but also to the services necessary to provide security and stability to the system: the so-called ancillary services. As they are well known the benefits that distributed generation can bring to electrical systems and to the environment, in this work the possibility that active power reserve for frequency control could be provided by distributed generators (DGs) in an efficient and economical way is explored. The proposed methodology was tested using the IEEE 34-bus distribution test system. The results show improvements in the capacity of the system for this ancillary service and decrease in system losses and payments of the distribution system operator to the DGs.

Representation of transmission lines: comparison of models and parameters distributed discrete parameters

A transmission line is characterized by the fact that its parameters are distributed along its length. This fact makes the voltages and currents along the line to behave like waves and these are described by differential equations. In general, the differential equations mentioned are difficult to solve in the time domain, due to the convolution integral, but in the frequency domain these equations become simpler and their solutions are known. The transmission line can be represented by a cascade of π circuits. This model has the advantage of being developed directly in the time domain, but there is a need to apply numerical integration methods. In this work a comparison of the model that considers the fact that the parameters are distributed (Universal Line Model) and the fact that the parameters considered concentrated along the line (π circuit model) using the trapezoidal integration method, and Simpson's rule Runge-Kutta in a single-phase transmission line length of 100 km subjected to an operation power. © 2003-2012 IEEE.

Development of CAN-based distributed control system for variable rate technology in agricultural machinery

The number of electronic devices connected to agricultural machinery is increasing to support new agricultural practices tasks related to the Precision Agriculture such as spatial variability mapping and Variable Rate Technology (VRT). The Distributed Control System (DCS) is a suitable solution for decentralization of the data acquisition system and the Controller Area Network (CAN) is the major trend among the embedded communications protocols for agricultural machinery and vehicles. The application of soil correctives is a typical problem in Brazil. The efficiency of this correction process is highly dependent of the inputs way at soil and the occurrence of errors affects directly the agricultural yield. To handle this problem, this paper presents the development of a CAN-based distributed control system for a VRT system of soil corrective in agricultural machinery. The VRT system is composed by a tractor-implement that applies a desired rate of inputs according to the georeferenced prescription map of the farm field to support PA (Precision Agriculture). The performance evaluation of the CAN-based VRT system was done by experimental tests and analyzing the CAN messages transmitted in the operation of the entire system. The results of the control error according to the necessity of agricultural application allow conclude that the developed VRT system is suitable for the agricultural productions reaching an acceptable response time and application error. The CAN-Based DCS solution applied in the VRT system reduced the complexity of the control system, easing the installation and maintenance. The use of VRT system allowed applying only the required inputs, increasing the efficiency operation and minimizing the environmental impact.

PB1908-27 Loss From Cornstalk Disease in Custer County, Nebraska, During the Winter of 1906-1907 (Distributed January 1908, Reprinted December 1930)

"Cornstalk disease" is the name given to the cause or causes of death of cattle allowed to run in fields of standing cornstalks from which the ears have been gathered. It is probable that "many different maladies have been included under this name." In Nebraska, however, there is such a similarity in the symptoms reported by the farmers that it seems probable that the great majority of the losses attributed to cornstalk disease are really due to some common cause. As to the exact nature of this cause nothing is known. However, various theories have been advanced, and methods of prevention or treatment based upon these theories have been described.

Hierarchy-Based Access Control in Distributed Environments

Access control is a fundamental concern in any system that manages resources, e.g., operating systems, file systems, databases and communications systems. The problem we address is how to specify, enforce, and implement access control in distributed environments. This problem occurs in many applications such as management of distributed project resources, e-newspaper and payTV subscription services. Starting from an access relation between users and resources, we derive a user hierarchy, a resource hierarchy, and a unified hierarchy. The unified hierarchy is then used to specify the access relation in a way that is compact and that allows efficient queries. It is also used in cryptographic schemes that enforce the access relation. We introduce three specific cryptography based hierarchical schemes, which can effectively enforce and implement access control and are designed for distributed environments because they do not need the presence of a central authority (except perhaps for set- UP).

Distributed Hybrid Agent Based Intrusion Detection and Real Time Response System

Wireless LANs are growing rapidly and security has always been a concern. We have implemented a hybrid system, which will not only detect active attacks like identity theft causing denial of service attacks, but will also detect the usage of access point discovery tools. The system responds in real time by sending out an alert to the network administrator.

Centralized vs. Distributed Connection Management Schemes under Different Traffic Patterns in Wavelength-Convertible Optical Networks

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of centralized method over distributed method is inversely proportional to the ratio of average connection interarrival time to reservation time. After that ratio increases beyond a threshold, those two connection management schemes yield almost the same blocking probability under the same network load. In this paper, we review the working procedure of distributed and centralized schemes, discuss the tradeoff between them, compare these two methods under different network traffic patterns via simulation and give our conclusion based on the simulation data.

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.