Dadet PRAMADIHANTO Yoshio IWAI Masahiko YACHIDA
In this paper we propose an integration of face identification and facial expression recognition. A face is modeled as a graph where the nodes represent facial feature points. This model is used for automatic face and facial feature point detection, and facial feature points tracked by applying flexible feature matching. Face identification is performed by comparing the graphs representing the input face image with individual face models. Facial expression is modeled by finding the relationship between the motion of facial feature points and expression change. Individual and average expression models are generated and then used to identify facial expressions under appropriate categories and the degree of expression changes. The expression model used for facial expression recognition is chosen by the results of face identification.
Hiroyuki NAKASE Yosuke IIZUKA Suguru KAMEDA Shuichi TOMABECHI Atsushi KOMURO Kazuo TSUBOUCHI
We have proposed the packet SS-CDMA scheme for downlink of SS-CDMA flexible wireless cellular network. Transmission packet is framed with synchronization block with 11 chip Barker code and information block with orthogonal spreading code. The chip synchronization is carried out using short code surface acoustic wave (SAW) matched filter. The code de-spreading is carried out using in-line de-spreader. Multi-channel downlink of 63 channels can be designed using orthogonal m-sequence. Simulation results show more than 15 channels without degradation from theoretical value can be used under multi-path environment. The packet SS-CDMA modem has been implemented using a 2.4 GHz front-end SAW matched filter. Degradation of Eb/N0 of less than 0.5 dB is experimentally achieved with four-channel multiplex.
Jeu-Yih JENG Yi-Bing LIN Herman Chung-Hwa RAO
In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We define satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.
Boon Keat TAN Toru OGAWA Ryuji YOSHIMURA Kenji TANIGUCHI
This paper describes a new architecture-based DSP processor, which consists of n n mesh multiprocessor for digital signal processing. A prototype chip, RCDSP9701 has been designed and implemented using a CMOS 0. 6 µm process. This architecture has better performance compare to the traditional microprocessor solution to Digital Signal Processing. The proposed method poses remarkable flexibility compare to ASIC (Application Specified Integrated Circuits) approach for Digital Signal Processing applications. In addition, the proposed architecture is fault tolerant and suitable for parallel computing applications. In this paper, an implementation into a silicon chip of the new architecture is presented to give a better understanding of our work.
Bhed Bahadur BISTA Kaoru TAKAHASHI Tetsuo KINOSHITA Norio SHIRATORI
Users of computer communication systems and their requirements are rapidly increasing and changing. It is desirable to have a development method which helps to make small changes in a design of a system to obtain another system which satisfies new requirement changes. We propose a flexible synthesis method which adopts designers' requirement changes in formal protocol specifications designed in LOTOS.
Masanao KOBAYASHI Hitoshi SASAKI Makoto TAKEYA
For two decades, our colleagues and we have been developing our multiple learning environments in mathematical education for upper secondary school learners, and have been reporting our learner-centered system in the latest four WCCE Conferences (WCCE/1981/1985/1990/1995). In our latest learning multimedia system, individual learners have to meet a complex network structure in which objectives are arranged in the form of non-linear linking and to proceed actively to their own goals. In order to support their exploring learning, we developed several instructional navigation tools from an instructional view point. This paper presents our instructional navigation technology and its tools. The feature of our present system is to provide a supportive environment where individual learners can set up their own goals, create their own paths for their goals through instructional materials, and construct their own instructional structure based on instructional strategies. This feature is remarkably different from a traditional CAI system in which learners are only directed through the courseware via a linear selection of menus. Also this feature fundamentally differs from general navigation technologies by which a user is able to traverse a series of nodes among non-linear network structure, because our navigation must present individual learners with some easily learnable sequences of objectives based on their object and interest. For this purpose, this system has three chracteristic technologies, i.e. focusing, sequencing and clustering ones. These are very useful for them to make their decisions in order to reach their own goals. This paper consists of (1) ideas of instructional navigation, (2) map technology and (3) navigation technology.
Akio NISHIKAWA Kenji SATOU Emiko FURUICHI Satoru KUHARA Kazuo USHIJIMA
Scientific database systems for the analysis of genes and proteins are becoming very important these days. We have developed a deductive database system PACADE for analyzing the three dimensional and secondary structures of proteins. In this paper, we describe the statistical data classification component of PACADE. We implemented the component for cluster analysis and discrimination analysis. In addition, we enhanced the aggregation function in order to calculate the characteristic values which are useful for data classification. By using the cluster analysis function, the proteins are thereby classified into different types of structural characteristics. The results of these structural analysis experiments are also described in this paper.
Yoshio NIKAWA Masahiro YAMAMOTO
A light, thin and flexible applicator using a microstrip patch array for microwave heating is presented and tested in this work. The applicator is made of a flat silicone rubber bag, inside of which flows cooling water. EM coupling feeding is applied, which has no direct contact between the feed and the patch, to improve durability and reliability when it is repeatedly applied to the uneven surface of the heated portion of the human body. Simulations of SAR distribution are performed using the finite difference time domain (FD-TD) method. Simulated data are compared with the experimental ones using cubic and cylindrical phantom models with single and multielement patch applicators. Simulations of temperature distribution are also performed using the heat transfer equation. Simulated data are compared with the experimental ones using cubic and cylindrical phantom models. The simulated results agree well with the experimental ones. The results obtained here show that the multielement flexible microstrip patch applicator which operates at 430MHz can heat a relatively shallow and widespread area on the human body for hyperthermia treatments.
Norio SHIRATORI Kenji SUGAWARA Tetsuo KINOSHITA Goutam CHAKRABORTY
The concept of flexible system is long being used by many researchers, aiming to solve some particular problem of adaptation. The problem is viewed differently in different situations. In this paper, we first give a set of definitions and specifications to generalize this concept applicable to any system and in particular to communication networks. Through these definitions we will formalize, what are the conditions a system should satisfy to be called as a Flexible Communication System. The rest of the paper we formalize the concepts of flexible information network, and propose an agent oriented architecture that can realize it.
Masato MATSUO Yoshitsugu KONDO
We are developing GENESIS, a new seamless total environment for designing, developing, installing, and operating various types of telecommunication networks as extremely large distributed processing applications in the future network integrated by ATM. Similar uniform architectures for quick introduction and easy management of service or operation applications have been proposed, such as by TINA, but there has been insufficient study on how to operate and con figure those applications. This paper discusses the implementation model and execution environment in GENESIS from the viewpoint of flexible operation according to network conditions. The implementation model can describe detailed configurations under various conditions on design or operation, independently of the execution environment. To achieve the goals of GENESIS, our execution environment provides message handling functions and a transparent interface for controlling network resources independently of the configuration, and dynamic reconfiguration functions that are independent of the execution. This paper also reports the prototype system GENESIS-1. The GENESIS-1 message handling mechanism and the effect of the reconfiguration functions are described.
Yoichi NAGAO Hideaki OHTA Hironobu URABE Sadatoshi KUMAGAI
This paper describes a programming system, K-NET for the development of control software for flexible manufacturing systems composed of robots, numerically-controlled machines, transfer machines and automatic storage/retrieval systems. K-NET is based on a high-level Petri net which makes it simple to express operational functions such as synchronization, interlock and concurrence in sequence control. Petri net in K-NET is colored one in which tokens have attributes, and timed one which can provide a notion of stochastic time. K-NET provides many kinds of boxes having specific functions, and gates specified the firing condition and the token flow control with IF-THEN rules. On the other hand, procedural language can be also used for information processing. K-NET can support all development stages including general design, detailed design, programming and testing. K-NET has an editor to input control specifications expressed with Petri net; a simulator to verify edited specifications; a generator to convert the net to C source programs for a computer or to ladder diagrams for a programmable controller; a reporter to print control specifications; and a monitor to display controller status in real-time. K-NET has been used in the development of control software for an automated guided vehicle system, and results show a 2/3rds cost-saving over development with conventional methods in which only procedural language is used.