1469013
Solution Verification in Software Design: A CBR Approach
Software design is becoming a demanding task, not only because the complexity of software systems is increasing, but also due to the pressure that development teams suffer from clients. CASE tools capable of performing more work and of having more intelligent abilities are needed, so that, they can provide more help to the designer. In this paper we describe a CASE tool capable of assisting the designer in a more intelligent way, be it by suggesting new solutions or by learning user preferences. We detail how the solutions are generated and focus on the verification process, which enables the new designs to have less errors. This verification process takes a CBR approach, which has the advantage of being personalized. We describe experimental results that show the effect of the verification process in the generated solutions.
5517190
A Model for Creativity in Creature Generation
This paper brings a proposal and general specification of a new project that aims to apply Conceptual Blending (Fauconnier and Turner 1998) as a process of creature generation in games. The project we describe is based on Divago (Pereira and Cardoso, 2003 and should be able to bring novelty among creatures that populate a game. Moreover, it is expected to extend these capabilities to other objects in a game, towards a very dynamic environment. Since this is a work in progress, we provide the first preliminary results or experimental examples and try to provide the reader with a clear image of the framework to be followed.
11245975
Experiments with free concept generation in Divago
This paper presents a set of experiments we carried out with, Divago, a system that is an attempt to implement our ideas towards a computational model of creativity. It is expected to be able to generate novel concepts out of previous knowledge. Here we show its behaviour with a large dataset constructed independently by other researchers consisting of over 170 nouns (for a project named C^3). Each noun is represented with a syntax that is equivalent to the one adopted for Divago. We apply a two step experimentation procedure, which starts by ''training'' the system with ''preferred outcomes'' and then allowing it to do free generation, constrained by the pragmatic goal of a given query. We evaluate the results and make a short discussion regarding well-defined criteria of novelty and usefulness. We also present a comparison with a similar experiment done with C^3.
18713951
Using CBR for Semantic Analysis of Software Specifications
Helping software designers in their task implies the development of tools with intelligent capabilities. One such capability is the integration of natural language understanding in CASE tools, thus improving the designer/tool communication. In this paper, we present a CBR approach for the generation of UML class diagrams from natural language text. This approach is implemented in a CASE tool, with the goal of helping the software designer create the first system model. We describe the natural language conversion module and give an overview of the tool in which it is integrated. Experimental results for retrieval and adaptation mechanisms are also presented.
9759378
Noun Sense Disambiguation with WordNet for Software Design Retrieval
Natural language understanding can be used to improve the usability of intelligent Computer Aided Software Engineering (CASE) tools. For a software designer it can be helpful in two ways: a broad range of natural language terms in the naming of software objects, attributes and methods can be used; and the system is able to understand the meaning of these terms so that it could use them in reasoning mechanisms like information retrieval. But, the problem of word sense disambiguation is an obstacle to the development of computational systems that can fully understand natural language. In order to deal with this problem, this paper presents a word sense disambiguation method and how it is integrated with a CASE tool.
15250271
Evaluation of Case-Based Maintenance Strategies in Software Design
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm can not cope with such an amount of cases. Redundancy can also be a problem, focusing retrieval alternatives in a very restricted search space. Basically, the system's performance starts to degrade with the increase of the case-base size. Case-base maintenance allows CBR systems to deal with this problem, mainly through the use of case selection criteria. In this paper we present an experimental study about several case-base maintenance policies developed till now. We adapted and implemented these policies to a CBR system for software reuse and design, testing the applicability of these policies to cases with a complex representation (combination of tree and graph representations).
10111787
Golomb Rulers: The Advantage of Evolution
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solutions and that can be considered as a realistic alternative to massive parallel approaches that need several months or years to discover high quality Golomb rulers.
16874859
Linear Logic for Meaning Assembly
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine via function application, which works well when constituent structure trees are used to guide semantic composition. However, we believe that the functional structure of Lexical-Functional Grammar is best used to provide the syntactic information necessary for constraining derivations of meaning in a cross-linguistically uniform format. It has been difficult, however, to reconcile this approach with the combination of meanings by function application. In contrast to compositional approaches, we present a deductive approach to assembling meanings, based on reasoning with constraints, which meshes well with the unordered nature of information in the functional structure. Our use of linear logic as a `glue' for assembling meanings allows for a coherent treatment of the LFG requirements of completeness and coherence as well as of modification and quantification.
13936575
Shallow Parsing with Conditional Random Fields
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling tasks in language processing, shallow parsing has received much attention, with the development of standard evaluation datasets and extensive comparison among methods. We show here how to train a conditional random field to achieve performance as good as any reported base noun-phrase chunking method on the CoNLL task, and better than any reported single model. Improved training methods based on modern optimization algorithms were critical in achieving these results. We present extensive comparisons between models and training methods that confirm and strengthen previous results on shallow parsing and training methods for maximum-entropy models.
11145016
Niching techniques: a study on the cluster geometry optimization problem
The cluster geometry optimization is one of these problems. The same cluster structure can be encoded in innumerable ways. A single translation or rotation performed in the cluster can lead to different genotypes for similar structures. A reliable similarity function can be computationally prohibitive or even impossible to define. We analyze the behavior of an alternative technique free of distance measures, the Spatially-Dispersed Genetic Algorithm [1] (sdGA), and its application on the cluster geometry optimization.
35936505
Finding Manufacturing Expertise Using Ontologies and Cooperative Agents
The new product development process, in its early phases, congregates knowledge from diverse domains and sources, spread among specialists that usually are not aware of each other’s research interests. This work presents a tool designed to make the establishment of new communities or teams easier. The tool organizes their informal vocabulary into formal domain categories, in order to correlate them, and advises its users of potential networks they could belong to. An approach based on ontologies and machine learning is used to structure and make knowledge acquisition / retrieval, together with agents that cooperate and coordinate the access to the knowledge. The tool automatically updates its knowledge base relieving the user from tasks she/he is unfamiliar with. Initial experiments demonstrated the potential of this kind of tool. A test case is being developed encompassing members of a scientific network in the manufacturing area. Results will be analyzed envisaging its broader use and application to different knowledge domains.