• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1090-1102
• /
• 2006

This paper suggests a new algorithm for detecting the plagiarism among a set of source codes, constrained to be functionally equivalent, such are submitted for a programming assignment or for a programming contest problem. The typical algorithms largely exploited up to now are based on Greedy-String Tiling, which seeks for a perfect match of substrings, and analysis of similarity between strings based on the local alignment of the two strings. This paper introduces a new method for detecting the similar interval of the given programs based on an adaptive similarity matrix, each entry of which is the logarithm of the probabilities of the keywords based on the frequencies of them in the given set of programs. We experimented this method using a set of programs submitted for more than 10 real programming contests. According to the experimental results, we can find several advantages of this method compared to the previous one which uses fixed similarity matrix(+1 for match, -1 for mismatch, -2 for gap) and also can find that the adaptive similarity matrix can be used for detecting various plagiarism cases.

• Journal of the Microelectronics and Packaging Society
• /
• v.24 no.3
• /
• pp.7-11
• /
• 2017

In this paper, we have studied the characteristics of NAND Flash memory in SONOS Poly-Si Thin Film Transistor (Poly-Si TFT) device. Source/drain junctions(S/D) of cells were not implanted and selective transistors were located in the end of cells. We found the optimum conditions of process by means of the estimation for the doping concentration of channel and source/drain of selective transistor. As the doping concentration was increased, the channel current was increased and the characteristic of erase was improved. It was believed that the improvement of erase characteristic was probably due to the higher channel potential induced by GIDL current at the abrupt junction. In the condition of process optimum, program windows of threshold voltages were about 2.5V after writing and erasing. In addition, it was obtained that the swing value of poly Si TFT and the reliability by bake were enhanced by increasing process temperature of tunnel oxide.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

• Journal of Veterinary Clinics
• /
• v.33 no.3
• /
• pp.165-167
• /
• 2016

A case of rectal prolapses in a one-year-old intact male mixed-breed dog, weighing 6.8 kg was presented with one-week history of protruded tubular pink mass through the anus along with mucosal necrosis. The prolapse was non-reducible, so rectal amputation and anal purse-string suture was performed. Prolapse recurred 9 days after the surgery, purse-string suture and conservative treatment were attempted with no-good results. Laparoscopic-assisted incisional colopexy technique was applied to treat the recurrent rectal prolapse, but failed 6 days after surgery. This was followed by non-incisional colopexy technique, which prevented recurrence during the 3 months of follow-up period. Despite the episode of recurrence, the laparoscopic-assisted colopexy technique treated rectal prolapse successfully. This is the first report in Korea, which describes laparoscopic-assisted colopexy in the dog.

• Archives of Plastic Surgery
• /
• v.37 no.2
• /
• pp.202-205
• /
• 2010

Purpose: Male nipple hypertrophy is a rare condition but is a social embarrassment for individual. The currently available techniques of nipple reduction already described in the literature for female patients are discussed, but the goal of treatment is different in male patients. In male patient, the diameter as well as vertical height should be reduced simultaneously to achieve better aesthetic results. Our new technique can reduce the diameter of the hypertrophic nipple as well as the vertical height efficiently and simply. Methods: A 19-years-old man with nipple hypertrophy on the right chest presented. The flap is designed based on the site of left nipple, symmetry, the diameter, and the projection desired. The widths of the V flaps determine projection, whereas the diameter of the C flap determines the diameter of the nipple and top of the new nipple. Unnecessary hypertrophic tissues are extirpated and the V flaps are elevated. The nipple base is reduced by purse-string suture technique. The V flaps are wrapped around, and C flap is used as a cap. Results: No complication including nipple necrosis or sensory loss were found during follow-up period. The normal symmetry of the nipple contour was restored. Conclusion: We describe a simple technique for male nipple reduction using a C-V flap with purse-string suture. In our experience, this technique has provided good aesthetic result and patient satisfaction.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1659-1668
• /
• 1996

