Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support

In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.

The calcium wave model of the perception-action cycle: Evidence from semantic relevance in memory experiments

We present a general model of brain function (the calcium wave model), distinguishing three processing modes in the perception-action cycle. The model provides an interpretation of the data from experiments on semantic memory conducted by the authors. © 2013 Pereira Jr, Santos and Barros.

Desenvolvimento de um sistema dinâmico para predição de cargas elétricas por redes neurais através do paradigma de programação orientada a objeto sob a linguagem JAVA

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

Interface gráfica no contexto de teoria dos jogos sob a forma de Java Apples

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

Teoria da ressonância adaptativa através da linguagem Java para detecção e classificação de e-mails indesejados

Pós-graduação em Engenharia Elétrica - FEIS

Compilação de bytecodes Java para um ambiente de arquitetura reconfigurável

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

Sistema avançado de realidade virtual para visualização de estruturas odontológicas

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

Disponibilidade hídrica na germinação de sementes e no crescimento de plântulas da leguminosa forrageira Macrotyloma axillare (E. Mey) Verdc. cv. Java

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

The perfective aspect in english and portuguese: a constrative study on semantic basis

An exam of the occurrences of the PRESENT PERFECT in Englishwas made in such a way as to establish the prevailing semantic features ofthis verbal form. I t was verified up to what an extent the meaning of thePERFECTIVE thus characterized is expressed in the corresponding Portuguesesentences in the PRETÉRITO PERFEITO. It was found that in Portuguesethe verbal inflexion itself characterizes in a much smaller degree the PERFECTIVE ASPECT.

Translation and cultural adaptation of Brazilian Detailed Assessment of Speed of Handwriting: conceptual and semantic equivalence

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

Atribuição de turmas para professores via Beam Search em Java

In the universities, before the start of each school year, is held the distribution of classes among available teachers. Therefore, it is necessary to consider the maximum workweek for each teacher and their preferences for each discipline, to prevent a teacher to give lessons in two separate locations at the same time and to avoid some teachers to become overloaded while others with large clearance. This process, manually performed, is time consuming and does not allow the visualization of other combinations of assignment of teachers to classes, besides being liable to error. This work aims to develop a decision support tool for the problem of assigning teachers to classes in college. The project encompasses the development of a computer program using the concepts of object orientation and a tree search algorithm of a combinatorial nature called Beam Search. The programming language used is Java and the program has a graphical interface for entering and manipulating data of the problem. Once obtained the schedule data of classes and teachers is possible, by means of the tool, perform various simulations and manual adjustments to achieve the final result. It is an efficient method of class scheduling, considering the speed of task execution and the fact that it generates only feasible results

A neighbourhood semantic for the Logic TK

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

Sofya: Supporting Rapid Development of Dynamic Program Analyses for Java

Dynamic analysis is an increasingly important means of supporting software validation and maintenance. To date, developers of dynamic analyses have used low-level instrumentation and debug interfaces to realize their analyses. Many dynamic analyses, however, share multiple common high-level requirements, e.g., capture of program data state as well as events, and efficient and accurate event capture in the presence of threading. We present SOFYA – an infra-structure designed to provide high-level, efficient, concurrency-aware support for building analyses that reason about rich observations of program data and events. It provides a layered, modular architecture, which has been successfully used to rapidly develop and evaluate a variety of demanding dynamic program analyses. In this paper, we describe the SOFYA framework, the challenges it addresses, and survey several such analyses.

JVM-based Techniques for Improving Java Observability

Observability measures the support of computer systems to accurately capture, analyze, and present (collectively observe) the internal information about the systems. Observability frameworks play important roles for program understanding, troubleshooting, performance diagnosis, and optimizations. However, traditional solutions are either expensive or coarse-grained, consequently compromising their utility in accommodating today’s increasingly complex software systems. New solutions are emerging for VM-based languages due to the full control language VMs have over program executions. Existing such solutions, nonetheless, still lack flexibility, have high overhead, or provide limited context information for developing powerful dynamic analyses. In this thesis, we present a VM-based infrastructure, called marker tracing framework (MTF), to address the deficiencies in the existing solutions for providing better observability for VM-based languages. MTF serves as a solid foundation for implementing fine-grained low-overhead program instrumentation. Specifically, MTF allows analysis clients to: 1) define custom events with rich semantics ; 2) specify precisely the program locations where the events should trigger; and 3) adaptively enable/disable the instrumentation at runtime. In addition, MTF-based analysis clients are more powerful by having access to all information available to the VM. To demonstrate the utility and effectiveness of MTF, we present two analysis clients: 1) dynamic typestate analysis with adaptive online program analysis (AOPA); and 2) selective probabilistic calling context analysis (SPCC). In addition, we evaluate the runtime performance of MTF and the typestate client with the DaCapo benchmarks. The results show that: 1) MTF has acceptable runtime overhead when tracing moderate numbers of marker events; and 2) AOPA is highly effective in reducing the event frequency for the dynamic typestate analysis; and 3) language VMs can be exploited to offer greater observability.

Semantic information extraction from images of complex documents

Even though the digital processing of documents is increasingly widespread in industry, printed documents are still largely in use. In order to process electronically the contents of printed documents, information must be extracted from digital images of documents. When dealing with complex documents, in which the contents of different regions and fields can be highly heterogeneous with respect to layout, printing quality and the utilization of fonts and typing standards, the reconstruction of the contents of documents from digital images can be a difficult problem. In the present article we present an efficient solution for this problem, in which the semantic contents of fields in a complex document are extracted from a digital image.