Programa de remediação fonológica em escolares com dificuldades de aprendizagem

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

Desempenho de escolares com e sem dificuldades de aprendizagem de ensino particular em habilidade fonológica, nomeação rápida, leitura e escrita

OBJETIVOS: caracterizar e comparar o desempenho de escolares com e sem dificuldades de aprendizagem no ensino particular em habilidades fonológicas, nomeação rápida, leitura e escrita. MÉTODOS: participaram desse estudo 60 escolares de 2ª a 4ª séries de escola de ensino particular, distribuídos em 6 grupos, sendo cada grupo composto por 10 escolares, sendo 3 grupos de escolares com dificuldades de aprendizagem e 3 grupos de escolares sem dificuldades de aprendizagem. Como procedimentos, foram realizadas a prova de nomeação automática rápida, a de consciência fonológica e a prova de leitura oral e escrita sob ditado. RESULTADOS: os resultados desse estudo evidenciaram desempenho superior dos escolares sem dificuldades de aprendizagem em relação àqueles com dificuldades. Os escolares com dificuldades de aprendizagem apresentaram maior relação velocidade/tempo em tarefas de nomeação e, conseqüentemente, desempenho inferior em tarefas de consciência fonológica e leitura e escrita de palavras isoladas quando comparados aos sem dificuldades de aprendizagem. CONCLUSÃO: os escolares com dificuldades de aprendizagem apresentaram comprometimento na relação entre as capacidades de nomeação e automatização dos estímulos apresentados com a capacidade de acesso lexical, discriminação visual, freqüência de uso dos estímulos e competição para a apresentação do menor tempo possível na nomeação dos códigos necessários para o estabelecimento do mecanismo de conversão fonema-grafema, exigido para a realização da leitura e escrita em um sistema alfabético como o português.

Deciding difference logic in a Nelson-Oppen combination framework

O método de combinação de Nelson-Oppen permite que vários procedimentos de decisão, cada um projetado para uma teoria específica, possam ser combinados para inferir sobre teorias mais abrangentes, através do princípio de propagação de igualdades. Provadores de teorema baseados neste modelo são beneficiados por sua característica modular e podem evoluir mais facilmente, incrementalmente. Difference logic é uma subteoria da aritmética linear. Ela é formada por constraints do tipo x − y ≤ c, onde x e y são variáveis e c é uma constante. Difference logic é muito comum em vários problemas, como circuitos digitais, agendamento, sistemas temporais, etc. e se apresenta predominante em vários outros casos. Difference logic ainda se caracteriza por ser modelada usando teoria dos grafos. Isto permite que vários algoritmos eficientes e conhecidos da teoria de grafos possam ser utilizados. Um procedimento de decisão para difference logic é capaz de induzir sobre milhares de constraints. Um procedimento de decisão para a teoria de difference logic tem como objetivo principal informar se um conjunto de constraints de difference logic é satisfatível (as variáveis podem assumir valores que tornam o conjunto consistente) ou não. Além disso, para funcionar em um modelo de combinação baseado em Nelson-Oppen, o procedimento de decisão precisa ter outras funcionalidades, como geração de igualdade de variáveis, prova de inconsistência, premissas, etc. Este trabalho apresenta um procedimento de decisão para a teoria de difference logic dentro de uma arquitetura baseada no método de combinação de Nelson-Oppen. O trabalho foi realizado integrando-se ao provador haRVey, de onde foi possível observar o seu funcionamento. Detalhes de implementação e testes experimentais são relatados

Uma abordagem dirigida por modelos para desenvolvimento de middlewares auto-adaptativos para transmissão de fluxo de dados baseado em restrições de QoS

The use of middleware technology in various types of systems, in order to abstract low-level details related to the distribution of application logic, is increasingly common. Among several systems that can be benefited from using these components, we highlight the distributed systems, where it is necessary to allow communications between software components located on different physical machines. An important issue related to the communication between distributed components is the provision of mechanisms for managing the quality of service. This work presents a metamodel for modeling middlewares based on components in order to provide to an application the abstraction of a communication between components involved in a data stream, regardless their location. Another feature of the metamodel is the possibility of self-adaptation related to the communication mechanism, either by updating the values of its configuration parameters, or by its replacement by another mechanism, in case of the restrictions of quality of service specified are not being guaranteed. In this respect, it is planned the monitoring of the communication state (application of techniques like feedback control loop), analyzing performance metrics related. The paradigm of Model Driven Development was used to generate the implementation of a middleware that will serve as proof of concept of the metamodel, and the configuration and reconfiguration policies related to the dynamic adaptation processes. In this sense was defined the metamodel associated to the process of a communication configuration. The MDD application also corresponds to the definition of the following transformations: the architectural model of the middleware in Java code, and the configuration model to XML

