• Journal of Power Electronics
• /
• v.7 no.4
• /
• pp.343-352
• /
• 2007

This paper proposes a modularized charge equalization converter for hybrid electric vehicle (HEV) lithium-ion battery cells, in which the intra-module and the inter-module equalizer are Implemented. Considering the high voltage HEV battery pack, over approximately 300V, the proposed equalization circuit modularizes the entire $M^*N$ cells; in other words, M modules in the string and N cells in each module. With this modularization, low voltage stress on all the electronic devices, below roughly 64V, can be obtained. In the intra-module equalization, a current-fed DC/DC converter with cell selection switches is employed. By conducting these selection switches, concentrated charging of the specific under charged cells can be performed. On the other hand, the inter-module equalizer makes use of a voltage-fed DC/DC converter for bi-directional equalization. In the proposed circuit, these two converters can share the MOSFET switch so that low cost and small size can be achieved. In addition, the absence of any additional reset circuitry in the inter-module equalizer allows for further size reduction, concurrently conducting the multiple cell selection switches allows for shorter equalization time, and employing the optimal power rating design rule allows fur high power density to be obtained. Experimental results of an implemented prototype show that the proposed equalization scheme has the promised cell balancing performance for the 7Ah HEV lithium-ion battery string while maintaining low voltage stress, low cost, small size, and short equalization time.

• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.181-188
• /
• 2008

Nowadays, most web sites are developed using dynamic web pages where web pages are generated and transmitted by web application programs. Therefore, the ratio of attacks injecting malevolent strings to vulnerable web applications is increasing. In this paper, we present a static program analyzer which analyzes whether a web application program has vulnerabilities to the SQL injection attack and the cross site scripting(XSS) attack. To analyze programs using abstract interpretation framework, we designed an abstract domain which models potential string set along with excluded strings and developed an abstract interpreter for the PHP language. Also, based on them, we implemented a static analyzer. According to our experiments, our analyzer has competitive analysis speed and accuracy compared with related research results.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.93-102
• /
• 2003

A slant correction method for handwritten Korean strings based on analysis of stroke distribution, which effectively reflects structural properties of Korean characters, is presented in this paper. The method aims to deal with typical problems which have been frequently observed in slant correction of handwritten Korean strings with conventional approaches developed for English/European languages. Extracted strokes from a line of text image are classified into two clusters by applying the K-means clustering. Gaussian modeling is applied to each of the clusters and the slant angle is estimated from the model which represents the vertical strokes. Experimental results support the effectiveness of the proposed method. For the performance comparison 1,300 handwritten address string images were used, and the results show that the proposed method has more superior performance than other conventional approaches.

• 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.

• Journal of the Korean Society of Costume
• /
• v.55 no.4 s.94
• /
• pp.49-61
• /
• 2005

This study is to research the types and formation of the pieces for fastening the clothing in the western and oriental world from 18c to 19c. The pieces for fastening the clothing, depending on their formation, are classified as the ribbon type, the belt type, the button type, and the compound type. The ribbon type indicates fastening the clothing with the strips attached to the clothes. It is divided into the symmetry type and the asymmetry type by the looks of the ribbon alter it is tied. The belt type means fastening the clothing with a string or a belt, separated from the clothes. It is divided into the string type and the belt type. The button type is to fasten the clothing with buttons, button holes, and hooks. It is divided into the basic type, the wrapping type, and the knot type. The compound type is a mixture of two or three types out of the ribbon type, the belt type, and the button type. The pieces for fastening the clothing has aesthetic features as well as their functional characteristics. It has beautiful features like the harmonious beauty of Yin and Yen shown in the asymmetrical types, the beauty of spell wishing for health, long-life, wealth, wisdom, and so on, the beauty of decency showing the intention of refraining from exposing their body in public, the beauty of eroticism emphasizing the beauty of the human body, and the beauty of representing their social class, authority, affiliation, and so on.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.65
• /
• pp.1-20
• /
• 2015

