• Cross-Cultural Studies
• /
• v.45
• /
• pp.33-54
• /
• 2016

This study presents a comparative analysis of the calligrammic poetic dictions shown in the poems of the French poets Guillaume Apollinaire and Paul Eluard and in those of the Korean poet Lee Sang. They were adventurers in the avant-garde movement who used experimental techniques that led to futurism, expressionism, cubism, dadaism, and surrealism. They applied a typographic technique that combined pictorial arrangements of fonts, shapes of compositions and between lines, letters of the alphabet, mathematical symbols, and graphical elements, such as circles or lines, to make up a poem that also looked like a painting. Their works, valued as visual lyric poems, break up language and combine anti-poems. They rejected traditional poetic dictions or grammar, but developed a paratactic poem that freely uses letters and symbols. Their calligrammic poetic dictions arouse dynamic images like space extension. Lee Sang's calligrams seem like abstract paintings that apply geometric symbols like those used in technical drawings. As a result, crossing the boundaries between language and pictorial art by using experimental materials and techniques, their poems deconstruct the creative standards of rational and traditional poetic dictions, creating an adventurous, expressive technique. Their calligrammic, avant-garde poems introduced a new spirit of art into both French and Korean modern poetic literature.

• Journal of Nutrition and Health
• /
• v.54 no.2
• /
• pp.129-138
• /
• 2021

To set the estimated energy requirement (EER) in Dietary Reference Intakes for Koreans (KDRI), we need the coefficient by physical activity stage, as determined by the physical activity level(PAL). Thus, there has been demand for a tool to calculate PAL based on the physical activity diary. This study was undertaken to develop a physical activity (PA) classification table for Koreans, using the 2011 Compendium of physical activities in the United States. The PA classification table for Koreans contains 262 codes, and values of the metabolic equivalent of task (MET) for specific activities. Of these, 243 PAs which do not have Korean specific data or information, were selected from the 2011 Compendium of PAs that originated in the United States; another 19 PAs were selected from the previous research data of Koreans. The PA classification table is codified to facilitate the selection of energy values corresponding to each PA. The code for each PA consists of a single letter alphabet (activity category) and four numeric codes that display the activity type (2 digit number), activity intensity (1 digit number), and specific activities (1 digit number). In addition, the intensity (sedentary behavior, low, middle and high) of specific PA and its rate of energy expenditure in MET are presented together. The activity categories are divided into 4 areas: Daily Activity (A), Movement (B), Occupation (C), and Exercise and Sports (D). The developed PA classification table can be applied to quantify the energy cost of PA for adults in research or practice, and to assess energy expenditure and physical activity levels based on self-reported PA.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.411-414
• /
• 2021

One of the elements of technology that has become extremely critical within the field of education today is Deep learning. It has been especially used in the area of natural language processing, with some word-representation vectors playing a critical role. However, some of the low-resource languages, such as Swahili, which is spoken in East and Central Africa, do not fall into this category. Natural Language Processing is a field of artificial intelligence where systems and computational algorithms are built that can automatically understand, analyze, manipulate, and potentially generate human language. After coming to discover that some African languages fail to have a proper representation within language processing, even going so far as to describe them as lower resource languages because of inadequate data for NLP, we decided to study the Swahili language. As it stands currently, language modeling using neural networks requires adequate data to guarantee quality word representation, which is important for natural language processing (NLP) tasks. Most African languages have no data for such processing. The main aim of this project is to recognize and focus on the classification of words in English, Swahili, and Korean with a particular emphasis on the low-resource Swahili language. Finally, we are going to create our own dataset and reprocess the data using Python Script, formulate the syllabic alphabet, and finally develop an English, Swahili, and Korean word analogy dataset.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.319-326
• /
• 2007

To perform fast searching in massive data such as DNA strings, the most efficient method is to construct full-text index data structures of given strings. The widely used full-text index structures are suffix trees and suffix arrays. Since the suffix may uses less space than the suffix tree, the suffix array is proper for DNA strings. Previously developed construction algorithms of suffix arrays are not suitable for DNA strings since those are designed for integer alphabets. We propose a fast algorithm to construct suffix arrays on DNA strings whose alphabet sizes are fixed by 4. We reduce the construction time by improving encoding and merging steps on Kim et al.[1]'s algorithm. Experimental results show that our algorithm constructs suffix arrays on DNA strings 1.3-1.6 times faster than Kim et al.'s algorithm, and also for other algorithms in most cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.63-68
• /
• 2010

