• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2001.05a
• /
• pp.15-19
• /
• 2001

This paper describes effectiveness and characteristics of 3 P(point) task analysis as a new Ergonomic and Kansei design method for extracting user demand especially. The key point in 3 P task analysis is to describe the flow of tasks and extract any problems in each task. A solution of a problem means a user demand. 3 P task analysis cal eliminate an oversight of check items by examining the users' information processing level. The suers' information processing level was divided into the following three stages for problem extraction: acquirement of information ---> understanding and judgment ---> operation. Three stages has fourteenth cues such as difficulty of seeing, no emphasis, mapping for extracting problems. To link analysis results to the formulation of a product concept. I added a column on the right side of the table for writing the requirements (user demand) to resolve the problems extracted from each task. The requirements are extracted by using seventh cues. Finally 3 P task analysis was compared with group interview to make the characteristics of 3 P task analysis, especially extracting user demand, clear.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.5-23
• /
• 2002

Motivation: Protein-protein interaction plays a critical role in the biological processes. The identification of interacting proteins by bioinformatical methods can provide new lead In the functional studies of uncharacterized proteins without performing extensive experiments. Results: Protein-protein interactions are predicted by a computational algorithm based on the weighted scoring system for domain interactions between interacting protein pairs. Here we propose potential interaction domain (PID) pairs can be extracted from a data set of experimentally identified interacting protein pairs. where one protein contains a domain and its interacting protein contains the other. Every combinations of PID are summarized in a matrix table termed the PID matrix, and this matrix has proposed to be used for prediction of interactions. The database of interacting proteins (DIP) has used as a source of interacting protein pairs and InterPro, an integrated database of protein families, domains and functional sites, has used for defining domains in interacting pairs. A statistical scoring system. named "PID matrix score" has designed and applied as a measure of interaction probability between domains. Cross-validation has been performed with subsets of DIP data to evaluate the prediction accuracy of PID matrix. The prediction system gives about 50% of sensitivity and 98% of specificity, Based on the PID matrix, we develop a system providing several interaction information-finding services in the Internet. The system, named PreDIN (Prediction-oriented Database of Interaction Network) provides interacting domain finding services and interacting protein finding services. It is demonstrated that mapping of the genome-wide interaction network can be achieved by using the PreDIN system. This system can be also used as a new tool for functional prediction of unknown proteins.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.154-160
• /
• 2014

The address resolution protocol (ARP) provides dynamic mapping between two different forms of addresses: the 32-bit Internet protocol (IP) address of the network layer and the 48-bit medium access control (MAC) address of the data link layer. A host computer finds the MAC address of the default gateway or the other hosts on the same subnet by using ARP and can then send IP packets. However, ARP can be used for network attacks, which are one of the most prevalent types of network attacks today. In this study, a new ARP algorithm that can prevent IP spoofing attacks is proposed. The proposed ARP algorithm is a broadcast ARP reply and an ARP notification. The broadcast ARP reply was used for checking whether the ARP information was forged. The broadcast ARP notification was used for preventing a normal host's ARP table from being poisoned. The proposed algorithm is backward compatible with the current ARP protocol and dynamically prevents any ARP spoofing attacks. In this study, the proposed ARP algorithm was implemented on the Linux operating system; here, we present the test results with respect to the prevention of ARP spoofing attacks.

• Proceedings of the KIEE Conference
• /
• 1992.07b
• /
• pp.1218-1220
• /
• 1992

This paper presents the three section sliding mode control algorithm based on variable structure current controller design in a synchronous frame and indirect field oriented control method, and applies it to the position control of induction motor. This control scheme solves the problem of robustness loss during the reaching phase that occurs in a conventional VSC strategy, and ensures the stable sliding mode and robustness enhancement throughout an entire response. As the performance of a VSI fed induction motor drives depends on the characteristics of inner loop current controller, it is desired that the current controller have the fast tracking and robust nature. Therefore, we introduced the voltage mapping table based on the concept of voltage space vector for variable structure current control, and implemented fully digital control system using 16-bit microcontroller with on-chip peripherals without additional processing circuits. Simulation and experimental results confirm the validity of this control scheme for robust AC servo drive system of VSI fed induction motor.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.220-223
• /
• 2010

최근 연이은 3D 영화의 성공에 힘입어 영화 산업계를 중심으로 3D 콘텐츠 생성이 늘고 있으며, 이를 가정 내에서도 즐길 수 있도록 다양한 3DTV가 출시되고 있다. 그러나 3DTV의 특성 상 3D 재생 시 밝기 저하에 따른 색 재현 문제로 인하여 입체감과 공간감을 느끼는 대신 2D에서의 화려한 색감을 만끽할 수 없게 되었다. 이에 본 논문은 3D 시청 시에도 2D에서와 같은 색감을 최대한 제공하기 위한 방법에 대해 연구하였다. 이를 위하여 3DTV를 활용하여 입력 RGB 영상에 대하여 2D와 3D 재생 시 재현되는 RGB intensity를 측정한 후 입출력에 따른 관계 모델링을 실시하였고, 모델링에 근거하여 3D 재생 시 2D 대비 보정되어야 할 색상 요소에 대한 매핑 테이블(mapping table)을 생성하였다. 생성된 매핑 테이블은 기존 3DTV 시스템의 출력부에 3D 색상 보정 모듈로써 추가하도록 하여 일반 2D 재생 시에는 입력영상이 바이패스(bypass)되도록 하고, 3D 재생 시에는 본 논문에 의한 3D 색상 보정용 매핑 테이블을 통해 색상 보정 과정을 수행하도록 하여 3D 재생 시에도 2D에서 느낄 수 있는 색감을 재현할 수 있도록 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.547-550
• /
• 2011

