Carlos Goulart - Academia.edu (original) (raw)

Papers by Carlos Goulart

1998 1st IEEE International Conference on ATM. ICATM'98, 1998

This paper describes a prototype implementation of a dynamic bandwidth allocation service for ATM... more This paper describes a prototype implementation of a dynamic bandwidth allocation service for ATM-based networks. The major purpose of this service is to increase resource utilization in a network supporting multimedia applications. The implementation was made using API (Application User Interface) compatible with UNI version 3.0. The implementation consists of a set of primitives and their related PDUs (Protocol Data Units). Some measurements were done using the prototype implementation in order to observe the behavior of renegotiation rejections with respect to some parameters, such as node capacity, level of reservations, number of nodes and so on. The results here shown that dynamic bandwidth allocation service can be used to increase resource utilization and, at the same time, to provide a high level of guarantee to the accepted connections.

1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136), 1998

ABSTRACT This paper presents an analysis of node behavior supporting dynamic QoS negotiation for ... more ABSTRACT This paper presents an analysis of node behavior supporting dynamic QoS negotiation for multimedia connections and using resource reservation in the RSVP protocol. Our major focus is on negotiations at intermediate nodes where resources are shared by many connections. The present scheme is intended to work together with some traffic control mechanism at the interface between service users (or providers) and the network

saída. Este software utiliza o código para o calculo das pseudodistâncias e arquivos RINEX. Os el... more saída. Este software utiliza o código para o calculo das pseudodistâncias e arquivos RINEX. Os elementos keplerianos são usados para calcular a posição do satélite e abordagem dos mínimos quadrados é usado para o posicionamento da estação terrestre. O software permite que o aprendiz veja passo a passo todo o caminho das transformações. É permitido escolher o número de satélites e a quantidade de épocas para se processar. O software usa o processamento relativo e mostra as matrizes que se formam durante as fases do ajustamento. Este artigo mostra algumas janelas e exemplo de cálculo de coordenadas. ABSTRACT This paper shows the implementation of software for using in teaching tasks. It intends to show for the apprentice all the way of calculating the position of a GPS satellite and the position of a terrestrial point. The commercial available software have not concern with the intermediate calculation of positioning by using GPS techniques, because of that the student frequently see ...

Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks - PE-WASUN '09, 2009

This work presents a modified version of Multi-Geo, an adaptive hybrid protocol for Wireless Sens... more This work presents a modified version of Multi-Geo, an adaptive hybrid protocol for Wireless Sensor Network (WSN) whose behavior is based on the network traffic in a given time. It is set to a reactive behavior when the frequency of events is low or it is set to pro-active behavior when the frequency of events increases. The main difference between

2012 31st International Conference of the Chilean Computer Science Society, 2012

ABSTRACT The reduction of cost and running time provided by new generation sequencing technologie... more ABSTRACT The reduction of cost and running time provided by new generation sequencing technologies made possible the emergence of thousands of genome projects in the last few years. On the other hand, those technologies posed important computational challenges, pushing the advance of many research fields in computer science. Particularly, the de novo DNA fragment assembly, which is a fundamental stage in genome sequencing, is a complex problem that demands complex algorithms to solve it. Here, we provide a theoretical basis for the construction of a new method for de novo fragment assembly based on k-mer graphs. Our proposal encompasses many difficulties found in such problems using a unique procedure, in contrast with current methods that use several high-cost procedures to overcome the same issues. Furthermore, our approach is highly scalable since it allows the use of parallelism, being very suitable for solutions with graphics processing unit (GPU).

Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, 2009

ATM, 1998. ICATM-98., …, 1998

… International Conference on …, 1997

This paper presents a scheme for dynamic Quality of Service (QoS) negotiation for multimedia appl... more This paper presents a scheme for dynamic Quality of Service (QoS) negotiation for multimedia applications at intermediate nodes. The major goal of dynamic negotiation (or renegotiation) is to explore dynamic behavior of multimedia connections to maximize ...

The reduction of cost and running time provided by new generation sequencing technologies made po... more The reduction of cost and running time provided by new generation sequencing technologies made possible the emergence of thousands of genome projects in the last few years. On the other hand, those technologies posed important computational challenges, pushing the advance of many research fields in computer science. Particularly, the de novo DNA fragment assembly, which is a fundamental stage in genome sequencing, is a complex problem that demands complex algorithms to solve it. Here, we provide a theoretical basis for the construction of a new method for de novo fragment assembly based on k-mer graphs. Our proposal encompasses many difficulties found in such problems using a unique procedure, in contrast with current methods that use several high-cost procedures to overcome the same issues. Furthermore, our approach is highly scalable since it allows the use of parallelism, being very suitable for solutions with graphics processing unit (GPU).

Proceedings of the II …, 2008

... method are used directly on the inserted code, in line 3. The previous refactoring allows lin... more ... method are used directly on the inserted code, in line 3. The previous refactoring allows line ... The semantic rules already defined for the Java grammar build ATerm [van den Brand et al ... the parser is executed, the result is an abstract syntax tree representing the program, in ATerm ...

This paper presents Multi-K, a modified version of the Multi protocol. This protocol uses an appr... more This paper presents Multi-K, a modified version of the Multi protocol. This protocol uses an approach of building a spanning tree of K hops, starting from the sink node and reaching each source node. When the data generation is limited to areas close to the sink node, the result is a partial spanning tree. The goal of building a partial spanning tree is to limit the number of control messages to construct and to maintain it, in order to reduce the power consumption of the network. The results showed that the proposed approach is scalable, maintains the packet delivery rate and provides a reduction in power consumption, specially in scenarios where events are concentrated in areas close to the sink node, with a reduction of up to 45%. Resumo. Este artigo apresenta o Multi-K, uma versão modificada do protocolo Multi. Esse protocolo usa uma abordagem de construir, a partir do nodo sink, uma árvore de k saltos (hops) até cada nodo fonte. Quando a geração de dados está limitada a regiões próximas ao nodo sink, obtem-se uma árvore de espalhamento parcial. O objetivo da construção da árvore parcial é limitar o número de mensagens de controle para construí-la e mantê-la reduzindo o consumo de energia da rede. Os resultados obtidos mostraram que a abordagem proposta é escalável, mantém a taxa de entrega de pacotes e consegue uma redução no consumo de energia destacando-se, principalmente, em cenários cujos eventos concentram-se em áreas próximas ao sink, com redução de até 45%.