• Journal of the Korean Geophysical Society
• /
• v.3 no.4
• /
• pp.251-260
• /
• 2000

Applicabilities of two numerical methods, the 2-dimensional and the 3-dimensional method, are evaluated to inverse test results obtained from the underwater SASW(Spectral -Analysis-of-Surface-Waves) method. As a result of this study, it has been found that the 2-dimensional method can supposed to be applicable for the cases where stiffness of soil layer increases gradually with depth, and the stiffness is relatively low. For the other cases, however, it has been concluded that the 3-dimensional method needs to be applied to determine realistic theoretical dispersion curves. An example is also shown that in situ soil profile underwater is estimated from experimental dispersion curves using the 3-dimensional method. As a results, it can be concluded that the underwater SASW method can be effectively applied to explore the underwater soil condition.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.767-777
• /
• 1999

인과적 메시지 로깅 기법은 정상프로세스를 역전(roll-back)시키거나 메시지의 저장을 위해 프로세스의 수행을 중단시키지 않는 장점을 지니고 있지만, 메시지의 크기가 지나치게 커진다는 단점을 지니고 있다. 본 논문에서는 인과적 메시지 로깅 기법의 이러한 문제점을 해결하기 위하여 로그 상속의 개념을 정의하고 로그 연혁을 이용하여 로그 비용, 특히 로그 크기 면에서 효율적인 로깅 기법을 제안한다. 또한 이 로깅 알고리즘을 이용하여 복구시 메시지의 수와 크기를 줄여 복구시간을 줄이는 효율적인 복구 알고리즘을 제안하고, 제안한 알고리즘이 메시지 로그 크기 면에서 효율적임을 증명한다. 또 제안한 알고리즘의 성능을 검증하기 위하여 두 가지 종류의 모의 실험을 수행하여 기존의 로깅 프로토콜과 메시지 크기 면에서의 성능을 비교한 결과를 제시하였다.Abstract Causal message logging has many good properties such as nonblocking message logging and no rollback propagation. However, it requires a large amount of information to be piggybacked on each message, which may incur severe performance degradation. This paper presents an efficient causal logging algorithm based on the new message log structure, LogOn, which represents the causal inter-process dependency relation with much smaller overhead compared to the existing algorithms. The proposed algorithm is efficient in the sense that it entails no additional information other than LogOn to be carried in each message, while other existing algorithms require extra information other than the message logs. This paper also presents an efficient recovery algorithm to solve the problem of a large amount of data exchanges during the recovery. To verify the performance of our algorithm, we give an analysis of the algorithm and perform two simulations and compare the log size with other causal logging protocols.

• Geophysics and Geophysical Exploration
• /
• v.19 no.1
• /
• pp.11-19
• /
• 2016

Two representative residual static methods of traveltime decomposition and stack-power maximization are discussed in terms of application to land seismic data. For the model data with synthetic shot/receiver statics (time shift) applied and random noises added, continuities of reflection event are much improved by stack-power maximization method, resulting the derived time-shifts approximately equal to the synthetic statics. Optimal parameters (maximum allowable shift, correlation window, iteration number) for residual statics are effectively chosen with diagnostic displays of CSP (common shot point) stack and CRP (common receiver point) stack as well as CMP gather. In addition to removal of long-wavelength time shift by refraction statics, prior to residual statics, processing steps of f-k filter, predictive deconvolution and time variant spectral whitening are employed to attenuate noises and thereby to minimize the error during the correlation process. The reflectors including horizontal layer of reservoir are more clearly shown in the variable-density section through repicking the velocities after residual statics and inverse NMO correction.

• Science of Emotion and Sensibility
• /
• v.16 no.3
• /
• pp.409-416
• /
• 2013

Attention is one of important cognitive functions in human affecting on the selectional concentration of relevant events and ignorance of irrelevant events. The discrimination of attentional and inattentional status is the first step to manage human's attentional capability using computer assisted device. In this paper, we newly combine the non-linear recurrence pattern analysis and spectrum analysis to effectively extract features(total number of 13) from the electroencephalographic signal used in the input to classifiers. The performance of diverse types of attention-inattention classifiers, including supporting vector machine, back-propagation algorithm, linear discrimination, gradient decent, and logistic regression classifiers were evaluated. Among them, the support vector machine classifier shows the best performance with the classification accuracy of 81 %. The use of spectral band feature set alone(accuracy of 76 %) shows better performance than that of non-linear recurrence pattern feature set alone(accuracy of 67 %). The support vector machine classifier with hybrid combination of non-linear and spectral analysis can be used in later designing attention-related devices.