플래시 메모리는 낮은 전력 소비와 높은 성능으로 인해 휴대용 기기에 널리 사용되고 있다. FTL은 플래시 내 자료를 관리하는 소프트웨어 계층으로 플래시 전체의 성능에 영향을 끼친다. 그 중 페이지 레벨 매핑 기법을 적용한 FTL은 유연성이 높고 속도가 빠르나 주소 변환 테이블의 크기가 큰 단점이 있다. 이를 해결하기 위해 자주 접근되는 영역의 매핑 주소만을 매핑 테이블 캐시에 올려놓는 Demand-based FTL(DFTL)이 제안되었다. DFTL 에서는 CMT(Cache Mapping Table)의 참조율이 떨어지는 경우 빈번한 플래시 메모리 접근 오버헤드가 발생하게 된다. 이러한 문제는 흔히 발생하는 일반적인 순차 접근에서조차 문제가 된다. 이에 본 논문에서는 저장 장치의 접근 패턴을 예측하여 CMT의 참조 엔트리를 미리 읽어오는 기법을 제안한다. 제안하는 기법은 저장 장치 접근 패턴의 순차성을 판단하여 연속된 매핑 주소를 미리 CMT에 올려놓고, 읽어오는 매핑 주소 엔트리의 양은 동적으로 관리한다. 추가적으로 CMT에서 발생하는 스래싱(thrashing) 을 파악하기 위해 쫓겨나는 희생 엔트리의 접근 여부를 분석하여 이를 활용하였다. 실험 결과에서 본 기법은 기존의 DFTL에 비해 약간의 공간 오버헤드와 함께 평균 50% 증가한 참조율을 보였다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.28 no.3
• /
• pp.475-481
• /
• 2004

Recently it is strongly required on lower fuel consumption. lower exhaust emission, higher engine performance. and social demands in a spark ignition gasoline engine. In this study. the experimental engine used at test. it has been modified the lean burn gasoline engine. and used the programmable engine management system, and connected the controller circuit which is designed for the engine control. At the parametric study of the engine experiment, it has been controlled with fuel injection, ignition timing. swirl mode, equivalence ratio engine dynamometer load and speed as the important factors governing the engine performance adaptively. It has been found the combustion characteristics to overcome the hysteresis phenomena between normal and lean air-fuel mixing ranges. by mean of the look-up table set up the mapping values. at the optimum conditions during the engine operation. As the result, it is found that the strength of the swirl flow with the variation of engine speed and load is effective on combustion characteristics to reduce the bandwidth of the hysteresis regions. The results show that mass fraction burned and heat release rate pattern with crank angle are reduced much rather, and brake specific fuel consumption is also reduced simultaneously.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.59-67
• /
• 2012

In this paper, we designed an inter-operation architecture of 10G G-PON(Gigabit passive optical network) network and NGN(Next generation network) architecture. And, we proposed mechanism of dynamic GEM(G-PON encapsulation mode) Port-ID allocation. This is able to solve a problem of 10G G-PON inter-operation. The mechanism of dynamic GEM Port-ID allocation has OMCI(ONT management control and interface) mapping table for IP address and port number. That architecture is able to support per flow QoS(Quality of service) as well as QoS of NGN requirement. So that can improve the resource efficiency of QoS than the existing G-PON architecture.

• KIISE Transactions on Computing Practices
• /
• v.20 no.10
• /
• pp.555-560
• /
• 2014

This paper proposes the data security technology for the desktop virtualization environment using the separated software execution method. In the virtual environment where allocates separate VMs to the users, there is a benefit that the programs in one guest machine are isolated from the programs running in another guest machine, whereas in the separated execution environment that supports application virtualization, the isolation is not offered and it causes the data security problem because the applications are executed by the one root privilege in the server. To solve this problem, we provides the data security method using the server storage filter, the viewer filter, and the file mapping table in this paper.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.289-302
• /
• 2007

The existing query processing technique for CXQuery, which is able to query regardless of knowledge about XML document structures, is difficult to manage because of table join for query processing and results return, mapping XML documents into relational tables, and so on. In this paper we have developed a converter capable of converting CXQuery to XQuery in order to make use of the query processing techniques for XQuery progressing standardization. The converting speed of the converter takes a trifling time as much as negligible quantities in comparison with the total query processing time. This is also able to query directly XML documents regardless of relational databases, and users can query without knowledge about XML document structures.