• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.31-37
• /
• 2001

Matched Field Processing (MFP) is a successive process of correcting mismatches between true and assumed parameters by matching the measured acoustic field data with numerically simulated data which we call replica. The MFP is widely used both in geo-acoustic parameter inversions and in source localizations. Whether a certain parameter can be inverted effectively or whether a source can be localized correctly depends on the amount of the influence that a parameter has on the acoustic field during the matching process. Sensitive parameters can be better estimated than the less sensitive ones in MFP. On the contrary, the sensitive parameters affect adversely on the source localization results when they have uncertainties. In this paper, a sensitivity index is defined based upon the field variation resulting from the perturbed parameters. Numerical test results show that the index behaves in accordance with the results of source localization under a mismatched environment and also with the inversion solutions.

• MALSORI
• /
• no.43
• /
• pp.113-125
• /
• 2002

As there are needs to search the Web information via wire or wireless telephones, VoiceXML forum was established to develop and promote the Voice eXtensible Markup Language (VoiceXML). VoiceXML simplifies the creation of personalized interactive voice response services on the Web, and allows voice and phone access to information on Web sites, call center databases. Also, it can utilize the Web-based technologies, such as CGI(Common Gateway Interface) scripts. In this paper, we have developed the voice portal service platform based on VoiceXML called TeleGateway. It enables integration of voice services with data services using the Automatic Speech Recognition (ASR) and Text-To-Speech (TTS) engines. Also, we have showed the various services on voice portal services.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.697-699
• /
• 2004

Stochastic Neighbor Embedding(SNE) is a probabilistic method of mapping high-dimensional data space into a low-dimensional representation with preserving neighbor identities. Even though SNE shows several useful properties, the gradient-based naive SNE algorithm has a critical limitation that it is very slow to converge. To overcome this limitation, faster optimization methods should be considered by using trust region method we call this method fast TR SNE. Moreover, this paper presents a couple of useful optimization methods(i.e. conjugate gradient method and Newton's method) to embody fast SNE algorithm. We compared above three methods and conclude that TR-SNE is the best algorithm among them considering speed and stability. Finally, we show several visualizing experiments of TR-SNE to confirm its stability by experiments.

• Proceedings of the CALSEC Conference
• /
• 1998.10b
• /
• pp.415-422
• /
• 1998

The international standard STEP for representation and exchange of product model data, and CORBA as a standard for distributed object computing environment are expected to play very important role in the future manufacturing environment. Platform independent network programming language Java is also becoming a standard environment for developing Internet/Intranet applications. Furthermore, the ObjectWeb environment supported by the combination of CORBA and Java technology provides very efficient and convenient way of developing network applications and user interfaces. In this research, we developed a framework for the real time sharing of STEP data and 3D conference in the ObjectWeb environment and tested our proposal by implementing prototype software which we call STEPShare.

• Phonetics and Speech Sciences
• /
• v.1 no.2
• /
• pp.15-22
• /
• 2009

Prominence of speech, which is often called 'accent,' affects the fluency of speaking American English greatly. In this paper, we present an accurate prominence detection method that can be utilized in computer-aided language learning (CALL) systems. We employed pitch movement, overall syllable energy, 300-2200 Hz band energy, syllable duration, and spectral and temporal correlation as features to model the prominence of speech. After the features for vowel syllables of speech were extracted, prominent syllables were classified by SVM (Support Vector Machine). To further improve accuracy, the differences in characteristics of neighboring syllables were added as additional features. We also applied a speech recognizer to extract more precise syllable boundaries. The performance of our prominence detector was measured based on the Intonational Variation in English (IViE) speech corpus. We obtained 84.9% accuracy which is about 10% higher than previous research.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.264-267
• /
• 1998

We are dealing with the preliminary diagnosis from the information of headache interview chart. We quantify the qualitative information based on the interview chart by dual scaling. Prototype of fuzzy diagnostic sets and the neural linear regression methods are established with these quantified data, These new methods can be used to classify new patient's tone of diseases with certain degrees of belief and its concerned symptoms. We call these procedures as neural Fuzzy Differential Diagnosis of Headache (NFDDH-1). Also we investigate three measures to medical diagnosis, where relations between symptoms and diseases are described by intutionistic fuzzy set (IFS) data. Two measures are described by nin-max and max-min IFS operators, respectively. Another measure is the similarity degree, i.e., IFS distance between patient's symptoms and prototypes of diseases. We consider some reasonable criteria for three measures in order to determine the label of headache, We will establish hree measures in NFDDH-2 and combine two packages as NFDDH

• Communications of Mathematical Education
• /
• v.29 no.3
• /
• pp.301-311
• /
• 2015

If the storytelling Mathematics is teaching Mathematics by making and telling stories on Mathematics, the storymaking with Mathematics is that teachers(or mathematicians) who wish to develop their opinions concerning about their interesting fields apply them into a real life. They can use mathematical consequences for their arguments. I'll call it 'storymaking'. It could let the general public know that studying Mathematics is useful. So this application is helpful to the popularization of Mathematics.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.218-225
• /
• 2007

Recommendation system is one way of implementing personalized service. The collaborative filtering is one of the major techniques that have been employed for recommendation systems. It has proven its effectiveness in the recommendation systems for such domain as motion picture or music. However, it has some limitations, i.e., sparsity and scalability. In this research, as one way of overcoming such limitations, we proposed the stepwise collaborative filtering method. To show the practicality of our proposed method, we designed and implemented a movie recommendation system which we shall call Step_CF, and its performance was evaluated using MovieLens data. The performance of Step_CF was better than that of Basic_CF that was implemented using the original collaborative filtering method.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1700-1708
• /
• 2006

Since the most program execution time is consumed in a loop structure, extracting parallelism from loop programs is critical for the taster program execution. In this paper, we proposed data dependency removal method for a single loop. The data dependency removal method can be applied to uniform and non-uniform data dependency distance in the single loop. Procedure calls parallelisms with only a single loop structure or procedure call most of other methods are concerned with the uniform code within the uniform data dependency distance. We also propose an algorithm, which can be applied to uniform, non-uniform, and complex data dependency distance among the multiple procedures. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithm is effective.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.3
• /
• pp.59-74
• /
• 2002

This study investigates two basic operations of mobility management of PCNs (Personal Communication Networks), i.e., the location update and the paging of the mobile terminal. From the realistic consideration that a user either moves through several cells consecutively or stays in a cell with long time, we model the mobility pattern by introducing two types of CRT (Cell Residence Time). Mobility patterns of the mobile terminal are classified Into various ways by using the ratios of two types of CRT. Cost analysis is performed for distance-based and movement-based location update schemes combined with blanket polling paging and selective paging scheme. It is demonstrated that in a certain condition of mobility pattern and call arrival pattern, 2-state CRT model produces different optimal threshold and so, is more effective than IID ( Independently-Identically-Distributed) CRT model. An analytical model for the new CRT model is compact and easily extendable to the other location update schemes.