• Investigative Magnetic Resonance Imaging
• /
• v.11 no.1
• /
• pp.1-9
• /
• 2007

The obstacles for cardiac imaging are motion artifacts due to cardiac motion, respiration, and blood flow, and low signal due to small tissue volume of heart. To overcome these obstacles, fast imaging technique with ECG gating is utilized. Cardiac exam using MRI comprises of morphology, ventricular function, myocardial perfusion, metabolism, and coronary artery morphology. During cardiac morphology evaluation, double and triple inversion recovery techniques are used to depict myocardial fluidity and soft tissue structure such as fat tissue, respectively. By checking the first-pass enhancement of myocardium using contrast-enhanced fast gradient echo technique, myocardial blood flow can be evaluated. In addition, delayed imaging in 10 - 15 minutes can inform myocardial destruction such as chronic myocardial infarction. Ventricular function including regional and global wall motion can be checked by fast gradient echo cine imaging in quantitative way. MRI is acknowledged to be practical for integrated cardiac evaluation technique except coronary angiography. Especially delay imaging is the greatest merit of MRI in myocardial viability evaluation.

• Journal of KIISE:Software and Applications
• /
• v.29 no.3
• /
• pp.145-155
• /
• 2002

In content-based image retrieval (CBIR), most conventional approaches assume a linear relationship between different features and require users themselves to assign the appropriate weights to each feature. However, the linear relationship assumed between the features is too restricted to accurately represent high-level concepts and the intricacies of human perception. In this paper, a neural network-based image retrieval (NNIR) model is proposed. It has been developed based on a human-computer interaction approach to CBIR using a radial basis function network (RBFN). By using the RBFN, this approach determines the nonlinear relationship between features and it allows the user to select an initial query image and search incrementally the target images via relevance feedback so that more accurate similarity comparison between images can be supported. The experiment was performed to calculate the level of recall and precision based on a database that contains 1,015 images and consists of 145 classes. The experimental results showed that the recall and level of the proposed approach were 93.45% and 80.61% respectively, which is superior than precision the existing approaches such as the linearly combining approach, the rank-based method, and the backpropagation algorithm-based method.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.2
• /
• pp.33-40
• /
• 2003

Criticality prediction models that determine whether a design entity is fault-prone or non fault-prone play an important role in reducing system development costs because the problems in early phases largely affect the quality of the late products. Real-time systems such as telecommunication systems are so large that criticality prediction is mere important in real-time system design. The current models are based on the technique such as discriminant analysis, neural net and classification trees. These models have some problems with analyzing causes of the prediction results and low extendability. This paper builds a new prediction model, GAM, based on Genetic Algorithm. GAM is different from other models because it produces a criticality function. So GAM can be used for comparison between entities by criticality. GAM is implemented and compared with a well-known prediction model, BackPropagation neural network Model(BPM), considering Internal characteristics and accuracy of prediction.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.773-784
• /
• 2001

Since documents on the Web are naturally partitioned into may document database, the efficient information retrieval process requires identifying the document database that are most likely to provide relevant documents to the query and then querying the identified document database. We propose a neural net agent approach to such an efficient information retrieval. First, we present a neural net agent that learns about underlying document database using the relevance feedbacks obtained from many retrieval experiences. For a given query, the neural net agent, which is sufficiently trained on the basis of the BPN learning mechanism, discovers the document database associated with the relevant documents and retrieves those documents effectively. In the experiment, we introduce a neural net agent based information retrieval system and evaluate its performance by comparing experimental results to those of the conventional well-known approaches.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.13-22
• /
• 2013

Smartphone addiction has become more serious than internet addiction since people can download and run numerous applications with smartphones even without internet connection. However, smartphone addiction is not sufficiently dealt with in current studies. The S-scale method developed by Korea National Information Society Agency involves so many questions that respondents are likely to avoid the diagnosis itself. Moreover, since S-scale is determined by the total score of responded items without taking into account of demographic variables, it is difficult to get an accurate result. Therefore, in this paper, we have extracted important factors from all data, which affect smartphone addiction, including demographic variables. Then we classified the selected items with a neural network. The result of a comparative analysis with backpropagation learning algorithm and multiclass support vector machine shows that learning rate is slightly higher in multiclass SVM. Since multiclass SVM suggested in this paper is highly adaptable to rapid changes of data, we expect that it will lead to a more accurate self-diagnosis of smartphone addiction.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.