Articles
Page 4 of 8
-
Citation: Journal of the Brazilian Computer Society 2013 19:100
-
A set of novel modifications to improve algorithms from the A* family applied in mobile robotics
This paper presents a set of novel modifications that can be applied to any grid-based path planning algorithm from the A* family used in mobile robotics. Five modifications are presented regarding the way the...
Citation: Journal of the Brazilian Computer Society 2012 19:91 -
Feasible path planning for fixed-wing UAVs using seventh order Bézier curves
This study presents a novel methodology for generating smooth feasible paths for autonomous aerial vehicles in the three-dimensional space based on a variation of the Spatial Quintic Pythagorean Hodographs cur...
Citation: Journal of the Brazilian Computer Society 2012 19:93 -
Editorial
Citation: Journal of the Brazilian Computer Society 2012 18:90 -
Evaluation of parameters for combining multiple textual sources of evidence for Web image retrieval using genetic programming
Web image retrieval is a research area that is receiving a lot of attention in the last few years due to the growing availability of images on the Web. Since content-based image retrieval is still considered v...
Citation: Journal of the Brazilian Computer Society 2012 19:87 -
Automatic generation of Brazilian sign language windows for digital TV systems
Deaf people have serious difficulties accessing information. The support for sign language (their primary means of communication) is rarely addressed in information and communication technologies. Furthermore,...
Citation: Journal of the Brazilian Computer Society 2012 19:86 -
On-the-fly extraction of hierarchical object graphs
Reverse engineering techniques are usually applied to extract concrete architecture models. However, these techniques usually extract models that just reveal static architectures, such as class diagrams. On th...
Citation: Journal of the Brazilian Computer Society 2012 19:83 -
Editorial
Citation: Journal of the Brazilian Computer Society 2012 18:85 -
Reducing the impact of location errors for target tracking in wireless sensor networks
In wireless sensor networks (WSNs), target tracking algorithms usually depend on geographical information provided by localization algorithms. However, errors introduced by such algorithms affect the performan...
Citation: Journal of the Brazilian Computer Society 2012 19:84 -
A semi-automated method for acquisition of common-sense and inferentialist knowledge
This paper presents a semi-automated method for the acquisition of common-sense and inferentialist concepts in Portuguese. Its innovative feature is a module of reasoning over the pre-existing knowledge that a...
Citation: Journal of the Brazilian Computer Society 2012 19:82 -
Automatic student modeling in adaptive educational systems through probabilistic learning style combinations: a qualitative comparison between two innovative stochastic approaches
Considering learning and how to improve students’ performances, adaptive educational systems must know the way in which an individual student learns best. In this context, this work presents a comparison betwe...
Citation: Journal of the Brazilian Computer Society 2012 19:78 -
A model for inference of emotional state based on facial expressions
Non-verbal communication is of paramount importance in person-to-person interaction, as emotions are an integral part of human beings. A sociable robot should therefore display similar abilities as a way to in...
Citation: Journal of the Brazilian Computer Society 2012 19:81 -
A coherence analysis module for SciPo: providing suggestions for scientific abstracts written in Portuguese
SciPo is a writing tool whose ultimate goal is to assist novice writers in producing scientific writing in Portuguese, focusing primarily on abstracts and introductions from computer science. In this paper, we...
Citation: Journal of the Brazilian Computer Society 2012 19:79 -
Evaluation of desktop operating systems under thrashing conditions
Virtual memory mechanisms allow offering more RAM memory space to processes than the amount of memory physically available in the system, using disk space as a memory extension. When there is not enough RAM me...
Citation: Journal of the Brazilian Computer Society 2012 19:80 -
Forgetting mechanisms for scalable collaborative filtering
Collaborative filtering (CF) has been an important subject of research in the past few years. Many achievements have been made in this field, however, many challenges still need to be faced, mainly related to ...
Citation: Journal of the Brazilian Computer Society 2012 18:77 -
Erratum to: On the reliability and availability of replicated and rejuvenating systems under stealth attacks and intrusions
Citation: Journal of the Brazilian Computer Society 2012 18:74 -
TAL—Template Authoring Language
This paper presents TAL (Template Authoring Language), an authoring language for hypermedia document templates. Templates describe document families with structural or semantic similarities among them. TAL sup...
Citation: Journal of the Brazilian Computer Society 2012 18:73 -
Editorial
Citation: Journal of the Brazilian Computer Society 2012 18:76 -
Clus-DTI: improving decision-tree classification with a clustering-based decision-tree induction algorithm
Decision-tree induction is a well-known technique for assigning objects to categories in a white-box fashion. Most decision-tree induction algorithms rely on a sub-optimal greedy top-down recursive strategy fo...
Citation: Journal of the Brazilian Computer Society 2012 18:75 -
Designing tailorable software systems with the users’ participation
There are several barriers that prevent Brazilian citizen to access knowledge, including the way in which computational technology is presented considering the diversity of interaction skills in our population...
Citation: Journal of the Brazilian Computer Society 2012 18:70 -
Partially labeled data stream classification with the semi-supervised K-associated graph
Regular data classification techniques are based mainly on two strong assumptions: (1) the existence of a reasonably large labeled set of data to be used in training; and (2) future input data instances confor...
Citation: Journal of the Brazilian Computer Society 2012 18:72 -
Space D*
This paper describes a new method of path-planning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is an incremental graph search algorithm, ...
Citation: Journal of the Brazilian Computer Society 2012 18:71 -
Analyzing the scalability of coordination requirements of a distributed software project
Collaborative tools have been proposed to support different domains, including software development. Despite important previous work on the design of collaborative tools, none directly addresses the required s...
Citation: Journal of the Brazilian Computer Society 2012 18:67 -
D-Confidence: an active learning strategy to reduce label disclosure complexity in the presence of imbalanced class distributions
In some classification tasks, such as those related to the automatic building and maintenance of text corpora, it is expensive to obtain labeled instances to train a classifier. In such circumstances it is com...
Citation: Journal of the Brazilian Computer Society 2012 18:69 -
Graph theory and algorithms
Citation: Journal of the Brazilian Computer Society 2012 18:68 -
Optimal pagination and content mapping for customized magazines
Traditional media such as magazines and newspapers are undergoing deep transformations as they cope with the high volume and dynamicity of currently available information. In addition, with the emergence of de...
Citation: Journal of the Brazilian Computer Society 2012 18:66 -
On the reliability and availability of replicated and rejuvenating systems under stealth attacks and intrusions
This paper considers the estimation of reliability and availability of intrusion-tolerant systems subject to non-detectable intrusions caused by stealth attacks. We observe that typical intrusion tolerance tec...
Citation: Journal of the Brazilian Computer Society 2012 18:62 -
Non-photorealistic neural sketching
We present and evaluate a neural network-based technique to automatically enable NPR renderings from digital face images, which resemble semi-detailed sketches. The technique has been experimentally evaluated ...
Citation: Journal of the Brazilian Computer Society 2012 18:61 -
Sandwich problems on orientations
The graph sandwich problem for property Π is defined as follows: Given two graphs G1=(V,E1) and G2=(V,E2) such that E1⊆E2, is there a graph G=(V,E) such that E1⊆E⊆E2 which satisfies property Π? We propose to stud...
Citation: Journal of the Brazilian Computer Society 2012 18:65 -
Gene clusters as intersections of powers of paths
There are various definitions of a gene cluster determined by two genomes and methods for finding these clusters. However, there is little work on characterizing configurations of genes that are eligible to be...
Citation: Journal of the Brazilian Computer Society 2012 18:64 -
b-Coloring graphs with large girth
A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has a neighbor in all other classes. The b-chromatic number of a graph is the largest integer k such that t...
Citation: Journal of the Brazilian Computer Society 2012 18:63 -
Message from the special issue editors
Citation: Journal of the Brazilian Computer Society 2012 18:56 -
Energy-aware test connection assignment for the self-diagnosis of a wireless sensor network
Sensor nodes in Wireless Sensor Networks (WSNs) are prone to failures due to the fragile hardware, malicious attacks, or hostile or harsh environment. In order to assure reliable, long-term monitoring of the phen...
Citation: Journal of the Brazilian Computer Society 2012 18:57 -
Byzantine fault-tolerant deferred update replication
Replication is a well-established approach to increasing database availability. Many database replication protocols have been proposed for the crash-stop failure model, in which servers fail silently. Fewer da...
Citation: Journal of the Brazilian Computer Society 2012 18:60 -
An exception handling system for service component architectures
The Service Component Architecture (SCA) makes it possible to combine existing and new services based on a variety of technologies with components built using a component-based development approach. However, w...
Citation: Journal of the Brazilian Computer Society 2012 18:59 -
Timing analysis of leader-based and decentralized Byzantine consensus algorithms
We consider the Byzantine consensus problem in a partially synchronous system with strong validity. For this problem, two main algorithms—with different resilience—are described in the literature. These two al...
Citation: Journal of the Brazilian Computer Society 2012 18:58 -
An approach to enrich users’ personomy using the recommendation of semantic tags
Tagging-based systems are a popular and convenient way to organize information on the Web. Despite the alleged advantage of the free choice of words used to categorize Web resources in this kind of systems, it...
Citation: Journal of the Brazilian Computer Society 2012 18:55 -
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science
This is an account of Jayme’s contributions to graph theory and computer science. Due to restrictions in length, it is not possible to provide an in-depth coverage of every aspect of Jayme’s extensive scientif...
Citation: Journal of the Brazilian Computer Society 2012 18:54 -
Sentiment-based influence detection on Twitter
The user generated content available in online communities is easy to create and consume. Lately, it also became strategically important to companies interested in obtaining population feedback on products, me...
Citation: Journal of the Brazilian Computer Society 2011 18:51 -
Branch and bound algorithms for the maximum clique problem under a unified framework
In this paper we review branch and bound-based algorithms proposed for the exact solution of the maximum clique problem and describe them under a unifying conceptual framework. As a proof of concept, we actual...
Citation: Journal of the Brazilian Computer Society 2011 18:50 -
On clique-colouring of graphs with few P4’s
Let G=(V,E) be a graph with n vertices. A clique-colouring of a graph is a colouring of its vertices such that no maximal clique of size at least two is monocoloured. A k-clique-colouring is a clique-colouring th...
Citation: Journal of the Brazilian Computer Society 2011 18:53 -
Package level cohesion measurement in object-oriented software
Packages are re-usable components for most of object-oriented systems. To promote reuse in object-oriented systems and to make deployment and maintenance tasks easy, packages in object-oriented systems must be...
Citation: Journal of the Brazilian Computer Society 2011 18:52 -
Selective local texture features based face recognition with single sample per class
Local appearance-based methods have been successfully applied to face recognition and achieved state-of-the-art performance. In this paper we propose a local selective feature extraction approach based on Gabo...
Citation: Journal of the Brazilian Computer Society 2011 18:49 -
The interval count of interval graphs and orders: a short survey
The interval count problem determines the smallest number of interval lengths needed in order to represent an interval model of a given interval graph or interval order. Despite the large number of studies about ...
Citation: Journal of the Brazilian Computer Society 2011 18:47 -
Determining what sets of trees can be the clique trees of a chordal graph
Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related p...
Citation: Journal of the Brazilian Computer Society 2011 18:48 -
On the classification problem for split graphs
The Classification Problem is the problem of deciding whether a simple graph has chromatic index equal to Δ or Δ+1. In the first case, the graphs are called Class 1, otherwise, they are Class 2. A split graph is ...
Citation: Journal of the Brazilian Computer Society 2011 18:46 -
Editorial
Citation: Journal of the Brazilian Computer Society 2011 17:45 -
An ontological gazetteer and its application for place name disambiguation in text
The volume of spatial information on the Web grows daily, both in the form of online maps and as references to places embedded in documents and pages. Considering the spatial information needs of users, it is ...
Citation: Journal of the Brazilian Computer Society 2011 17:44 -
Ranking in collaboration networks using a group based metric
Collaboration networks are social networks in which relationships represent some kind of professional collaboration. The study of collaboration networks can help identify individuals or groups that are importa...
Citation: Journal of the Brazilian Computer Society 2011 17:41 -
Complexity separating classes for edge-colouring and total-colouring
The class of unichord-free graphs was recently investigated in a series of papers (Machado et al. in Theor. Comput. Sci. 411:1221–1234, 2010; Machado, de Figueiredo in Discrete Appl. Math. 159:1851–1864, 2011; Tr...
Citation: Journal of the Brazilian Computer Society 2011 17:40