Search

Your search keyword '"Cho, Hwan-Gue"' showing total 328 results
Start Over Author "Cho, Hwan-Gue"
328 results on '"Cho, Hwan-Gue"'

2. Practical Space-Efficient Index for Structural Pattern Matching

Author

Kim, Sung-Hwan, Cho, Hwan-Gue, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Bazgan, Cristina, editor, and Fernau, Henning, editor

Published
2022
Full Text
View/download PDF

3. SickZil-Machine: A Deep Learning Based Script Text Isolation System for Comics Translation

Author

Ko, U-Ram, Cho, Hwan-Gue, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Bai, Xiang, editor, Karatzas, Dimosthenis, editor, and Lopresti, Daniel, editor

Published
2020
Full Text
View/download PDF

4. Sequence Searching and Visualizing over 3D Random Plot of Whole Genome Using Skip List

Author

Lee, Da-Young, Tak, Hae-Sung, Cho, Hwan-Gue, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Lee, Sukhan, editor, Ismail, Roslan, editor, and Choo, Hyunseung, editor

Published
2019
Full Text
View/download PDF

9. Covering Points with Convex Sets of Minimum Size

Author

Cho, Hwan-Gue, Evans, William, Saeedi, Noushin, Shin, Chan-Su, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kaykobad, Mohammad, editor, and Petreschi, Rossella, editor

Published
2016
Full Text
View/download PDF

15. An Automated Procedure for Word Balloon Placement in Cinema Comics

Author

Chun, Bong-Kyung, Ryu, Dong-Sung, Hwang, Won-Il, Cho, Hwan-Gue, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bebis, George, editor, Boyle, Richard, editor, Parvin, Bahram, editor, Koracin, Darko, editor, Remagnino, Paolo, editor, Nefian, Ara, editor, Meenakshisundaram, Gopi, editor, Pascucci, Valerio, editor, Zara, Jiri, editor, Molineros, Jose, editor, Theisel, Holger, editor, and Malzbender, Tom, editor

Published
2006
Full Text
View/download PDF

16. Visualization of Whole Genome Alignment with LOD Representation

Author

Jin, Hee-Jeong, Cho, Hwan-Gue, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Nishita, Tomoyuki, editor, Peng, Qunsheng, editor, and Seidel, Hans-Peter, editor

Published
2006
Full Text
View/download PDF

17. Multiple Genome Alignment by Clustering Pairwise Matches

Author

Choi, Jeong-Hyeon, Choi, Kwangmin, Cho, Hwan-Gue, Kim, Sun, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Istrail, Sorin, editor, Pevzner, Pavel, editor, Waterman, Michael, editor, and Lagergren, Jens, editor

Published
2005
Full Text
View/download PDF

18. An Open Source Microarray Data Analysis System with GUI: Quintet

Author

Choe, Jun-kyoung, Chung, Tae-Hoon, Park, Sunyong, Cho, Hwan Gue, Hur, Cheol-Goo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Ślęzak, Dominik, editor, Yao, JingTao, editor, Peters, James F., editor, Ziarko, Wojciech, editor, and Hu, Xiaohua, editor

Published
2005
Full Text
View/download PDF

19. Simple Order-Isomorphic Matching Index with Expected Compact Space

Author

Kim, Sung-Hwan, Cho, Hwan-Gue, Kim, Sung-Hwan, and Cho, Hwan-Gue

Abstract

In this paper, we present a novel indexing method for the order-isomorphic pattern matching problem (also known as order-preserving pattern matching, or consecutive permutation matching), in which two equal-length strings are defined to match when X[i] < X[j] iff Y[i] < Y[j] for 0 ? i,j < |X|. We observe an interesting relation between the order-isomorphic matching and the insertion process of a binary search tree, based on which we propose a data structure which not only has a concise structure comprised of only two wavelet trees but also provides a surprisingly simple searching algorithm. In the average case analysis, the proposed method requires ?(R(T)) bits, and it is capable of answering a count query in ?(R(P)) time, and reporting an occurrence in ?(lg |T|) time, where T and P are the text and the pattern string, respectively; for a string X, R(X) is the total time taken for the construction of the binary search tree by successively inserting the keys X[|X|-1],?,X[0] at the root, and its expected value is ?(|X|lg?) where ? is the alphabet size. Furthermore, the proposed method can be viewed as a generalization of some other methods including several heuristics and restricted versions described in previous studies in the literature.

Published
2022
Full Text
View/download PDF

29. A Reliable and Distributed LIMS for Efficient Management of the Microarray Experiment Environment

Author

Jin Hee-Jeong, Lee Jeong-Won, and Cho Hwan-Gue

Subjects
Biotechnology, TP248.13-248.65
Abstract