International Commercial Terms, known as "Incoterms", are internationally accepted terms defining the responsibilities of exporters and importers in the arrangement of shipments and the transfer of liability involved at various stages of the transaction. The latest version of Incoterms rules were revised in 2010, so called Incoterms$^{(R)}$ 2010 which is the eighth set of pre-defined commercial terms published by the International Chamber of Commerce(ICC) in 1936. It has been already past 5 years since Incoterms$^{(R)}$ 2010 became effective January 1, 2011. At this point, we should examine the latest version of Incoterms whether the rules are not satisfied with the practical commerce because the customs and practices of commerce change constantly. The main purpose of this article is to seek a difference between the present commercial customs and practice and the rules of Incoterms$^{(R)}$ 2010. In addition, if there is any difference between them, an alternative resolution would be suggested. This article exercises the process of transition of the Incoterms rules, especially CIP, DDP, and CIF among 11 rules of Incoterms$^{(R)}$ 2010. Then this article provides some feasible alternatives to attempting to resolve some regulation problems of CIP, DDP, and CIF in the Incoterms$^{(R)}$ 2010. For examples, the practical meaning is different between "if customary or at the buyer's request" and "if agreed or customary" in CIF and CIP, especially a negotiable documentary being used. Furthermore, the interpretation of transfer of risks on the afloat goods in string sales in CIF term.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.760-766
• /
• 2017

Repetitive strings have been studied in diverse fields such as data compression, bioinformatics and so on. Recently, two problems of approximate periods of strings over integer alphabets were introduced, finding minimum ${\delta}-approximate$ periods and finding minimum ${\gamma}-approximate$ periods. Both problems can be solved in $O(n^2)$ time when n is the length of the string. In this paper, we present two parallel algorithms for solving the above two problems in O(n) time using $O(n^2)$ threads, respectively. The experimental results show that our parallel algorithms for finding minimum ${\delta}-approximate$ (resp. ${\gamma}-approximate$) periods run approximately 19.7 (resp. 40.08) times faster than the sequential algorithms when n = 10,000.

• Journal of Family Resource Management and Policy Review
• /
• v.10 no.1
• /
• pp.17-32
• /
• 2006

This essay has attempted to document the actual behavior patterns and the social networks related to the child delivery in the pre-industrial Korean society. We interviewed 30 women who had given birth to their first child during the 1930s and the 1940s in order to accumulate data related to son-prayer rites, prenatal care and food avoidance, sacred-string culture, and other incantation rituals. The characteristics of the social relationships with the person who had assisted the delivery and the recovery were also analyzed in terms of kinship networks. The results are as follows. First, there was a big gap between knowledge and the actual practices in birth rituals and customs. We assume that this is due to the adverse social-economic conditions at that time which may have restricted the actual performances of these customs. Second, there were almost no differences of the performance of these' birth customs between the urban areas and the rural areas. Third, the people who assisted the delivery were women who were mostly from the husband's family. Help from the wife's family were quite exceptional. Finally, it has been found out that only about half of the women who were interviewed performed the well-known custom of three-week after-birth confinement.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.8
• /
• pp.579-587
• /
• 1988

Conventional methods of automatic recognition of Korean characters consist of the thinning processing, the segmentation of connected fundamental phonemes and the recognition of each fundamental character. These methods, however require the thinning processing which is complex and time consuming. Also several noise components make worse effects on the recognition of characters than in the case of no thinning. This paper describes the extraction method of the feature components of Korean fundamental characters of the Gothic Korean letter without the thinning. We regard line-components of the contour which describes the character's external boundary as the feature-components. The line-component includes the directional code, the length and the start point in the image. Each fundamental character is represented by the string of directional codes. Therefore the recognition process is only the string pattern matching. We use the Gothic-hangul in the experiment. The ecognition rate is 92%.

• International Journal of Contents
• /
• v.8 no.3
• /
• pp.83-93
• /
• 2012

In this paper, we propose a novel method that automatically generates real character images to familiarize existing OCR systems with new fonts. At first, we generate synthetic character images using a simple degradation model. The synthetic data is used to train an OCR engine, and the trained OCR is used to recognize and label real character images that are segmented from ideal document images. Since the OCR engine is unable to recognize accurately all real character images, a substring matching method is employed to fix wrongly labeled characters by comparing two strings; one is the string grouped by recognized characters in an ideal document image, and the other is the ordered string of characters which we are considering to train and recognize. Based on our method, we build a system that automatically generates 2350 most common Korean and 117 alphanumeric characters from new fonts. The ideal document images used in the system are postal envelope images with characters printed in ascending order of their codes. The proposed system achieved a labeling accuracy of 99%. Therefore, we believe that our system is effective in facilitating the generation of numerous character samples to enhance the recognition rate of existing OCR systems for fonts that have never been trained.