Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
Volume 5, Issue 2
Displaying 1-8 of 8 articles from this issue
  • Mitsuaki YAMAMOTO, Ken SUZUKI, Kazuhiro NAKAMURA, Mitsuyuki NAKAO, Nor ...
    1999 Volume 5 Issue 2 Pages 99-108
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    EEG activities in the higher frequency range rather than the conventionally used was hypothesized to be more directly related to neurogenic activities which are expected to construct EEG activities. According to this hypothesis, EEG activities up to 90 Hz were measured and analyzed during REM sleep. REM sleep is considered to be only a physiological state which allows one to measure the high frequency EEG activities without contamination of EMG due to muscle atonia except for twitches. The study found that the rhythmic activities with different frequencies randomly appeared one after another in the frequency range up to at least 90 Hz. This result suggests that the rivalry among small neural assemblies activated synchronously is realized during REM sleep, which might be understood within our hypothesized framework of disinhibition and activation associated with REM sleep. In addition, the extremely wide bandwidth of 500 Hz analyzed here disclosed the phasic potentials related to the rapid eye movements which had the consistent topographic pattern, i.e., frontal positive and occipital negative, which suggests the dipole located deep in the brain. This phasic event may be related to a neurogenic potential generating ponto-geniculo-occipital (PGO) wave observed in cats during REM sleep. Therefore, our finding potentially discloses novel aspects of human neurophysiology.
    Download PDF (1792K)
  • Masanori HARIYAMA, Michitaka KAMEYAMA
    1999 Volume 5 Issue 2 Pages 109-116
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    High-speed collision detection plays an essential role in a collision warning system for highly-safe vehicles. In collision detection, high computational power is required to perform matching operation between discrete points of obstacles and a vehicle. This paper presents design of a collision detection VLSI processor using content-addressable memories (CAMs) for parallel matching operation. The VLSI processor consists of identical CAMs and processing elements (PEs) for coordinate transformation. If they are fully utilized and the fixed computation time of the VLSI processor is given as a constraint, area minimization of the VLSI processor is attributed to minimization of the area-time product of the CAM and the PE. To reduce the area-time product of the CAM, a multiport CAM (MCAM) is proposed. Each word stored in the MCAM is shared between multiple matching units so that matching operation can be performed in parallel with multiple input words without increasing memory capacity. It is shown that the area of the VLSI processor using 4-port CAMs can be reduced to 43% in comparison with the area of the VLSI processor without them under a time constraint.
    Download PDF (1262K)
  • Yuuki ITO, Hikaru INOOKA
    1999 Volume 5 Issue 2 Pages 117-124
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    In this paper, we discuss simultaneous swinging-up of two pendulums by manual control.The single control input is applied to two pendulums with different physical parameters.Since the control task is very difficult , we propose a manual control system with computer assistance. The dynamic behavior of the two pendulums is simulated by a digital computer and its animation is shown on a CRT display. The computer generates appropriate signals to assist the human operator and the human operator manipulates the pendulum motions while watching the display.We show that successful experimental results can be obtained by using the proposed manual control system.
    Download PDF (708K)
  • Yumiko KAWAGUCHI, Yoshiya SUZUKI
    1999 Volume 5 Issue 2 Pages 125-148
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    In this paper, we shall introduce some operators that are associated with the generalized Jackson’s operators, and determine the saturation classes and orders in approximation of functions by those operators.
    Download PDF (1235K)
  • Takao OSAKI
    1999 Volume 5 Issue 2 Pages 149-155
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    In this paper, we define two reductions of finite topological spaces. Our reductions are the processes to decrease the number of points of a finite topological space without changing the homotopy groups of the space. Indeed, there is a weak homotopy equivalence from the original space to its reduction.
    Download PDF (884K)
  • Jinsong TAN
    1999 Volume 5 Issue 2 Pages 157-159
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    In this paper, the spectrum of the Neumann Laplacian for a graph with boundary is studied. Two comparison theorems of the Neumann Laplacian for a graph are shown. Namely, the optimal upper and lower bounds of the first eigenvalue of the Neumann boundary problem of the combinatorial Laplacian for a graph with boundary are given.
    Download PDF (313K)
  • Toru AIBA, Jeremy SIMMONS, Kyoji OIDE
    1999 Volume 5 Issue 2 Pages 161-168
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    Recently there has been a spate of projects which have released classical Sanskrit and Tibetan E-texts. There appears, however, to have been little or no collaboration between each project and this has resulted in a growing number of transliteration schemes. In this paper we describe these schemes and their differences and propose a method by which they can be distinguished automatically.
      We begin by separating the various transliteration schemes and then extract from them various features through which identification becomes possible. With Sanskrit, it turns out to be extremely difficult to identify all the schemes by this method alone. In consequence we rely on sandhi, a sound phenomenon in Sanskrit to increase the probability of identification. This foundation can form the basis for software identification of the various styles of E-text.
    Download PDF (912K)
  • Shungo KANAZAWA
    1999 Volume 5 Issue 2 Pages 169-180
    Published: 1999
    Released on J-STAGE: June 11, 2003
    JOURNAL FREE ACCESS
    In this paper we will investigate the issue of the semantic restrictions on some constructions which contain a predicative adjective. In previous studies, most linguists have made use of the notion of stage-level vs. individual-level for explicating semantic properties of the constructions. However, this notion fails to take care of exceptional cases and leaves many problems unsolved, being inappropriate for limiting the occurrence of adjectives in the constructions. As an alternative analysis, we propose an idea that every adjective has a semantic property which potentially indicate a prominent point in time, i.e., Turning Point. By considering the type of Turning Point together with the meaning inherent to each construction, we argue that the semantic restrictions on the constructions are properly predicted and motivated with full generality.
    Download PDF (2042K)
feedback
Top