著者

YUASA T.

出版者

一般社団法人情報処理学会

雑誌

Journal of Information Processing (ISSN:03876101)

巻号頁・発行日

vol.13, no.3, pp.284-293, 1990

被引用文献数

3

---

Kyoto Common Lisp (KCL for short) is a full implementation of the Common Lisp language. KCL is a highly portable Common Lisp system intended for several classes of machines, from workstations to main-frames. The key idea behind the portability is the use of the C language and its standard libraries as the interface to the underlying machines and operating systems: The kernel of the system is written in C and the rest of the system is written in Common Lisp. Even the compiler generates intermediate code in C. KCL is also an efficient and compact system: KCL regards the runtime efficiency of interpreted code as importar1t as the efficiency of compiled code. The small size of the KCL system makes KCL suitable for the current computer technology, such as the use of virtual memory and cache memory. This paper reports the implementation of KCL along with the design discussions to obtain a highly portable and yet efficient Lisp system.

著者

HAMADA HOZUMI

出版者

一般社団法人情報処理学会

雑誌

Journal of information processing (ISSN:03876101)

巻号頁・発行日

vol.10, no.1, pp.1-6, 1987-03-31

---

A new internal representation is proposed for real numbers. It has been named URR for Universal Representation of Real numbers. This approach is based on a bisection method which is applied to real number intervals. With this method, the point of division increases or decreases in a double exponential manner in the globalrange. The main characteristics of the method are as follows. First, overflow/underflow does not, in practice, occur. Second, since the data format does not depend on the length but on the value of the data, a transformation operation is virtually not needed between systems of long and short data. Finally, only one bit of resolution is lost compared with the fixed point form. In addition, arithmetic operations are slightly complicated compared with conventional representation, but they present no special difficulties. This new method is thus the most suitable internal form as an interface not only between computers but also between computers and digital systems which deal with real numbers or physical (scalar) values.

著者

SAITO MITSUO AIKAWA TAKESHI MATOBA TSUKASA OKAMURA MITSUYOSHI MINAGAWA KENJI ISHII TADATOSHI

出版者

一般社団法人情報処理学会

雑誌

Journal of information processing (ISSN:03876101)

巻号頁・発行日

vol.13, no.2, pp.144-149, 1990-08-25

---

The CPU of the AI processor (AIP) called IP704 was developed for Prolog and Lisp, based on RISC architecture with hardware supports. It has been proved that IP704 architecture is effective for both AI languages and general-purpose languages. An AI processor chip (IP 1704) is being developed as a direct successor of the IP704. The architecture has been modified and refined to fit onto a single chip and to improve the execution speed. Features newly developed for the IP1704 include Overlapping of the decode and register-read stages using a combination of the hardware decoder and micro-programs, and a delayed cache hit check with delayed writing. Is shown that a RISC-based processor with suitable hardware support is applicable to VLSI and also gives high performance AI languages.

著者

FENG Z. -R. TAKAOKA TADAO

出版者

一般社団法人情報処理学会

雑誌

J. of Information Proc. (ISSN:03876101)

巻号頁・発行日

vol.10, pp.173-177, 1988

被引用文献数

1

---

It is shown how to modify the Boyer-Moore string matching algorithm so that the number of characters actually inspected and the running time decrease sharply as the length of pattern gets longer.

著者

Haraguchi Kazuya Tanaka Ryoya

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:03876101)

巻号頁・発行日

vol.25, pp.730-734, 2017

---

The Building puzzle(a.k.a., the Skyscraper) is a Latin square completion-type puzzle like Sudoku,KenKen. and Futoshiki. Recently, Iwamoto and Matsui showed the NP-completeness of the decision problem version of this puzzle, which asks whether a given instance has a solution or not. We provide a stronger result in the present paper;it is still NP-complete to decide whether we can complete a single line of the grid (i.e., a l×n or an n×l subgrid)without violating the rule.

著者

REKIMOTO JUNICHI TARUMI HIROYUKI SUGAI MASARU YAMAZAKI GO IGARI KANEMITSU MORI TAKESHI SUGIYAMA TAKAHIRO UCHIYAMA ATSUKO AKIGUCHI CHUZO

出版者

一般社団法人情報処理学会

雑誌

Journal of information processing (ISSN:03876101)

巻号頁・発行日

vol.14, no.4, pp.455-462, 1992-03-15

---

As window systems become popular, there is a growing need for a Graphical User Interface (GUI) that allows users to manipulate objects on the screen directly. However, development of GUI is not an easy task. We have developed a graphical user interface constructing environment which supports editing facilities of six media types (including text, image, diagram, graph structure, table, and hierarchical structure). This system' Called Canae, is intended to be a general platform for several interactive and graphical applications. Canae provides various customization methods and an extension language for application developers to use editor parts as components of user interface. For modifying and extending these editors to accommodate to an application's needs, we use the MVC paradigm and object oriented approach in designing Canae. Application programmers can modify editor's keyboard handling and mouse handling by creating application specific Event Maps and Key Maps. Canae also provides a mechanism that enables applications to associate application's data and data in Canae. Canae is widely used for building several product-level applications. By evaluating three CASE appllcations developed with Canae, we have found that Canae reduces the amount of newly developed program codes by about 50% or more.