• Title/Summary/Keyword: state transition graph

Search Result 38, Processing Time 0.039 seconds

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

A Study on an Efficient Coding of Hangeul (효율적인 한글 코드화에 관한 연구)

  • 김경태;민용식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.6
    • /
    • pp.633-641
    • /
    • 1989
  • In this paper, we proposed an economical coding method to be applied for Hangeul character, the Korean letter, by utilizing three state transition graph. With this method, only about 3.5 biys are required in expressing a Hangeul character, which is more than 1 bit shorter than conventional codes so far introduced in order to realze extensive code compression. Hence this method will improve the rapidity and exanctitude and economy in processing Hangeul letter.

  • PDF

PHDCM : Efficient Compression of Hangul Text in Parallel (PHDCM : 병렬 컴퓨터에서 한글 텍스트의 효율적인 축약)

  • Min, Yong-Sㅑk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2E
    • /
    • pp.50-56
    • /
    • 1995
  • This paper describes an efficient coding method for Korean characters using a three-state transition graph. To our knowledge, this is the first achievement of its kind. This new method, called the Paralle Hangul Dynamic Coding Method(PHDCM), compresses about 3.5 bits per a Korean character, which is more than 1 bit shorter than the conventional codes introduced thus far to achieve extensive code compression. When we ran the method on a MasPar machine, which is on SIMD SM (EFEW-PRAM)., it achieved a 49.314-fold speedup with 64 processors having 10 million Korean characters.

  • PDF

Analysis of the Behavior of Complemented TPNCA Derived from a Linear TPNCA (선형 TPNCA로부터 얻어지는 여원 TPNCA의 행동분석)

  • 조성진;최언숙;황윤희;김한두;허성훈
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.549-555
    • /
    • 2003
  • CA is cost-effective to generate pseudorandom patterns than LFSR. Based on the effectiveness of a CA based pseudorandom pattern generator, CA have been employed successfully in several applications. Especially Nongroup CA is applied to efficient hash function generation, cryptography and image compression. In this paper we analyze the properties of TPNCA and by using basic paths in the 0-tree of a linear TPNCA we analyze the structure of the state-transition graph. Also by showing the structure of the complemented CA which have the acyclic state of the 0-tree as the complement vector is isomorphic to the structure of the original TPNCA, we reduce the time in analyzing the CA-states.

  • PDF

Construction of Global Finite State Machine from Message Sequence Charts for Testing Task Interactions (태스크 상호작용 테스팅을 위한 MSC 명세로부터의 전체 유한 상태 기계 생성)

  • Lee, Nam-Hee;Kim, Tai-Hyo;Cha, Sung-Deok;Shin, Seog-Jong;Hong, H-In-Pyo;Park, Ki-Wung
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.634-648
    • /
    • 2001
  • Message Sequence Charts(MSC) has been used to describe the interactions of numerous concurrent tasks in telecommunication software. After the MSC specification is verified in requirement analysis phase, it can be used not only to synthesize state-based design models, but also to generate test sequences. Until now, the verification is accomplished by generating global state transition graph using the location information only. In this paper, we extend the condition statement of MSC to describe the activation condition of scenarios and the change of state variables, and propose an approach to construct global finite state machine (GFSM) using this information. The GFSM only includes feasible states and transitions of the system. We can generate the test sequences using the existing FSM-based test sequence generation technology.

  • PDF

A Heuristic Approach to Scheduling Multiple Cranes for Intra-Block Remarshalling (복수 크레인을 활용한 블록 내 컨테이너 이적 계획)

  • Oh, Myung-Seob;Kang, Jae-Ho;Ryu, Kwang-Ryel;Kim, Kap-Hwan
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.413-421
    • /
    • 2005
  • Intra-block remarshalling is the task of rearranging into some target bays those containers which are scattered within around the block. If multiple transfer cranes installed in the block are all used together we may be able to complete the remarshalling task as early as possible. However, when multiple cranes are used simultaneously, there may occur significant delays if we do not carefully consider interferences between the cranes at the time of scheduling. Especially, delays caused by interferences occur more frequently in case of using non-crossing cranes. This paper presents an efficient heuristics method for assigning moves of containers to each crane and for determining an appropriate container moving order in a manner sensitive to the interferences. Simulation experiments have shown that the proposed method can effectively reduce delays in various environments.

  • PDF

A Heuristic Approach to Scheduling Multiple Cranes for Intra-Block Remarshalling (복수 크레인을 활용한 블록 내 컨테이너 이적 계획)

  • Oh Myung-Seob;Kang Jaeho;Ryu Kwang Ryel;Kim Kap Hwan
    • Journal of Navigation and Port Research
    • /
    • v.29 no.5 s.101
    • /
    • pp.447-455
    • /
    • 2005
  • Intra-block remarshalling is the task of rearranging into some target bays those containers which are scattered within around the block. If multiple transfer cranes installed in the block are all used together we may be able to complete the remarshalling task as early as possible. However, when multiple cranes are used simultaneously, there may occur significant delays if we do not carefully consider interferences between the cranes at the time of scheduling. Especially, delays caused by interferences occur more frequently in case of using non-crossing cranes. This paper presents an efficient heuristic method for assigning moves of containers to each crane and for determining an appropriate container moving order in a manner sensitive to the interferences. Simulation experiments have shown that the proposed method can effectively reduce delays in various environments.

Analysis on Psychological Self-regulation and Arousal Variation of Actors on Performance (공연 시 배우의 각성변화와 심리적 자기조절 분석)

  • Hong, Kil-Dong;Lee, Hong-Sik;Lee, Hyung-Kook;Oh, Jin-Ho;Lee, Ki-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.12
    • /
    • pp.176-189
    • /
    • 2008
  • The purpose of this study was to analyze self-regulation about changing heart rate and perceived arousal variation when actors start their performance. Object of this study were 5 actors who belong to the theater selected using the purposive sampling method. This study used a measuring instrument of heart rate to measure arousal status, used behavior observation paper to observe and record self-regulation behavior and executed personal consultation after ending performance. There was graph mad by variation transition which calculated average and standard deviation about variation of heart rate each time of performance. The results of this study were as follows. First, there were high variation of awake level that actor's heart rates were rising before starting performance and the most high level of arousal was from 20minutes to 5minutes before starting performance. Second, there were self-regulation behaviors appeared such as deep breathing, breath controling, self talking, talking with other actors, concentrating an script, going to toilet, smoking, checking closes before starting performance. Third, when performance start, actors used psychological self-regulational method such as relaxation, self concentration, confidence reinforcement, coping with state or accommodation for controling raised arousal status.