Graph grammars generate graph languages while string grammars generate string languages which are the subset of graph languages. One of the most successful graph grammars models is the NLC grammars, which gen-erate graphs by replacing a node by a node by a graph through node labels. For grammars generating hypergraphs which are the superset of graphs, there are CFHG grammars, which replace a hyperedge by a hypergraph through their preidentified gluing points, an extension of CFHG grammars called HH grammars, which replace a handle by a hypergraph through the rewriting mechanism that can also duplicate or delete the hyperedges surrounding the replaced handle, and finally HRNCE grammars, which replace a handle by a hypergraph through an eNCE way of rewriting, In this paper, we compare the language-generating power of HRNCE grammars with that a graph grammars mentioned above by comparing graph langrages generated by them, respecti vely.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.354-367
• /
• 2010

There are many methods for analyzing patterns in time series data. Although stock data represents a time series, there are few studies on stock pattern analysis and prediction. Since people believe that stock price changes randomly we cannot predict stock prices using a scientific method. In this paper, we measured the degree of the randomness of stock prices using Kolmogorov complexity, and we showed that there is a strong correlation between the degree and the accuracy of stock price prediction using our semi-global alignment method. We transformed the stock price data to quantized string sequences. Then we measured randomness of stock prices using Kolmogorov complexity of the string sequences. We use KOSPI 690 stock data during 28 years for our experiments and to evaluate our methodology. When a high Kolmogorov complexity, the stock price cannot be predicted, when a low complexity, the stock price can be predicted, but the prediction ratio of stock price changes of interest to investors, is 12% prediction ratio for short-term predictions and a 54% prediction ratio for long-term predictions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.302-313
• /
• 2003

Currently, DTD(Document Type Definition) Definition of Music score has been widely studied according to applications, and the methods of automatic transformation from defined DTD to XML Schema is in progress. In addition, studies of structure of DTD definition are focused on the expression of music information by individual format. In this paper, expression method of the music information by continuous string values is suggested using the fact that measure is basically a component of score, and XML Schema is also modelled. In addition, mechanism extracting the music information from XML instance which was expressed using the proposed method is presented. As a result, XML Schema taking the continuous string values could be defined, instance obtained by the proposed method results in increasing efficiency by simplicity of XPATH and reduction of search step compared to previous method. In addition, it is possible for human to make direct expression, and it is known that the instance size decreases.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.16 no.1
• /
• pp.1-8
• /
• 2010

Objective: Various controlled vocabulary such as thesaurus and classification make us to reuse and share effectively by defining different concept and linking terms each other. The UMLS(Unified Medical Language System) is one of the most universal medical terminology systems. It is needed various methods to share and reuse information of traditional Korean medicine. We will research on method that adopt SUI of the UMLS(that is de facto standard in medical terminology system) in traditional Korean medical terminology. Method: We described major problems and applying process when we tried to add traditional Korean medicine in the part of meridian into the UMLS metathesaurus. Comparing western medical terms and traditional Korean medical terms for applying UMLS metathesaurus, there is not only many consistency, but also differences. Result: We confirmed what is the differences and consistency between western medical terms and traditional Korean medical terms. And then reviewed methods that apply the CUI, LUI, SUI in traditional Korean medical terms. Traditional Korean medical terms are not discriminated by singular or plural string. In addition, traditional Korean medical terms have vary string by initial law: the law of initial sound of a syllable. Character is described with Korean, traditional Chinese, modern Chinese, etc. According to meaning, language, initial law, SUI has a distinct value respectively. Conclusion: There are many differences to apply the UMLS between western medical terms and traditional Korean medical terms. For the better implementation to traditional Korean medicine into the UMLS, further research is needed in standardization and classification of traditional Korean medical terms, medical information system, etc. We hope this study helps the implementation UMLS, EHR, knowledge based system in Oriental medicine in the future.