• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.107-127
• /
• 2002

Database system parameter tuning is one of database system tuning that achieve to improve performance of database system with application program tuning and data model tuning. By parameter tuning adjusts value of entry that is staled in data dictionary's parameter file that is included to database system, it is thing which make relevant database system can display performance of most suitable. And, it is that achievement is one o( possible tuning method immediately without occurrence of additional expense or involved hardware for database system performance elevation and ashes composition of software. But, it is actuality that administration about parameter practical use is not achieved, and is using Default Value of parameter that database management system offers just as it is systematically. So, this paper presents parameter tuning process that can ：achieve Parameter tuning of database system that is operating present systematically, and parameter tuning process each activity important input urea and tuning achievement product. And explain about effect and result that happen by sort database system performance and parameters that it is affinity systematically, and grasp relationships between parameter, and change parameter of string database system. And not that parameter uses contents that specify by fixing when establish database administration system, is going to emphasize and explain that must utilize changing continuously during database system operation. It changes parameter entry value how in various kinds different operation environment and present if must apply, and will arrange effect that this parameter enoy value alteration gets in performance liking into account point that is actuality that is using parameter that define database administrators when install the database system just as it is continually without alteration.

• Journal of Biomedical Engineering Research
• /
• v.12 no.4
• /
• pp.267-276
• /
• 1991

This paper describes syntactic pattern recognition algorithm for pattern recognition and diagnostic parameter extraction of ECG signal. ECG signal which is represented linguistic string is evaluated by pattern grammar and its interpreter-LALR(1) parser for pattern recognition. The proposed pattern grammar performs syntactic analysis and semantic evaluation simultaneously. The performance of proposed algorithm has been evaluated using CSE database.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.352-365
• /
• 2009

Recently, data access control policies have not been applied for authorized or unauthorized persons properly and information leakage incidents have occurred due to database security vulnerabilities. In the traditional database access control methods, administrators grant permissions for accessing database objects to users. However, these methods couldn't be applied for diverse access control policies to the database. In addition, another database security method which uses data encryption is difficult to utilize data indexing. Thus, this paper proposes an enhanced database access control system via a packet analysis method between client and database server in network to apply diverse security policies. The proposed security system can be applied the applications with access control policies related to specific factors such as date, time, SQL string, the number of result data and etc. And it also assures integrity via a public key certificate and MAC (Message Authentication Code) to prevent modification of user information and query sentences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.722-733
• /
• 2012

Recently various studies on various applications using images taken by mobile phone cameras have been actively conducted. This study proposes a correction method for misrecognition of Korean Texts in signboard images using improved Levenshtein metric. The proposed method calculates distances of five recognized candidates and detects the best match texts from signboard text database. For verifying the efficiency of the proposed method, a database dictionary is built using 1.3 million words of nationwide signboard through removing duplicated words. We compared the proposed method to Levenshtein Metric which is one of representative text string comparison algorithms. As a result, the proposed method based on improved Levenshtein metric represents an improvement in recognition rates 31.5% on average compared to that of conventional methods.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.903-917
• /
• 1995

In most database systems images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Pertains proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on '2-D string. But this method needs too much storage space and lacks flexibility. In this paper, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.788-801
• /
• 2010

Advancing of mobile device is remarkable, so the research on mobile input device is getting more important issue. There are lots of input devices such as keypad, QWERTY keypad, touch and speech recognizer, but they are not as convenient as typical keyboard-based desktop input devices so input strings usually contain many typing errors. These input errors are not trouble with communication among person, but it has very critical problem with searching in database, such as dictionary and address book, we can not obtain correct results. Especially, Hangeul has more than 10,000 different characters because one Hangeul character is made by combination of consonants and vowels, frequency of error is higher than English. Generally, suffix tree is the most widely used data structure to deal with errors of query, but it is not enough for variety errors. In this paper, we propose fast approximate Korean word searching system, which allows variety typing errors. This system includes several algorithms for applying general approximate string searching to Hangeul. And we present profanity filters by using proposed system. This system filters over than 90% of coined profanities.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.1
• /
• pp.82-88
• /
• 2002

In this paper, we proposed a audio indexing method that is used wavelet transform for audio data retrieval. It is difficult for audio data to make a efficient audio data index because of its own particular properties, such as requirement of large storage, real time to transfer and wide bandwidth. An audio data in del using wavelet transform make it possible to index and retrieval by using the particular wavelet transform properties. Our proposed indexing method doesn't separate data to several blocks. Therefore we use both high-pass and low-pass parts of last level coefficient of wavelet transform. Audio data indexing is made by applying the string matching algorithm to high-pass part and zero-crossing histogram to low-pass part. These are transformed to the continued strings, Through this method, we described a retrieval efficiency. The retrieval method is done by comparing the database index string to the query string and then data of minimum values is chosen to the result. Our simulation decided proper comparative coefficient and made known changing of retrieval efficiency versus audio data length. The results show that the proposed method improves retrieval efficiency compared to conventional method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.634-640
• /
• 2013

Existing patterns and database search, string search unit search results for a lot of false positives, a simple search technique unreliable. In addition, the same conditions in addition to other search methods implemented due to wasted of resources and enforcement have been causing a waste of time. Therefore, regular expression and correlation analysis method by applying an integrated linkage information search module is to develop in this paper. From this, existing string search technique that has been noted as a problem by reducing the economic impact false positive and reliability to develop method that will information search secure.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.737-748
• /
• 2003

With the popularity of digital music contents, querying and retrieving music contents efficiently from database has become essential. In this paper, we propose a Fast Melody Finder (FMF) that can retrieve melodies fast and efficiently from music database using frequently queried tunes. This scheme is based on the observation that users have a tendency to memorize and query a small number of melody segments, and indexing such segments enables fast retrieval. To handle those tunes, FMF transcribes all the acoustic and common music notational inputs into a specific string such as UDR and LSR. We have implemented a prototype system and showed on its performance through various experiments.

• Genomics & Informatics
• /
• v.19 no.1
• /
• pp.4.1-4.9
• /
• 2021

Lip and oral cavity cancer, which can occur in any part of the mouth, is the 11th most common type of cancer worldwide. The major obstacles to patients' survival are the poor prognosis, lack of specific biomarkers, and expensive therapeutic alternatives. This study aimed to identify the main genes and pathways associated with lip and oral cavity carcinoma using network analysis and to analyze its molecular mechanism and prognostic significance further. In this study, 472 genes causing lip and oral cavity carcinoma were retrieved from the DisGeNET database. A protein-protein interaction network was developed for network analysis using the STRING database. VEGFA, IL6, MAPK3, INS, TNF, MAPK8, MMP9, CXCL8, EGF, and PTGS2 were recognized as network hub genes using the maximum clique centrality algorithm available in cytoHubba, and nine potential drug candidates (ranibizumab, siltuximab, sulindac, pomalidomide, dexrazoxane, endostatin, pamidronic acid, cetuximab, and apricoxib) for lip and oral cavity cancer were identified from the DGIdb database. Gene enrichment analysis was also performed to identify the gene ontology categorization of cellular components, biological processes, molecular functions, and biological pathways. The genes identified in this study could furnish a new understanding of the underlying molecular mechanisms of carcinogenesis and provide more reliable biomarkers for early diagnosis, prognostication, and treatment of lip and oral cavity cancer.