• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.158-162
• /
• 2009

Sound effects coming with appropriate tactile stimuli can strengthen its reality. For example, gunfire in games and movies, if it is accompanied by vibrating effects, can enhance the impressiveness. On a similar principle, adding the vibration information to existing sound data file and playing sound while generating vibration effects through haptic interfaces can augment the sound experience. In this paper, we propose a method to generate vibration information by analyzing the sound. The vibration information consists of vibration patterns and the timing within a sound file. Adding the vibration information is labor-intensive if it is done manually. We propose a sound detection algorithm to search the moments when specific sounds occur in a sound file and a method to create vibration effects at those moments. The sound detection algorithm compares the frequency characteristic of specific sounds and finds the moments which have similar frequency characteristic within a sound file. The detection ratio of the algorithm was 98% for five different kinds of gunfire. We also develop a GUI based vibrating pattern editor to easily perform the sound search and vibration generation.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.725-732
• /
• 2009

Thanks to the development of the Internet, people can easily access a vast amount of music. This brings attention to application systems such as a melody-based music search service or music recommendation service. Extracting melodies from music is a crucial process to provide such services. This paper introduces a novel algorithm that can extract melodies from piano music. Since piano can produce polyphonic music, we expect that by studying melody extraction from piano music, we can help extract melodies from general polyphonic music.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.186-193
• /
• 2003

In recent years the complexity of digital systems has increased dramatically. Although semiconductor manufacturers try to ensure that their products are reliable, it is almost impossible not to have faults somewhere in a system at any given time. As complexity of circuits increases, the necessity of more efficient organized and automated methods for test generation is growing. But, up to now, most of popular and extensive methods for test generation nay be those which sequentially produce an output for an input pattern. They inevitably require a lot of time to search each fault in a system. In this paper, corresponding test patterns are generated through the partitioning method among those based on the exhaustive method. In addition, the method, which can discovers faults faster than other ones that have been proposed ever by inserting a pattern in parallel, is designed and implemented.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.341-351
• /
• 2004

With the popularity of digital audio contents, querying and retrieving audio contents efficiently from database has become essential. In this paper, we propose a new index scheme for retrieving audio contents efficiently using audio portions that have been queried frequently. This scheme is based on the observation that users have a tendency to memorize and query a small number of audio portions. Detecting and indexing such portions enables fast retrieval and shows better performance than sequential search-based audio retrieval. Moreover, this scheme is independent of underlying retrieval system, which means this scheme can work together with any other audio retrieval system. We have implemented a prototype system and showed its performance gain through experiments.

• Preventive Nutrition and Food Science
• /
• v.3 no.2
• /
• pp.111-118
• /
• 1998

To develop a simple, rapid and simultaneous analytical method of phenolic compounds using gas chromatography (GC) and gas chromatography/mass spectrophometer (GC/Ms), this experiment was carried out to search the retention times of capillary columns and the characteristics of fragment ions in electron impact mass spectra. Most of trimethylsilyl derivatives and underivatized phenolic compounds were separated very well on three kinds of capillary columns(HP-1), Ultra-2 and HP-35). Quantitiative determination of phenolic compounds was achieved by internal standards (p-hydroxybenzoic acid iopropyl ester, p-hydroxybenzoic acid ethyl ester). Calibration plts were linear in the investigated range, and the limits of detection were about 5 ng at split mode method. When analyzed by three columns, theseparation times were fairly constant on two nonpolar columns, but a few compounds showed slightly different separation order by the itnermediate polar HP-35 column. The important characteristic patterns of TMS derivatives of phenolic compounds on the EI/MS spectrra appeared at the base peak of [M-15]+ ion and presented at high abundance in most TMS derivatives of phenoloc compounds. [M]+, [M-CH3-COO]+, [M-Si(CH3)4]+ and [M-Si(CH3)4 -CH3]+ also observed in mass spectra of these compounds . Although several compounds have the same retention times on GC column, it might be possible to identify these compounds by the different patternsof mass frgement ions. The TMS derivatives, thus , provide additional information for identification of phenolic compounds in biological systems.

• Imaging Science in Dentistry
• /
• v.51 no.4
• /
• pp.351-361
• /
• 2021

