KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/kmitl/1

Browse

Settings

Access type: UnknownAuthor: search.filters.author.Shiratori, Norio

Search Results

Now showing 1 - 6 of 6
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Provision of Thai herbal recommendation based on an ontology
    (2010-08-23)
    Kato, Takumi
    ;
    Maneerat, Noppadol
    ;
    Varakulsiripunth, Ruttikorn
    ;
    Izumi, Satoru
    ;
    Takahashi, Hideyuki
    In Thailand, most of people like to use Thai herbs for their traditional medical treatments. However, since there are various sorts of Thai herbs, and the Thai herbal knowledge is complicated, it is difficult to find an appropriate one for each health condition. In order to help people to find suitable Thai herbs to cure the diseases, we have developed a system to provide herbal recommendations to users regarding their symptoms. In the development, we represented the Thai herbal knowledge in an ontology, and extracted new facts based on the ontology. Finally, the system provides appropriate herbal recommendations to users based on extracted facts and the ontology. This paper shows how we represented Thai herbal knowledge in an ontology, and how we extract the new facts based on the ontology, as well as how the system provides herbal recommendations to users. © 2010 IEEE.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Performance analysis on the controllable Slotted DS-CDMA with an allocating buffer for collided traffic
    (2005-01-01)
    Asavaruk, Seri
    ;
    Sittichivapak, Suvepon
    ;
    Varakulsiripunth, Ruttikorn
    ;
    Kato, Yasushi
    ;
    Shiratori, Norio
    This paper presents an analysis of the Slotted DS-CDMA system with modified node components in order to construct a load control structure in which the service rates of each node can be dynamically adapted without using feedback information. In contrast to the traditional Slotted DS-CDMA which is widely represented with single queue, prior emphasis of the approach is laid on the usage of an additional queue which is applied to manage the collided packet traffic while its queue size is also used as a load control parameter. Semi-Markov process is applied to describe the statistic behavior of the system in steady state. Trade-offs between two major performance parameters, i.e., delay and throughput, are presented and compared with those of the traditional system. Results obtained from the simulation and numerical analysis using queuing concept are compared. With these results, an advantage performance for group packets is shown, and we finally extend the concept based on the obtained results to describe a simple algorithm using one way control message as the tool to alleviate the stability problem. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.
      1
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Composition of service and protocol specifications in asynchronous communication system
    (2004-01-01)
    Maneerat, Noppadol
    ;
    Varakulsiripunth, Ruttikorn
    ;
    Bista, Bhed Bahadur
    ;
    Takahashi, Kaoru
    ;
    Kato, Yasushi
    One of the important techniques in communication system design is the composition of service and protocol specifications. In this paper, we have presented a new approach to the composition technique based on the weak bisimulation concept The main objective is to combine service specifications and protocol specifications individually and simultaneously. The composition technique can maintain the equivalence between the composed service and protocol specifications. LOTOS language terms are utilized to describe the communication specifications. The application on the asynchronous model is presented. Moreover, a support system of the composition technique is developed and presented in this paper.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Dynamic multicast routing in advance resource reservation environment
    (2000-01-01)
    Pornavalai, Chotipat
    ;
    Chakraborty, Debasish
    ;
    Chakraborty, Goutam
    ;
    Shiratori, Norio
    Since usually the network resource is limited, the abilities to do resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial re-routing of multicast tree for dynamic multicast groups can optimize the tree cost to some extent but they are complex. Furthermore, optimal multicast routing has been proved to be an NP-complete problem. In this paper, we propose an efficient dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in advance resource reservation environment, where information about the resource reservation (i.e. leaving times of participants at the time of joining) are available. The efficiency of our algorithm over other existing algorithms is shown by various simulation results.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Optimal routing for dynamic multipoint connection
    (1999-01-01)
    Chakraborty, Debasish
    ;
    Shiratori, Norio
    ;
    Chakraborty, Goutam
    ;
    Pornavalai, Chotipat
    Multimedia applications are becoming increasingly important as networks arc now capable to carry continuous media traffic, such as voice and video, to the end user. Most of the multimedia applications need multicast support too. In dynamic multicasting, destination nodes can join and leave the group during the communication period. Total or partial rerouting can optimize the tree cost to some extent. But rerouting for optimization is complex as cell-ordering at ATM switches has to be preserved. Optimum Steiner tree is NP-complete and therefore the present problem too. We propose a heuristic centralized routing algorithm, which optimize the total cost of the Steiner tree over the whole session period, where information about the joining and leaving of participants are available, at the time s/he actually joins. With this algorithm, the average hop-length from source to destination has also reduced considerably. The efficiency of our algorithm and comparison with other proposed algorithms is shown by various simulation results.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A congestion-control policy on the Internetwork gateway
    (1986-01-01)
    Varakulsiripunth, Ruttikorn
    ;
    Shiratori, Norio
    ;
    Noguchi, Shoichi
    A new approach to congestion-control policy for the interconnected networks system, called "FCP", is proposed. The main purpose of the FCP policy is to avoid the congestion of a network as well as to guarantee the performance of each network up to the desired value. In FCP policy, the traffic that arrives at aateway is restricted by that gateway in compliance with the acceptable rate, called "PAR", corresponding to its destination network. And the PAR corresponding to a network is determined based on the performance requirement of that network. The determination of PAR in FCP policy is presented and analyzed quantitatively in terms of network throughput, whereby the queuing models for a gateway and a network are developed. The result of the analytical evaluation of FCP policy is reduced to the problem of solving simultaneous non-linear equations with several variables and of a higher degree. Therefore, the systematic algorithm for computing PARs in FCP policy is also given. The numerical applications demonstrate the good efficiency of FCP policy to achieve the desired performance for each network. © 1986.