Recently, to accelerate the Ubiquitous generation, the input interface of the mobile machinery and tools are actively being researched. In addition with the existing interfaces such as the keyboard and curser (mouse), other subdivisions including the handwriting, voice, vision, and touch are under research for new interfaces. Especially in the case of small-sized mobile machinery and tools, there is a increasing need for an efficient input interface despite the small screens. This is because, additional installment of other devices are strictly limited due to its size. Previous studies on handwriting recognition have generally been based on either two-dimensional images or algorithms which identify handwritten data inserted through vectors. Futhermore, previous studies have only focused on how to enhance the accuracy of the handwriting recognition algorithms. However, a problem arisen is that when an actual handwriting is inserted, the user must select the classification of their characters (e.g Upper or lower case English, Hangul - Korean alphabet, numbers). To solve the given problem, the current study presents a system which distinguishes different languages by analyzing the form/shape of inserted handwritten characters. The proposed technique has treated the handwritten data as sets of vector units. By analyzing the correlation and directivity of each vector units, a more efficient language distinguishing system has been made possible.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.456-462
• /
• 2002

We are developing searching algorithms for weighted strings such as protein sequences. Let${\sum}$ be an alphabet and for each $a{\in}{\sum}$ its weight ${\mu}(a)$ is given. Given a string $A=a_1a_2…a_n\; with each ai{\in}{\sum}$, a substring<$A(i.j)=a_ia_{i+1}…a_j$ has weight ${\in}(A(i.j))={\in}(a_i)+{\in}(a_i+1)+…+{\in}(a_j)$.The problem we are dealing with is to preprocess A to build a searching structure, and later, given a query weight M, the structure is used to answer the question of whether there is a substring A(i,j) such that$M={\in}(A(i,j))$.In this paper an algorithm that improves over the previous result will be presented. The previously best known algorithm answers a query in $0(\frac{nlog\;logn}{log\; n})$time using a searching structure that requires O(n) amount of memory. Our algorithm reduces the memory requirement to $0(\frac{n}{log\; n})$ while achieving the same query answer time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.6
• /
• pp.805-814
• /
• 2013

This paper proposes a robust hand segmentation method using view-invariant characteristic of a wrist-mounted camera, and deals with a hand shape recognition system based on segmented hand information. We actively utilize the advantage of the proposed camera device that provides view-invariant images physically, and segment hand region using a Bayesian rule based on adaptive histograms. We construct HSV histograms from RGB histograms, and update HSV histograms using hand region information from a current image. We also propose a user adaptation method by which hand models gradually approach user-dependent models from user-independent models as the user uses the system. The proposed method was evaluated using 16 Korean manual alphabet, and we obtained increases of 27.91% in recognition success rate.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.289-294
• /
• 2015

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

• Science of Emotion and Sensibility
• /
• v.15 no.4
• /
• pp.469-476
• /
• 2012

The purpose of this study is to derive design guideline for logo design development of smart clothing using flexible plastic optical fiber. In a criterion of guideline derivation for logo design, the first, it is a question of whether it indicates an appropriate degree of brightness across the front of flexible plastic optical fiber. The second, it is a question of whether it indicates relatively an uniform brightness characteristic across the front of flexible plastic optical fiber. For this, the brightness characteristic of flexible plastic optical fiber according to the angle changes and the length of flexible plastic optical fiber was analyzed by the 'Experiment 1'. To deduce guideline for the logo design of the actual garment, the brightness characteristic of flexible plastic optical fiber about the main morpheme of the capital letter of alphabet was analyzed by the 'Experiment 2'. Based on the results of the two experiment, this study derived design guideline and limitations for logo design of smart clothing visualized by the flexible plastic optical fiber.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.700-705
• /
• 2014

An anagram is a form of word play to find a new word from a set of given alphabet letters. Good human anagram solvers use the strategy of bigrams. They explore a constraint satisfaction network in parallel and answers consequently pop out quickly. In this paper, we propose a molecular computational algorithm using the same process as this. We encoded letters into DNA sequences and made bigrams and then words by connecting the letter sequences. From letters and bigrams, we performed DNA hybridization, ligation, gel electrophoresis and finally, extraction and separation to extract bigrams. From the matched bigrams and words, we performed the four molecular operations again to distinguish between right and wrong results. Experimental results show that our molecular computer can identify cor rect answers and incorrect answers. Our work shows a new possibility for modeling the cognitive and parallel thinking process of a human.