著者
ビンステッド キム 滝澤 修
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.13, no.6, pp.920-927, 1998-11-01
被引用文献数
8

We have implemented a simple model of puns in a program (BOKE) which generates puns in Japanese, using linguistic information from a general-purpose lexicon. Our rough evaluation indicates that the puns generated by the program are of comparable quality to those generated by humans. BOKE differs from an earlier English-language system (JAPE) only in the lexicon and the templates used to generate the surface text-the punning mechanisms are the same. This suggests that our model of puns is language independent.
著者
ティヘリノ A. ジュリ 池田 満 北橋 忠宏 溝口 理一郎
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.8, no.4, pp.476-487, 1993-07-01
被引用文献数
31

The main aim of this research is to establish a sophisticated methodology for building expert systems based on shared and reusable large knowledge bases. Multis, one of the major Conponents of the methodology, performs task analysis interview and synthesizes problem solving engines for a given task. To design Multis the authors identify libraries of task ontology and reusable software artifacts for construction of knowledge-based systems and make them available for Synthesis via direct-interactive mapping to task models. This library consists of a set of highly generalized software primitives abstracted from existing knowledge-based systems. The mapping to the target task model is accomplished through an intermediate step in which task performers identify the correspondence of the software primitives to their own task ontology. The task ontology itself is created with the use of non-functional task primitives in the form of generic vocabulary, i. e. a vocabulary that is dependent on the task, but not the domain of expertise. The vocabulary combines into verb/noun phrases forming generic processes which are generalized conceptual primitives for a given task. In this paper one such library of software artifacts is presented for the task of scheduling (eg. classroom scheduling for an educational institution) along with the corresponding generic vocabulary and generic process library.
著者
片寄 晴弘 今井 正和 井口 征士
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.3, no.6, pp.748-754, 1988-11-20
被引用文献数
17

The target in computer has been changing from the numerical forms to the symbolic forms, which we human-being are more familiar with. Recently A. I. is studied as the central technique of computer science. In the near future Artificial Sense is thought to be studied as what follows A. I. This paper describes "Listening to the music", as an approach to Artificial Sense. When we have an end to simulate human-like process, signal processing and knowledge processing have to be concatenated. In this paper, the process "Listening to the music" is considered from three major stages ; transcription, analyzing music and understanding music. In the stage of transcription, the notes are extracted as symbol from acoustic signal. In the stage of analyzing music, the structures as melody, rhythm, chord progression are analyzed from the extracted symbol of the notes. In the stage of understanding music, the sentiments are extracted by the rules which describe the relation between the sentiment and the structure extracted in analyzing stage. This paper presents how machine gets the sentiments listening to the music performance.
著者
佐藤 浩 小野 功 小林 重信
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.12, no.5, pp.734-744, 1997-09-01
被引用文献数
211

When Genetic Algorithms (GAs) are applied to optimization problems, characteristic preserving in designing coding/crossover and diversity maintaining in designing generation alternation are important. Generation alternation models are independent of problems, while coding/crossover depends on problems. We discuss generation alternation models in this paper. Simple GA is one of the well-known generation alternation models, however it has two problems. One is early convergence in the first stage of search and the other is evolutionary stagnation in the last stage of it. Many improvements and new models have been presented to overcome the above problems. In this paper, we propose a new generation alternation model called minimal generation gap (MGG) which has all advantages of conventional models. As generation alternation models use only information of fitness, alternation of generations can be regarded as a transformation of fitness distributions. We propose a new method of assessing generation alternation models. We measure the ability of avoiding the early convergence and suppressing the evolutionary stagnation by the dynamics of the best value and variance of fitness distributions. From the results of some experiments, we found that MGG is the most desirable model which can avoid the early convergence and suppress the evolutionary stagnation. We also show the efficiency of MGG by applying it to benchmarks in different two domains: function optimization and traveling salesman problems. In the both domains, MGG showed higher performance than the other conventional models especially under small population size.
著者
永田 裕一 小林 重信
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.14, no.5, pp.848-859, 1999-09-01
被引用文献数
21

In this paper, we propose a new crossover named Edge Assembly Crossover(EAX) for the Traveling Salesman Problern. EAX constructs intermediate individuals by assembling only edges of parents under the assignment relaxation that is one of TSP relaxations, and then modifies them into complete ones to satisfy the original constraint of TSP. EAX has two features. One is that EAX is excellent in chartacteristic preservation in view of preserving edges from parents to children. The other is that EAX can generate a wide variety of children from a pair of parents. We show by experiments that EAX generates new soltution candidates under a suitable trade-off between characteristic preservation and a variety of children, which brings better performance than other crossovers do. Finally, we show that EAX realizes global neighborhood search by comparing EAX with the traditional local search operators for TSP.