A microarray is a principal technology in molecular biology. It generates thousands of expressions of genotypes at once. Typically, a microarray experiment contains many kinds of information, such as gene names, sequences, expression profiles, scanned images, and annotation. So, the organization and analysis of vast amounts of data are required. Microarray LIMS (Laboratory Information Management System) provides data management, search, and basic analysis. Recently, microarray joint researches, such as the skeletal system disease and anti-cancer medicine have been widely conducted. This research requires data sharing among laboratories within the joint research group. In this paper, we introduce a web based microarray LIMS, SMILE (Small and solid MIcroarray Lims for Experimenters), especially for shared data management. The data sharing function of SMILE is based on Friend-to-Friend (F2F), which is based on anonymous P2P (Peer-to-Peer), in which people connect directly with their “friends”. It only allows its friends to exchange data directly using IP addresses or digital signatures you trust. In SMILE, there are two types of friends: “service provider”, which provides data, and “client”, which is provided with data. So, the service provider provides shared data only to its clients. SMILE provides useful functions for microarray experiments, such as variant data management, image analysis, normalization, system management, project schedule management, and shared data management. Moreover, it connections with two systems: ArrayMall for analyzing microarray images and GENAW for constructing a genetic network. SMILE is available on http://neobio.cs.pusan.ac.kr:8080/smile.

Published
2007
Full Text
View/download PDF

30. Design of Photovoltaic Power Generation Prediction Model with Recurrent Neural Network

Author

Haesung Tak, Cho， Hwan Gue, and Han-Ho Kim

Subjects
Recurrent neural network, business.industry, Computer science, Photovoltaic power generation, Artificial intelligence, business
Abstract

스마트그리드는 태양광 발전을 포함한 신·재생에너지의 발전량을 예측하고 이를 기반으로 효율적인 전력 생산과 소비를 가능하게 한다. 기존 태양광 발전량 예측 연구들은 시계열에 뛰어난 순환신경망 기법들을 적용 및 비교한 연구가 거의 없다. 또한 학습에 사용되는 과거 데이터의 길이에 대한 고려가 없어 모델의 예측 성능이 떨어졌다. 본 연구에서는 임베디드 변수 선택 기법을 이용하여 태양광 발전에 영향을 미치는 요인을 찾아내고, 시계열 순환신경망 기법들(RNN, LSTM. GRU)에 다양한 과거 데이터 길이를 넣는 실험을 진행하였다. 이 과정에서 가장 뛰어난 성능을 보이는 예측 요인들을 찾고 예측 모델을 설계하였다. 설계한 태양광 발전량 예측 모델은 다른 변수 설정을 사용할 때와 비교하여 더욱 뛰어난 예측 성능을 보이는 것을 확인하였다. 또한 기존 연구들과의 비교를 통하여 본 연구에서 개발한 태양광 발전량 예측 결과가 더 뛰어난 성능을 보이는 것을 확인하였다.

Published
2019

35. A Compact Index for Cartesian Tree Matching

Author

Kim, Sung-Hwan and Cho, Hwan-Gue

Subjects
Suffix Array, Cartesian Tree Matching, Compact Index, String Matching, Theory of computation → Pattern matching, FM-index
Abstract

Cartesian tree matching is a recently introduced string matching problem in which two strings match if their corresponding Cartesian trees are the same. It is considered appropriate to find patterns regarding their shapes especially in numerical time series data. While many related problems have been addressed, developing a compact index has received relatively less attention. In this paper, we present a 3n+o(n)-bit index that can count the number of occurrences of a Cartesian tree pattern in 𝒪(m) time where n and m are the text and pattern length. To the best of our knowledge, this work is the first 𝒪(n)-bit compact data structure for indexing for this problem., LIPIcs, Vol. 191, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), pages 18:1-18:19

Published
2021
Full Text
View/download PDF

40. Indexing Isodirectional Pointer Sequences

Author

Kim, Sung-Hwan and Cho, Hwan-Gue

Subjects
Suffix Array, Wavelet Tree, Cartesian Tree Matching, String Matching, Parameterized String Matching, Theory of computation → Pattern matching, Range Minimum Query, FM-index
Abstract

Many sequential and temporal data have dependency relationships among their elements, which can be represented as a sequence of pointers. In this paper, we introduce a new string matching problem with a particular type of strings, which we call isodirectional pointer sequence, in which each entry has a pointer to another entry. The proposed problem is not only a formalization of real-world dependency matching problems, but also a generalization of variants of the string matching problem such as parameterized pattern matching and Cartesian tree matching. We present a 2nlgσ+2n+o(n)-bit index that preprocesses the text T[1:n] so as to count the number of occurrences of pattern P[1:m] in 𝒪(mlgσ) where σ is the number of distinct lengths of pointers in T. Our index is also easily implementable in practice because it consists of wavelet trees and range maximum query index, which are widely used building blocks in many other compact data structures. By compressing the wavelet trees, the index can also be stored into 2nH^*₀(T)+2n+o(n) bits where H^*₀(T) is the 0-th order empirical entropy of the distribution of pointer lengths of T., LIPIcs, Vol. 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 35:1-35:15

Published
2020
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results