• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1995.04a
• /
• pp.114-114
• /
• 1995

이 연구에서는 혈전증 치료에 사용되는 혈전 응해제를 국내 독사독으로부터 개발하기 위한 실험을 실시하였다. 그 내용을 요약하면 다음과 같다. 국내에 서식하는 독사인 Agkistrodon blomoffi brevicaudus, Agkistrodon caliginosus와 Agkistrodon saxatilis에서 각각 사독을 채취하여 fibrin plate 방법으로 fibrin 분해능을 조사하여 Agkistrodon blomoffi brevicaudus의 독이 분해능이 가장 우수함을 밝혔다. 이와 같은 사실에 기초하여 A. blomoffi brevicaudus의 독으로부터 p-Aminobenzamidine affinity chromatography와 DEAE ion-exchange chromatography를 이용하여 분자량이 50.8 kDa인 황성 단백질을 정제하였다. 위에서와 같은 방법으로 정제한 단백질은 fibrin 분해능이 우수하고 fibrinogen의 ${\gamma}$ chain은 분해하지 않으나 B$\beta$ chain을 $A\alpha$ chain에 비하여 보다 선택적으로 분해하는 단백분해 효소임을 증명하였다. 이 정제 효소의 Fibrin에 대한 분해능은 266$\mu\textrm{g}$/${\mu}\ell$의 농도에서 Plasmin 1.0 unit (=3.0 WHO unit)보다 높게 나타났다. 정제된 효소는 chromogenic substrate인 N-Benzoyl-Phe-Val-Arg-pNA와 N-p-Tosyl- Gly-Pro-Arg-pNA의 arginine carboxyl side를 분해하고 pH 7.5에서 최대 활성을 보이며, Vmax는 5.46 umo1/1ㆍmin이고, Km 값은 0.20mM이며, 그리고 Cu$^{2+}$, $Zn^{2+}$, soybean trypsin inhibtor에 의해 25～50% 정도, serine proteinase inhibitor인 phenylmethylsulfonyl floride에 의해 80%정도 활성이 억제되는 특성이 있음을 규명하였다.

• Science of Emotion and Sensibility
• /
• v.4 no.2
• /
• pp.33-38
• /
• 2001

This analysis has been projected as a preliminary analysis to develop the therapy program for people who is suffering from stress disorder after car accident such as sense of fear or anxiety using virtual reality. The analysis verified the effect of driving scenario which is core technology of stress disorder program and of anxiety reduction training such as relaxation training through clients. The relaxation training has been tested to 8 people; 7 normal and 1 sufferer from car accident presenting them 3 different types of driving scenarios. As a result, relaxation training was effective but, it was not statistically good enough although it showed incensement of uneasiness by each different driving scenario. In spite of normal clients, it is interesting that anxiety lever after relaxation training using VR is lowered, but this result need to verify to client suffering real car accident.

• School Mathematics
• /
• v.11 no.1
• /
• pp.39-53
• /
• 2009

This study was conducted in 2008 with 80 in-service mathematics teachers. We took a course that was consisted of a lecture and a practice on Socrates' method. In our study, mathematics teachers conducted making a teaching plan by using Socrates' method. But we became know that we need to offer concrete ideas or examples for mathematics teachers in order to apply Socrates' method effectively. Therefore we tried to search for educational methods in using Socrates' method to teach school mathematics. After investigating of preceding researches, we selected some examples. On the basis of these examples, we suggested concrete methods in using Socrates' method. That is as follows. Socrates' method need to be used in the context mathematical problem solving. Socrates' method can be applied in the process of overcoming cognitive obstacles. A question in using Socrates' method have to guide mathematical thinking (or attitude). When we use Socrates' method in the teaching of a proof, student need to have an opportunity to guess the conclusion of a proposition. The process of reflection revision-improvement can be connected to using Socrates' method.

• Journal of Internet Computing and Services
• /
• v.18 no.5
• /
• pp.23-30
• /
• 2017

For enjoying the convenience provided by location based services, the user needs to submit his or her location and query to the LBS server. So there is a probability that the untrusted LBS server may expose the user's id and location etc. To protect user's privacy so many approaches have been proposed in the literature. Recently, the approaches about using dummy are getting popular. However, there are a number of things to consider if we want to generate a dummy. For example, when generating a dummy, we have to take the obstacle and the distance between dummies into account so that we can improve the privacy level. Thus, in this paper we proposed an efficient dummy generation algorithm to achieve k-anonymity and protect user's privacy in LBS. Evaluation results show that the algorithm can significantly improve the privacy level when it was compared with others.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.99-106
• /
• 2008