MoSAC: um módulo para seleção de configurações arquiteturais baseado em critérios de QoS no contexto de sistema distribuídos autoadaptativos

The process for choosing the best components to build systems has become increasingly complex. It becomes more critical if it was need to consider many combinations of components in the context of an architectural configuration. These circumstances occur, mainly, when we have to deal with systems involving critical requirements, such as the timing constraints in distributed multimedia systems, the network bandwidth in mobile applications or even the reliability in real-time systems. This work proposes a process of dynamic selection of architectural configurations based on non-functional requirements criteria of the system, which can be used during a dynamic adaptation. This proposal uses the MAUT theory (Multi-Attribute Utility Theory) for decision making from a finite set of possibilities, which involve multiple criteria to be analyzed. Additionally, it was proposed a metamodel which can be used to describe the application s requirements in terms of the non-functional requirements criteria and their expected values, to express them in order to make the selection of the desired configuration. As a proof of concept, it was implemented a module that performs the dynamic choice of configurations, the MoSAC. This module was implemented using a component-based development approach (CBD), performing a selection of architectural configurations based on the proposed selection process involving multiple criteria. This work also presents a case study where an application was developed in the context of Digital TV to evaluate the time spent on the module to return a valid configuration to be used in a middleware with autoadaptative features, the middleware AdaptTV

CrossMDA2: Uma abordagem para minimizar o problema da fragilidade de pointcuts na evolução de sistemas orientados a aspectos

This work proposes a model based approach for pointcut management in the presence of evolution in aspect oriented systems. The proposed approach, called conceptual visions based pointcuts, is motivated by the observation of the shortcomings in traditional approaches pointcuts definition, which generally refer directly to software structure and/or behavior, thereby creating a strong coupling between pointcut definition and the base code. This coupling causes the problem known as pointcut fragility problem and hinders the evolution of aspect-oriented systems. This problem occurs when all the pointcuts of each aspect should be reviewed due to any software changes/evolution, to ensure that they remain valid even after the changes made in the software. Our approach is focused on the pointcuts definition based on a conceptual model, which has definitions of the system's structure in a more abstract level. The conceptual model consists of classifications (called conceptual views) on entities of the business model elements based on common characteristics, and relationships between these views. Thus the pointcuts definitions are created based on the conceptual model rather than directly referencing the base model. Moreover, the conceptual model contains a set of relationships that allows it to be automatically verified if the classifications in the conceptual model remain valid even after a software change. To this end, all the development using the conceptual views based pointcuts approach is supported by a conceptual framework called CrossMDA2 and a development process based on MDA, both also proposed in this work. As proof of concept, we present two versions of a case study, setting up a scenario of evolution that shows how the use of conceptual visions based pointcuts helps detecting and minimizing the pointcuts fragility. For the proposal evaluation the Goal/Question/Metric (GQM) technique is used together with metrics for efficiency analysis in the pointcuts definition

Estendendo CRefine para o suporte de táticas de refinamento

The use of increasingly complex software applications is demanding greater investment in the development of such systems to ensure applications with better quality. Therefore, new techniques are being used in Software Engineering, thus making the development process more effective. Among these new approaches, we highlight Formal Methods, which use formal languages that are strongly based on mathematics and have a well-defined semantics and syntax. One of these languages is Circus, which can be used to model concurrent systems. It was developed from the union of concepts from two other specification languages: Z, which specifies systems with complex data, and CSP, which is normally used to model concurrent systems. Circus has an associated refinement calculus, which can be used to develop software in a precise and stepwise fashion. Each step is justified by the application of a refinement law (possibly with the discharge of proof obligations). Sometimes, the same laws can be applied in the same manner in different developments or even in different parts of a single development. A strategy to optimize this calculus is to formalise these application as a refinement tactic, which can then be used as a single transformation rule. CRefine was developed to support the Circus refinement calculus. However, before the work presented here, it did not provide support for refinement tactics. The aim of this work is to provide tool support for refinement tactics. For that, we develop a new module in CRefine, which automates the process of defining and applying refinement tactics that are formalised in the tactic language ArcAngelC. Finally, we validate the extension by applying the new module in a case study, which used the refinement tactics in a refinement strategy for verification of SPARK Ada implementations of control systems. In this work, we apply our module in the first two phases of this strategy

