• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.643-650
• /
• 2004

Control flow graph is used for Performing many Program-analysis techniques, such as data-flow and control-dependence analysis, and software-engineering techniques, such as program slicing and testings. For these analyses to be safe and useful, the CFG should incorporate the exception flows that are induced by exceptions. In previous research to construct control flow graph, normal flows and exception flows are computed at the same time, since these two flows are known to be mutually dependent. By investigating realistic Java programs, we found that the cases when these two flows are mutually dependent rarely happen. So, we can decouple exception flow analysis from normal flow analysis. In this paper we propose an analysis that estimates exception flows. We also propose exception flow graph to represent exception flows. And we show that the control flow graph that accounts for exception flows can be constructed by merging exception flow graph onto normal control flow graph.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.6
• /
• pp.62-70
• /
• 2000

In usual language models(LMs), the probability has been estimated by selecting highly frequent words from a large text side database. However, in case of adopting LMs in a specific task, it is unnecessary to using the general method; constructing it from a large size tent, considering the various kinds of cost. In this paper, we propose a construction method of LMs using a small size text database in order to be used in specific tasks. The proposed method is efficient in increasing the low frequent words by applying same sentences iteratively, for it will robust the occurrence probability of words as well. We carried out continuous speech recognition(CSR) experiments on 200 sentences uttered by 3 speakers using LMs by iterative teaming(IL) in a air flight reservation task. The results indicated that the performance of CSR, using an IL applied LMs, shows an 20.4% increased recognition accuracy compared to those without it. This system, using the IL method, also shows an average of 13.4% higher recognition accuracy than the previous one, which uses context-free grammar(CFG), implying the effectiveness of it.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.795-807
• /
• 2005

The classical approaches for computing Live Variable Analysis(LVA) use iterative algorithms across the entire programs based on the Data Flow Analysis framework. In case of Zephyr compiler, average execution time of LVA takes $7\%$ of the compilation time for the benchmark programs. The classical LVA algorithm has many aspects for improvement. The iterative algorithm for LVA scans useless basic blocks and calculates large sets of variables repeatedly. We propose the improvement of Iterative algorithm for LVA based on used variables' upward movement. Our algorithm produces the same result as the previous iterative algorithm. It is based on use-def chain. Reordering of applying the flow equation in DFA reduces the number of visiting basic blocks and redundant flow equation executions, which improves overall processing time. Experimental results say that our algorithm ran reduce $36.4\%\;of\;LVA\;execution\;time\;and\;2.6\%$ of overall computation time in Zephyr compiler with benchmark programs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.131-142
• /
• 1994

This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terns, parameterized by the scalar factors ${\alpha}1,\;and\;{\alpha}2$. The analysis of concergence leads to eigenvalues of the transition matrix for the mean filter coefficient vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexity of the QFG algorithm is compared with those of the conventional LMS. sign, and LFG algorithm. The properties of convergence in the mean square error is derived and the neccessary condition for the CFG algorithm to be stable is attaned. In the computer simulation a channel equalization is utilized to demonstrate the performance feature of the QFG algorithm. The QFG algorithm has the more computational complexities but the faster convergence speed than LMS and LFG algorithm. Since the QFG algorithm has smoother convergence, it may be useful in case where error bursting is a problem.

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.363-370
• /
• 2018

Ransomware detection has become a hot topic in computer security for protecting digital contents. Unfortunately, current signature-based and static detection models are often easily evadable by compress, and encryption. For overcoming the lack of these detection approach, we have proposed the dynamic ransomware detection system using data mining techniques such as RF, SVM, SL and NB algorithms. We monitor the actual behaviors of software to generate API calls flow graphs. Thereafter, data normalization and feature selection were applied to select informative features. We improved this analysis process. Finally, the data mining algorithms were used for building the detection model for judging whether the software is benign software or ransomware. We conduct our experiment using more suitable real ransomware samples. and it's results show that our proposed system can be more effective to improve the performance for ransomware detection.

• Polymer(Korea)
• /
• v.35 no.3
• /
• pp.244-248
• /
• 2011

Poly(2,6-dimethyl-1,4-phenylene ether) (PPE) was synthesized by oxidative polymerization using various Cu(I)-amine catalyst system. The effects of catalyst/monomer ratio, different amine ligand, and the content of 2,4,6-trimethylphenol (TMP) additive on the polymer yield and molecular weight were investigated by using gel permeation chromatography. The catalytic activity of various Cu-amine systems on the 2,S-dimethylphenol (DMP) polymerization was monitored and compared each other through oxygen-uptake experiment. In addition, the effect of catalyst removal using aqueous EDTA on the thermal stability of the prepared polymer was elucidated by thermogravimetric analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.87-96
• /
• 2006

