• Journal of Computing Science and Engineering
• /
• 제3권1호
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• 영어영문학
• /
• 제57권6호
• /
• pp.911-938
• /
• 2011

The present study examined the effect of two variables of task complexity, reasoning demand and time pressure, each from the resourcedirecting and resource-dispersing dimension in Robinson's (2001) framework of task classification. Reasoning demand was operationalized as the two types of texts to read and summarize, expository and argumentative. Time pressure was operationalized as the two modes of performance, oral and written. Six university students summarized the two types of text orally and twenty four students from the same school summarized them in the written form. Results from t test and ANCOVA showed that in the oral mode, reasoning demand tends to heighten the complexity of the language used in the summary in competition with accuracy but such an effect disappeared in the written mode. It was interpreted that the degree of time pressure is not the only difference between the oral and written modes but that the two modes may be fundamentally different cognitive tasks, and that Robinson's (2001) and Skehan's (1998) models were differentially supported by the oral mode of tasks but not by the written mode of the tasks.

• ETRI Journal
• /
• 제5권3호
• /
• pp.16-25
• /
• 1983

Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

• 대한음성학회:학술대회논문집
• /
• 대한음성학회 2003년도 10월 학술대회지
• /
• pp.185-188
• /
• 2003

In this paper, we construct phonetic GMM for text-independent speaker identification system. The basic idea is to combine of the advantages of baseline GMM and HMM. GMM is more proper for text-independent speaker identification system. In text-dependent system, HMM do work better. Phonetic GMM represents more sophistgate text-dependent speaker model based on text-independent speaker model. In speaker identification system, phonetic GMM using HMM-based speaker-independent phoneme recognition results in better performance than baseline GMM. In addition to the method, N-best recognition algorithm used to decrease the computation complexity and to be applicable to new speakers.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.521-523
• /
• 2006

This paper proposes an algorithm and its data structure to support real-time full-text search for the streamed or broadcasted multimedia data containing real-time stenograph text. Since the traditional indexing method used at information retrieval area uses the linguistic information, there is a heavy cost. Therefore, we propose the algorithm and its data structure based on suffix array, which is a simple data structure and has low space complexity. Suffix array is useful frequently to search for huge text. However, subtitle text of multimedia data is to get longer by time. Therefore, suffix array must be reconstructed because subtitle text is continually changed. We propose the data structure called prefix array and search algorithm using it.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.251-252
• /
• 2007

The thesis proposed the Text Extraction Algorithm which is a text extraction algorithm which uses the Coiflet Wavelet, YCbCr Color model and the close curve edge feature of adaptive LoG Operator in order to complement the demerit of the existing research which is weak in complexity of background, variety of light and disordered line and similarity of text and background color. This thesis is simulated with natural images which include naturally text area regardless of size, resolution and slant and so on of image. And the proposed algorithm is confirmed to an excellent by compared with an existing extraction algorithm in same image.

• Journal of Information Science Theory and Practice
• /
• 제9권4호
• /
• pp.15-34
• /
• 2021

Text clustering is one of the most commonly used methods for detecting themes or types of documents. Text clustering is used in many fields, but its effectiveness is still not sufficient to be used for the understanding of Arabic text, especially with respect to terms extraction, unsupervised feature selection, and clustering algorithms. In most cases, terms extraction focuses on nouns. Clustering simplifies the understanding of an Arabic text like the text of the Quran; it is important not only for Muslims but for all people who want to know more about Islam. This paper discusses the complexity and limitations of Arabic text clustering in the Quran based on their themes. Unsupervised feature selection does not consider the relationships between the selected features. One weakness of clustering algorithms is that the selection of the optimal initial centroid still depends on chances and manual settings. Consequently, this paper reviews literature about the three major stages of Arabic clustering: terms extraction, unsupervised feature selection, and clustering. Six experiments were conducted to demonstrate previously un-discussed problems related to the metrics used for feature selection and clustering. Suggestions to improve clustering of the Quran based on themes are presented and discussed.

• 대한수학교육학회지:수학교육학연구
• /
• 제14권3호
• /
• pp.267-281
• /
• 2004

방정식의 활용 문제로 다루어지는 문장제는 학생들의 흥미를 유도하고 수학의 유용성을 보여줄 수 있는 것이지만, 학생들이 해결하기에는 여러 어려움이 있다. 본 연구는 학생들이 수학 문장제를 해결하는데 영향을 줄 수 있는 요인들을 언어적 측면과 인지적 측면에서 조사하였다. 언어적 요인에는 텍스트 기반, 실세계, 상황 모델이 있었는데, 학생들은 문장의 텍스트 기반에서 방정식의 상황 모델로 해석하는 것을 어렵게 생각하고 있었으며, 상황 모델에서 학생들은 많은 오류를 보였다. 인지적 측면에서는 방정식을 세우는 스키마와 해결 전략, 식의 복잡성 수준을 조사하였는데, 방정식을 세울 때 학생들은 복잡성 수준을 고려하기보다는 교사의 지도 내용에 따라 전략을 선택하는 경향이 있었다. 그리고 설탕의 양이나 농도, 설탕물의 양을 혼동하는 경향이 강했다. 본 연구의 결과를 통해 문장제에서 학생들에게 제시되는 문제가 해결하기에 얼마나 복잡한지, 학생들이 주로 어떤 전략을 선택하는지, 방정식의 문제 유형별로 발생하는 오류에 대해 알 수 있었다.

• Journal of information and communication convergence engineering
• /
• 제20권4호
• /
• pp.309-316
• /
• 2022

This investigation is aimed at automatic text summarization on large-scale Vietnamese datasets. Vietnamese articles were collected from newspaper websites and plain text was extracted to build the dataset, that included 1,101,101 documents. Next, a new single-document extractive text summarization model was proposed to evaluate this dataset. In this summary model, the k-means algorithm is used to cluster the sentences of the input document using different text representations, such as BoW (bag-of-words), TF-IDF (term frequency - inverse document frequency), Word2Vec (Word-to-vector), Glove, and FastText. The summary algorithm then uses the trained k-means model to rank the candidate sentences and create a summary with the highest-ranked sentences. The empirical results of the F1-score achieved 51.91% ROUGE-1, 18.77% ROUGE-2 and 29.72% ROUGE-L, compared to 52.33% ROUGE-1, 16.17% ROUGE-2, and 33.09% ROUGE-L performed using a competitive abstractive model. The advantage of the proposed model is that it can perform well with O(n,k,p) = O(n^(k+2/p)) + O(nlog₂n) + O(np) + O(nk²) + O(k) time complexity.

• 한국산학기술학회논문지
• /
• 제8권5호
• /
• pp.1135-1140
• /
• 2007

본 논문은 자연영상에서 문자의 크기와 방향에 무관한 적응적 문자-에지 맵을 이용한 에지-기반 텍스트 영역검출 알고리즘을 제안한다. 첫 번째로, 에지 이미지로부터 에지 레이블을 얻고, 레이블 이미지로부터 문자를 찾기 위해 배열문법을 이용하여 적응적 문자-에지 맵을 적용한다. 선택된 레이블은 이웃 레이블과의 거리를 기준으로 클러스터 된다. 그 결과 텍스트 후보 영역이 얻어진다. 최종적으로, 텍스트 후보 영역은 경험적 규칙과 텍스트 영역에 대한 수평/수직 프로파일을 분석함으로서 검증된다. 실험결과 제안한 알고리즘은 다양한 문자의 크기 변화, 문자열의 방향, 그리고 복잡한 배경에서도 강인한 텍스트 영역 검출 결과를 보였다.