Formal verification of PLC programs using the B Method

PLCs (acronym for Programmable Logic Controllers) perform control operations, receiving information from the environment, processing it and modifying this same environment according to the results produced. They are commonly used in industry in several applications, from mass transport to petroleum industry. As the complexity of these applications increase, and as various are safety critical, a necessity for ensuring that they are reliable arouses. Testing and simulation are the de-facto methods used in the industry to do so, but they can leave flaws undiscovered. Formal methods can provide more confidence in an application s safety, once they permit their mathematical verification. We make use of the B Method, which has been successfully applied in the formal verification of industrial systems, is supported by several tools and can handle decomposition, refinement, and verification of correctness according to the specification. The method we developed and present in this work automatically generates B models from PLC programs and verify them in terms of safety constraints, manually derived from the system requirements. The scope of our method is the PLC programming languages presented in the IEC 61131-3 standard, although we are also able to verify programs not fully compliant with the standard. Our approach aims to ease the integration of formal methods in the industry through the abbreviation of the effort to perform formal verification in PLCs

Uma máquina de redução de grafos para serviços web

Web services are software accessible via the Internet that provide functionality to be used by applications. Today, it is natural to reuse third-party services to compose new services. This process of composition can occur in two styles, called orchestration and choreography. A choreography represents a collaboration between services which know their partners in the composition, to achieve the service s desired functionality. On the other hand, an orchestration have a central process (the orchestrator) that coordinates all application operations. Our work is placed in this latter context, by proposing an abstract model for running service orchestrations. For this purpose, a graph reduction machine will be defined for the implementation of service orchestrations specified in a variant of the PEWS composition language. Moreover, a prototype of this machine (in Java) is built as a proof of concept

Um framework conceitual para apoiar a instrumentação da avaliação formativa da aprendizagem em jogos digitais

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

Reengenharia do framework cosmos: uma solução para prover suporte e adaptações abertas.

Self-adaptive software system is able to change its structure and/or behavior at runtime due to changes in their requirements, environment or components. One way to archieve self-adaptation is the use a sequence of actions (known as adaptation plans) which are typically defined at design time. This is the approach adopted by Cosmos - a Framework to support the configuration and management of resources in distributed environments. In order to deal with the variability inherent of self-adaptive systems, such as, the appearance of new components that allow the establishment of configurations that were not envisioned at development time, this dissertation aims to give Cosmos the capability of generating adaptation plans of runtime. In this way, it was necessary to perform a reengineering of the Cosmos Framework in order to allow its integration with a mechanism for the dynamic generation of adaptation plans. In this context, our work has been focused on conducting a reengineering of Cosmos. Among the changes made to in the Cosmos, we can highlight: changes in the metamodel used to represent components and applications, which has been redefined based on an architectural description language. These changes were propagated to the implementation of a new Cosmos prototype, which was then used for developing a case study application for purpose of proof of concept. Another effort undertaken was to make Cosmos more attractive by integrating it with another platform, in the case of this dissertation, the OSGi platform, which is well-known and accepted by the industry

Mechanical comparative analysis of three different types of sutures in different dimensions tendons: experimental study