Although bytecode has many good features, it has slow execution speed and it is not an ideal representation for program analysis or optimization. For analysises and optimizations. bytecode must be translated to a Static Single Assignment Form(SSA Form) But when bytecode is translated a SSA Form it has lost type informations of son variables. For resolving these problem in this paper, we create extended control flow graph on bytecode. Also we convert the control flow graph to SSA Form for static analysis. Calculation about many informations such as dominator, immediate dominator. dominance frontier. ${\phi}$-Function. renaming are required to convert to SSA Form. To obtain appropriate type for generated SSA Form, we proceed the followings. First. we construct call graph and derivation graph of classes. And the we collect information associated with each node. After finding equivalence nodes and constructing Strongly Connected Component based on the collected informations. we assign type to each node.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.699-708
• /
• 2002

Since various terminals and different networks get involved in playing of a multimedia presentation, the case that the presentation QoS at a destination should be different from the QoS of multimedia data at a source occurs frequently. For playing the multimedia presentation, the multimedia data at a source should be transcoded into the multimedia data satisfying the QoS required at the terminal. The problem of generating the transcoding path is that, for a given multimedia presentation, different transcoding paths depending the terminal and networks should be generated. That is, a fixed transcoding path cannot be applied to a multimedia presentation. Instead, whenever the terminal and network to play the presentation get determined, a proper transcoding path should be regenerated automatically. In this paper, the algorithm for generating the transcoding path and the method for checking the playability of the generated path are proposed. The generating algorithm adopted the technique of Context Free Grammar in describing the set of transcoding resources and a user's transcoding rules in order to utilize the well-known compiler techniques. For the playability check, a method of computing the transcoding time and the delay time between data units are proposed. Finally all the proposed methods were implemented in the stream engine, called Transcore and the presentation-authoring tool, called VIP, we had developed. And the test results with a sample scenario were presented at the last.

• Journal of Life Science
• /
• v.15 no.6 s.73
• /
• pp.972-978
• /
• 2005

The present study was carried out to investigate the blood markers of Jeju horses. The redcell cypes (blood groups) and blood protein types (biochemical polymorphisms) were tested from 102 Jeju horses by serological and electrophoretc procedure, and their phenotypes and gene frequencies were estimated. The blood group and biochemical polymorphism phenotypes observed with high frequency were $A^{af}\;(27.45\%$), $C^{a}\;(99.02\%$), $K^{-}\;(97.06\%$), $U^{a}\;(62.75\%$), $P^{b}\;(36.27\%$), $Q^{c}\;(47.06\%$), $D^{cgm/dghm}\;(13.73\%$), $D^{adn/cgm}\;(9.80\%$), $D^{ad/cgm}$\;(8.82\%$), $D^{dghm/dghm}(7.84\%$), $D^{cgm/cgm}(7.84\%$), $AL^{B}\;(48.04\%$), $GC^{F}\;(99.02\%$), $AlB^{K}\;(97.06\%$), $ES^{FI}\;(36.27\%$), $TF^{F2}\;(25.49\%$), $HB^{B1}\;(45.10\%$), and $PGD^{F}\;(86.27\%$) in Jeju horses, respectively. Alleles observed with high gene frequency were $A^{af}$ (0.3726), $A^{C}$ (0.2647), $C^{-}$ (0.5050), $K^{-}$ (0.9853), $U^{-}$ (0.6863), $P^{b}$ (0.4657), $Q^{c}$ (0.5294), $D^{cgm}$ (0.3039), $HB^{B1}$(0.6863), $PGD^{F}$ (0.9265), $AL^{B}$ (0.6912), $ALB^{K}$ (0.9852), $GC^{F}$ (0.9950), $ES^{I}$ (0.5000) and $TF^{F2}$ (0.4950) in Jeju horses, and sfecific alleles, $D^{cgm(f)}$ (0.0196), $HB^{A}$ (0.0147), $HB^{A2}$ (0.0196), $ES^{G}$ (0.0441), $ES^{H}$ (0.0098), $TF^{E}$TF'(0.0246), $TF^{H2}$ (0.0049) and $PGD^{D}$ (0.0098) were detected in Jeju horses. These preliminary results present basic information for detecting the genetic markers in Jeju horse. and developing a system for parentage verification and individuals identification in jeju horses.