Purpose: The clivus is a region in the anterior section of the occipital bone that is commonly imaged on large-volume cone-beam computed tomography (CBCT). There have been several reports of incidental clivus variations and certain pathological entities that have been attributed to the variations. This study aimed to evaluate the effects of these variations within the scope of dentistry. Materials and Methods: Medical databases (PubMed, Scopus, and Web of Science) were searched using a controlled vocabulary (clival anomalies, cone-beam CT, canalis basilaris medianus, fossa navicularis magna, clival variation). The search was limited to English language, humans, and studies published in the last 25 years. The articles were exported into RefWorks^® and duplicates were removed. The remaining articles were screened and reviewed for supporting information on variations of the clivus on CBCT imaging. Results: Canalis basilaris medianus and fossa navicularis magna were the most common anomalies noted. Many of these variations were asymptomatic, with most patients unaware of the anomaly. In certain cases, associated pathologies ranged from developmental (Tornwaldt cyst), to acquired (recurrent meningitis). While no distinct pathognomonic aspects were noted, there were unique patterns of radiographic diagnosis and treatment modalities. Most patients had a normal course of follow-up. Conclusion: Interpretation of CBCT volumes is a skill every dentist must possess. When reviewing large-volume CBCT scans, the clinician should be able to distinguish pathology from normal anatomic variations within the skull base. The majority of clivus variations are asymptomatic and will remain undetected unless incidentally noted on radiographic examinations.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.718-722
• /
• 2008

Ontology plays an important role of the Semantic Web to describe meaning and reasoning of resources. Ontology has more rich expressive power through OWL that is a next standard representation language recommended by W3C. As the Semantic Web is widely known, an amount of information resources on the Web is growing rapidly and the related information resources are placed in distributed systems on the Web. So, for providing seamless services without the awareness of far distance, efficient management of the distributed information resources is required. Especially, sear ching fast for local repositories that include data related to user's queries is important to the performance of systems in the distributed environment. In this paper, first, we propose an index structure to search local repositories related to queries in the distributed Semantic Web. Second, we propose a query rewriting strategy to extend given user's query using various expression of OWL. Through the proposed index and query strategy, we can utilize various expressions of OWL and find local repositories related to all query patterns on the Semantic Web.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.423-431
• /
• 2010

In this paper, a modified sum-product algorithm to correct bit errors captured within the trapping sets, which are produced in decoding of low-density parity-check (LDPC) codes, is proposed. Unlike the original sum-product algorithm, the proposed decoding method consists of two stages. Whether the main cause of decoding failure is the trapping sets or not is determined at the first stage. And the bit errors within the trapping sets are corrected at the second stage. In the modified algorithm, the set of failed check nodes and the transition patterns of hard-decision bits are exploited to search variable nodes in the trapping sets. After inverting information of the variable nodes, the sum-product algorithm is carried out to correct the bit errors. As a result of simulation, the proposed algorithm shows continuously improved error performance with increase in the signal-to-noise ratio. It is, therefore, considered that the modified sum-product algorithm significantly reduces or possibly eliminates the error floor in LDPC codes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.407-411
• /
• 2007

Over the years, great attention has been paid to the question of exploiting inherent semantic of HTML in the area of web document retrieval. Although HTML is mainly presentation oriented, HTML tags implicitly contain useful semantics that can be catch meaning of text. Focusing on this idea. in this paper we define 'markup pattern' and try to improve performance of web document retrieval using markup patterns. Markup pattern is a mirror of intends of web document publisher and an internal semantic of text on web document. To discover the markup pattern and exploit it, we suggest a new scheme for extracting concepts and weighting documents. For evaluation task, we select two domains-BBC and CNN web sites, and use their search engines to gather domain documents. We re-weight and re-score documents using proposed scheme, and show the performance improvement in the two domains.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.3
• /
• pp.14-28
• /
• 2010

The aim of this study is to investigate crime hotspot areas using the spatio-temporal cluster analysis which is possible to search simultaneously time range as well as space range as an alternative method of existing hotspot analysis only identifying crime occurrence distribution patterns in urban area. As for research method, first, crime data were collected from criminal registers provided by official police authority in M city, Gyeongnam and crime occurrence patterns were drafted on a map by using Geographic Information Systems(GIS). Second, by utilizing Ripley K-function and Space-Time Scan Statistics analysis, the spatio-temporal distribution of crime was examined. The results showed that the risk of crime was significantly clustered at relatively few places and the spatio-temporal clustered areas of crime were different from those predicted by existing spatial hotspot analysis such as kernel density analysis and k-means clustering analysis. Finally, it is expected that the results of this study can be not only utilized as a valuable reference data for establishing urban planning and crime prevention through environmental design(CPTED), but also made available for the allocation of police resources and the improvement of public security services.