• The Journal of the Korea Contents Association
• /
• v.7 no.9
• /
• pp.44-53
• /
• 2007

The purpose of this study is to identify the most efficient expression method by analyzing advertising expression method by 16 types of product in internet advertising. First of all, It made inquiries about expression method and attitude of internet advertising for this study and identified a conception, characteristics, and types of internet advertising through literature reviews about internet advertising. This study offered expression the korean alphabet, hangout about banners ads, sponsorship ads, interstitial ads and pop-up ads. This study analyzed advertising expression, advertising effectiveness and advertising attitude by 16 types of product in internet advertising. In conclusion, the marketers of internet advertising have to effort to make internet advertisements that suit their advertising purpose by using the right expression method of internet advertising because they know internet advertising are quite different the expression method, advertising effectiveness, and advertising attitude. And they have to convert negative attitude or medium size attitude of internet advertising into positive attitude in the future.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.476-484
• /
• 2008

Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an $O(k^3n+L)$-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.

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

LDA (Linear Discriminant Analysis) is a data discrimination technique that seeks transformation to maximize the ratio of the between-class scatter and the within-class scatter While it has been successfully applied to several applications, it has two limitations, both concerning the underfitting problem. First, it fails to discriminate data with complex distributions since all data in each class are assumed to be distributed in the Gaussian manner; and second, it can lose class-wise information, since it produces only one transformation over the entire range of classes. We propose three extensions of LDA to overcome the above problems. The first extension overcomes the first problem by modeling the within-class scatter using a PCA mixture model that can represent more complex distribution. The second extension overcomes the second problem by taking different transformation for each class in order to provide class-wise features. The third extension combines these two modifications by representing each class in terms of the PCA mixture model and taking different transformation for each mixture component. It is shown that all our proposed extensions of LDA outperform LDA concerning classification errors for handwritten digit recognition and alphabet recognition.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.184-192
• /
• 2010

In the current so-called age of emotion marketing, the independent form of handwriting of calligraphy is being revitalized in various fields such as advertising, book designs, film titles, posters, packages, BI, and even fashion. Thus centered on Gyeyang-gu at the city of Incheon, 100 outdoors signs that used calligraphy were chosen and we researched a reform plan that could revitalize calligraphy in outdoor signs by classifying them according to current conditions of the use of calligraphy, actual conditions of practical use, expression tools, and analyzing the use of colors. The result was trial requests not only from the formalities industry, but also the financial sector, public corporations, and several other businesses, but in order to provide not only for franchise brand logotypes manufactured by expensive experts, but also provide production of high-quality calligraphy for low costs for small private enterprises, the development of a diverse calligraphy education program, centered on the regional society, will be needed. In the midst of globalization, in order to advertise the beauty of Korean alphabet and to create our own unique street culture, a variety of tools and tactile expressions are demanded, in the future the research on the calligraphy of outdoor signs must be revitalized.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.260-267
• /
• 2005

To search efficiently a text T of length n for a pattern P over an alphabet 5, suffix trees and suffix arrays are widely used. In case of a large text, suffix arrays are preferred to suffix trees because suffix ways take less space than suffix trees. Recently, O(${\mid}P{\mid}{\codt}{\mid}{\Sigma}{\mid}$-time and O(${\mid}P{\mid}P{\cdot}log{\mid}{\Sigma}{\mid}$)-time search algorithms in suffix ways were developed. In this paper we present time and space efficient search algorithms in suffix arrays. One algorithm runs in O(${\mid}P{\mid}$) time using O($n{\cdot}{\mid}{\Sigma}{\mid}$)-bits space, and the other runs in O($n{\cdot}{\mid}{\Sigma}{\mid}$ time using O($nlog{\mid}{\Sigma}{\mid}+{\mid}{\Sigma}{\mid}{\cdot}$nlog log n/logn)-bits space, which is more space efficient and still fast. Experiments show that our algorithms are efficient in both time and space when compared to previous algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• (The)Study of the Eastern Classic
• /
• no.55
• /
• pp.173-192
• /
• 2014

Through excavation on Anapji Pond from March 1975 to December 1976, it was discovered that the whole area around Anapji Pond had been called East Palace (東宮) since 7th century and that the original name of East Palace was Wolji Palace (月池宮) through excavation in 1980. The excavation proved that the original name of Anapji Pond was 'Wolji.' In academic world, there are many scholars who recognize this place as the Crown Prince's palace for being called East Palace. East Palace (which is read Dong Palace with pronunciation in Korean alphabet) actually is another name for Crown Prince's palace. This place, however, cannot have served as Crown Prince's palace as 'independent, exclusive space.' After 7th century, there were detached palaces in Silla including East Palace South Palace North Palace and Yang Palace other than Jeong Palace in Wolseong. East Palace is a palace located in the east. The palace's name is based on bearing and it does not indicate Crown Prince's palace. This article proves that East Palace cannot have been Crown Prince's palace through newly analyzing materials related to Wolji Palace.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.165-176
• /
• 2011

In this paper, we examine the reliability verification procedure of evidence analysis tools for computer forensics and test the famous tools for their functional requirements using the verification items proposed by standard document, TIAK.KO-12.0112. Also, we carry out performance evaluation based on test results and suggest the way of performance improvement for evidence analysis tools. To achieve this, we first investigate functions that test subjects can perform, and then we set up a specific test plan and create evidence image files which contain the contents of a verification items. We finally verify and analyze the test results. In this process, we can discover some weaknesses of most of analysis tools, such as the restoration for deleted & fragmented files, the identification of the file format which is widely used in the country and the processing of the strings composed of Korean alphabet.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.7
• /
• pp.45-55
• /
• 2021

Information obtained through various sensors embedded in a smartphone can be used to identify and analyze user's movements and situations. In this paper, we propose two rule-based motion detection systems that can detect three alphabet motions, 'I', 'S', and 'Z' by analyzing data obtained by the acceleration and gyroscope sensors in a smartphone. First of all, the characteristics of acceleration and angular velocity for each motion are analyzed. Based on the analysis, two rule-based systems are proposed and implemented as an android application and it is used to verify the detection performance for each motion. Two rule-based systems show high recognition rate over 90% for each motion and the rule-based system using ensemble shows better performance than another one.