Alcione de Paiva Oliveira

Learn More
Patterns have been employed as a mechanism for reuse in several phases of software development. Analysis patterns consist of ar-tifacts for reuse during the requirements analysis and conceptual model-ing. However, they are generally, documented in a textual manner which is not precise to be treated by a computer, thus limiting the dissemination and a wider(More)
—Analysis patterns are reusable computational artifacts, aimed at the analysis stage of the process of software development. Although the analysis patterns can facilitate the work of analysts and programmers adding value through reuse of proven useful and tested ideas, the access to them is still very poor because of the way they are usually described and(More)
Design patterns describe reusable solutions to existing problems in object-oriented software development. Design patterns are mostly documented in written form in books and scientific papers, which hinders processing them via computer, their diffusion, and their broader reuse. They can also be found on the internet, though documented with little detail,(More)
A well-conceived conceptual model is essential to obtain systems that are easier to maintain. The UML class diagram is a powerful tool that can be applied at this step, but the developer has to have a clear understanding of the domain concepts in order to yield a diagram that captures the concepts and the relations of the domain. In order to verify the(More)
Volunteered Geographic Information (VGI) features a specific type of " user-generated content" that involves spatial data. Geobrowsers are environments that present spatial data dynamically and can be accessed through a compatible browser. A Geobrowser can own a collaborative Web system to collect VGI. This paper presents the ClickOnMap, a framework to(More)
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime(More)