O objetivo da presente investigação experimental foi avaliar o perfil mecânico de três tipos de técnicas de sutura entre tendões de dimensões diferentes. Foram utilizados 21 cães sem raça definida (11machos/10 fêmeas), dos quais foram obtidos os tendões flexor comum dos dedos - t.c. (maior dimensão) e tibial cranial - t.cr. (menor dimensão), de ambos os membros pélvicos. Logo após a obtenção das peças foi realizada sutura, segundo cada tipo de técnica, porém sempre com o mesmo número de pontos. Os tendões utilizados para sutura foram sempre do lado direito e o controle do lado esquerdo (t.cr.). Após a sutura, os corpos de prova foram fixados em garras especialmente desenvolvidas e submetidos a ensaio de tração axial à velocidade de 30mm/minuto. Após o ensaio o programa da máquina forneceu os valores da carga máxima ( na ruptura) e deformação absoluta (mm) e relativa (%), além do diagrama carga-deformação. Os resultados foram submetidos a estudo estatístico pela análise de medidas repetidas no nível de 5% de significância. Não foi constatada diferença estatisticamente significativa nos parâmetros mecânicos avaliados nos três grupos de técnicas de suturas. em relação ao controle (tendão de menos diâmetro contra-lateral), observou-se que a sutura apresenta resistência máxima a tração significativamente menor que o controle e maior deformação.

Análise comparativa das propriedades mecânicas do ligamento da patela e do tendão calcâneo

Com a finalidade de se comparar as propriedades mecânicas do ligamento da patela e do tendão calcâneo foram realizados ensaios de tração em material obtido de 25 cadáveres humanos. A idade dos doadores foi 58 ± 14 anos (33-85), sendo 19 (76%) masculinos e 6 (24%) femininos, 23 brancos (92%) e dois negros (8%). Os materiais foram testados em seus 10 mm centrais, com velocidade de aplicação de carga de 30 mm/min. Foi obtida a área de secção dos corpos de prova para que fossem estudadas as propriedades estruturais e materiais. Foram estudadas as seguintes variáveis: carga máxima (N), tensão(MPa), módulo de elasticidade (MPa), energia (Nm), alongamento absoluto (mm) e específico (%), limite de proporcionalidade (N), além da tensão (MPa) e alongamentos neste ponto. A análise estatística revelou que ambos possuem carga máxima, limite de proporcionalidade e tensão semelhantes (p>0,05). Nas outras variáveis ocorreu diferença significativa (p<0,05) com o tendão calcâneo apresentando valores maiores para energia e alongamento. O módulo de elasticidade, significativamente maior no ligamento da patela (p<0,05), foi a variável que melhor caracterizou a diferença do comportamento mecânico dos dois materiais.

Extensões ao Projeto LVWNet: mobilidade, interação com equipamentos reais, comunicação direta, e registro dinâmico de nós

Due to the constantly increasing use of wireless networks in domestic, business and industrial environments, new challenges have emerged. The prototyping of new protocols in these environments is typically restricted to simulation environments, where there is the need of double implementation, one in the simulation environment where an initial proof of concept is performed and the other one in a real environment. Also, if real environments are used, it is not trivial to create a testbed for high density wireless networks given the need to use various real equipment as well as attenuators and power reducers to try to reduce the physical space required to create these laboratories. In this context, LVWNet (Linux Virtual Wireless Network) project was originally designed to create completely virtual testbeds for IEEE 802.11 networks on the Linux operating system. This paper aims to extend the current project LVWNet, adding to it the features like the ability to interact with real wireless hardware, provides a initial mobility ability using the positioning of the nodes in a space coordinates environment based on meters, with loss calculations due to attenuation in free space, enables some scalability increase by creating an own protocol that allows the communication between nodes without an intermediate host and dynamic registration of nodes, allowing new nodes to be inserted into in already in operation network

Diagnóstico sorológico da brucelose bovina em animais adultos vacinados com dose reduzida da cepa 19 de Brucella abortus

Com o presente trabalho avaliou-se o uso de dose reduzida da vacina produzida com a amostra 19 de Brucella abortus, em rebanho adulto negativo para a enfermidade, por meio de técnicas de diagnóstico sorológico preconizadas pelo Programa Nacional de Controle e Erradicação da Brucelose e Tuberculose Animal e por um ensaio indireto de imunoadsorção enzimática (ELISA ID). A prova de fixação de complemento detectou 46,77% de positivos, o antígeno acidificado tamponado 67,74%, o 2-mercaptoetanol com soroaglutinação lenta 87,09% e o ELISA ID 100%. A dose reduzida interferiu no diagnóstico sorológico. Nenhuma das técnicas apresentou especificidade adequada para uso em rebanho nestas condições, até 3 meses após a vacinação.