This report summarizes the work done at Kyoto University and the University of Melbourne for the TREC 2006 Genomics Track. The single task for this year was to retrieve passages from a biomedical document collection. ...
详细信息
This report summarizes the work done at Kyoto University and the University of Melbourne for the TREC 2006 Genomics Track. The single task for this year was to retrieve passages from a biomedical document collection. We devised a system made of two parts to deal with this problem. The first part was an existing IR system based on the vector-space model. The second part was a newly developed probabilistic word-based aspect model for identifying passages within relevant documents (or paragraphs).
This paper presents technical foundation, roadmap and initial results of the IDIOM project (Information Diffusion across Interactive Online Media). Information spreads rapidly across Web sites, Web logs and online for...
详细信息
The Capability Maturity Model (CMM) from the softwareengineering Institute has been used successfully by many organizations for software Process Improvement (SPI). Despite its great success, there exists a disconnect...
详细信息
Alias analysis is a method for extracting sets of expressions which may possibly refer to the same memory locations during program execution. Although many researchers have already proposed analysis methods for the pu...
详细信息
Alias analysis is a method for extracting sets of expressions which may possibly refer to the same memory locations during program execution. Although many researchers have already proposed analysis methods for the purpose of program optimization, difficulties still remain in applying such methods to practical softwareengineering tools in the sense of precision, extensibility and scalability. Focusing mainly on a practical use for program maintenance activities such as program debugging and understanding, we propose an alias analysis method for object-oriented programs and discuss our implementation. Using this method, we have developed a tool named JAAT. Our proposed method employs a two-phase, on-demand, and instance-based algorithm, in which intra-class analysis is done in phase 1 for whole programs and libraries, and inter-class analysis is done in phase 2 only for a user-demanded target. JAAT can analyze large programs or libraries such as JDK class library. Also, JAAT includes various features for program maintenance activities, such as GUI for displaying aliases, and an XML database for storing analysis information
The research field of Intelligent Service Robots, which has become more and more popular over the last years, covers a wide range of applications from climbing machines for cleaning large storefronts to robotic assist...
详细信息
ISBN:
(纸本)1595933751
The research field of Intelligent Service Robots, which has become more and more popular over the last years, covers a wide range of applications from climbing machines for cleaning large storefronts to robotic assistance for disabled or elderly people. When developing service robot software, it is a challenging problem to design the robot architecture by carefully considering user needs and requirements, implement robot application components based on the architecture, and integrate these components in a systematic and comprehensive way for maintainability and reusability. Furthermore, it becomes more difficult to communicate among development teams and with others when many engineers from different teams participate in developing the service robot. To solve these problems, we applied the COMET design method, which uses the industry-standard UML notation, to developing the software of an intelligent service robot for the elderly, called T-Rot, under development at center for Intelligent Robotics (CIR). In this paper, we discuss our experiences with the project in which we successfully addressed these problems and developed the autonomous navigation system of the robot with the COMET/UML method. Copyright 2006 ACM.
For a large scale of software development, there is a tremendous number of software requirements documents in a collection which may be produced for different domains by different developer teams. They may be later re...
详细信息
For a large scale of software development, there is a tremendous number of software requirements documents in a collection which may be produced for different domains by different developer teams. They may be later reused to reduce cost and time for the next development. Thus, there is a need to retrieve ones that meet user's need efficiently. This paper presents an approach for software requirements specification retrieval in a form of use case description using use case structure and similarity computation between terms of use case query and use cases in the collection. The contribution of the paper has five main points; 1) the approach for retrieving use case description is proposed, 2) the developed tool supporting the approach is presented, 3) the experiment is designed to measure effectiveness of the approach, 4) the results of the experiment are shown to compare effectiveness of the approach to that of a general approach, and finally 5) the recommended use case description query template is proposed.
In this paper, a genetic binary particle swarm optimization (GBPSO) model is proposed, and its performance is compared with the regular binary particle swarm optimizer (PSO), introduced by Kennedy and Eberhart. In the...
详细信息
In this paper, a genetic binary particle swarm optimization (GBPSO) model is proposed, and its performance is compared with the regular binary particle swarm optimizer (PSO), introduced by Kennedy and Eberhart. In the original model, the size of the swarm was fixed. In our model, we introduce birth and death operations in order to make the population very dynamic. Since birth and mortality rates change naturally with time, our model allows oscillations in the size of the population. Compared to the original PSO model, and genetic algorithms, our strategy proposes a more natural simulation of the social behavior of intelligent animals. The experimental results show that compared to original PSO, our GBPSO model can reach broader domains in the search space and converge faster in very high dimensional and complex environments.
This paper presents a new online clustering algorithm in order to improve plasticity and stability in handwritten character recognition systems. Our clustering algorithm is able to automatically determine the optimal ...
详细信息
This paper presents a new online clustering algorithm in order to improve plasticity and stability in handwritten character recognition systems. Our clustering algorithm is able to automatically determine the optimal number of clusters in the input data. An incremental learning technique similar to adaptive resonance theory (ART) is used to determine the best cluster for new data. Our technique also allows the previously learned clusters to be merged whenever the newly arrived data points push their centers close together. We also developed new features and similarity measures in order to describe and compare the shapes of handwritten digits to be used in our clustering algorithm. Results of our algorithm on clustering the shapes of the handwritten numerals from the CENPARMI isolated digit database are shown. Our method can incrementally learn new handwriting styles of digits, without forgetting the previous ones, therefore it can improve plasticity and stability
Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts, as well as indoor laboratory facilities, in-situ resource plants, power plants, and scientific/surface...
详细信息
ISBN:
(纸本)0784408300
Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts, as well as indoor laboratory facilities, in-situ resource plants, power plants, and scientific/surface mobility equipment. Transporting the materials and equipment required to build the necessary habitats would be costly and difficult. However, the use of planetary resources to produce construction materials, or even as naturally found (such as lunar regolith utilized as an outer layer for radiation shielding, or regolith in bags as wall structure), could drastically reduce the upmass for habitats. The materials chosen for the habitat walls play a direct role in protection against each of the mentioned hazards. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. For example a 3-layer habitat wall created from 20 possible materials all with varying thicknesses would have #number of layers(possible material types)∧(possible thicknesses) = 320∧inf possible solutions. Clearly, an optimization method is warranted for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces. To overcome the large search regions, a habitat wall design tool using genetic algorithms has been developed. GAs use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce, therefore transmitting their genes to the next generation. This paper focuses on finding optimal GA parameters for the habitat optimization tool. This tool is a multiobjective formulation of structural analysis, heat loss, radiation, and meteoroid protection. Some of the constraint calculations (i.e. safety factor, deflection, and heat loss) require long computation times. Even though each material has a designated thickness range, the number of different values within that range is near infinite;therefore, the searc
暂无评论