Recently, digital music retrieval is using in many fields (Web portal. audio service site etc). In existing fields, Meta data of music are used for digital music retrieval. If Meta data are not right or do not exist, it is hard to get high accurate retrieval result. Contents based information retrieval that use music itself are researched for solving upper problem. In this paper, we propose Same music recognition method using similarity measurement. Feature data of digital music are extracted from waveform of music using Simplified MFCC (Mel Frequency Cepstral Coefficient). Similarity between digital music files are measured using DTW (Dynamic time Warping) that are used in Vision and Speech recognition fields. We success all of 500 times experiment in randomly collected 1000 songs from same genre for preying of proposed same music recognition method. 500 digital music were made by mixing different compressing codec and bit-rate from 60 digital audios. We ploved that similarity measurement using DTW can recognize same music.

• Journal of Digital Contents Society
• /
• v.18 no.8
• /
• pp.1621-1626
• /
• 2017

This study conducts data visualization of common climax patterns of Korean blockbuster films to analyze shots and evaluate scene (subplot unit) arrangement. For this purpose, a model of editing patterns is used to analyze how many climax patterns a film contains. Moreover, a system, which automatically collects shot images and classifies shot sizes of collected data, is designed to demonstrate that a single scene is composed based on a climax pattern. As a scene is a subplot and thus its arrangement cannot fully be analyzed only by climax patterns, dialogues of starring actors are also used to identify scenes, and the result is compared with data visualization results. It detects dialogues between particular actors and visualizes dialogue formation in a network form. Such network visualization enables the arrangement of main subplots to be analyzed, and the box office performance of a film can be explained by the density of subplots. The study of two types comparison analysis is expected to contribute to planning, plotting, and producing films.

• Journal of Digital Convergence
• /
• v.8 no.4
• /
• pp.35-46
• /
• 2010

Since the major requisite of software production is manpower, the core element of the competitive power of software is also manpower. However, economic treatments and social status of software manpower are in a very unsatisfactory situation. While Korean government has been continuing to drive the policy to foster the local software industry, the most cultivating policies of software industry are adjusted to the focus to create the local market in software field, reinforce the global competitive power, and intensify the competitive basis of small and medium size business organizations. So it is true that manpower which is key players and core elements of the software industry, have been shunned by the government policy. The purpose of this study is to initiate the necessity of the policy for technical manpower in the software industry and to suggest a policy program to uplift the treatment of them. To achieve this purpose, this paper will analyze the structural relation between variables about software policy and suggest policy programs to improve the treatment of manpower in the software field.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.531-542
• /
• 2002

As most of metadata have been handled on restricted applications, we need a same metadata in order to represent a same video data. However, these metadata make problems that the same video data should be supported by the same metadata. Therefore, in this paper, we extend the Dublin core elements to support the metadata which can solve the problems. The proposed video data representation is managed by the extended metadata of Doblin core model, by using the information of structure, content and manipulation of video data. The thirteen temporal relationship operators are reduced to the six temporal relationship operators by using a dummy shot temporal transformation relationship. The reduced six temporal relationship operators through excluding reverse temporal relationship not only maintain a consistency of representation between a metadata and a video data, but also transform n-ary temporal relationship to binary relationship on shots. We show that the proposed metadata model can be applied to representing and retrieving on various applications as equivalent as the same structure.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.108-118
• /
• 2005

The software of the nuclear power plant digital control system is a safety-critical system where many techniques must be applied to it in order to preserve safety in the whole system. Formal specifications especially allow the system to be clearly and completely specified in the early requirements specification phase, therefore making it a trusted method for increasing safety. In this paper, we discuss a systematic method, which generates PLC-based FBD programs from the requirements specification using NuSCR, a formal requirements specification method. This FBD programs takes an important position in design specification. The proposed method can reduce the possible errors occur in the manual design specification, and the software development cost and time. To investigate the usefulness of our proposed method, we introduce the fixed set-point rising trip example, a trip logic of BP in DPPS RPS, which is presently being developed at KNICS.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.587-598
• /
• 2002

In multicast environment, the main objective of group key management is to provide security services to group communications by sharing a single group key among all the members of the group and subsequently encrypting and decrypting all the communication messages exchanged among the members of the group. Up to now, there has been no effort to develop group key management mechanism that considers the rate of users' join/leave operations. Hence, in this research, we propose group key management mechanisms that consider the rate of user's join/leave operations. We also define a new tree structure called variable tree which is much more flexible than full regular trees and show that variable trees are more efficient than full regular trees for group key management. Especially, we propose an algorithm that minimizes the necessary number of rekey messages according to the rate of join and leave operations. We also shows that if the rate of leave operation is greater than 50%, then the tree structure with degrees 2 or 3 are the optimal structures.