• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.39-45
• /
• 2004

This paper proposes a new blind measurement model of blocking artifacts. This model plays an important role in the assessment and enhancement of image quality caused by block-based DCT coding system. The proposed model can measure blocking artifacts without reference to original images and consider the HVS based visual model such as frequency sensitivity and channel masking effect to detect and measure overall blocking artifacts quantitatively. The experimental results show that the proposed model is highly effective in measuring blocking artifacts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.511-513
• /
• 2000

종단간 전송 지연은 시각 동기, 네트워크 성능 측정 등에서 매우 중요한 요소이다. 그러나 IP에 기반하고 있는 Internet은 여러 통신망 상의 지연 요소를 정확히 전달할 수 있는 구조가 없기 때문에 종단간 전송에 있어 전송 지연을 정확하게 알 수 없다. 특히 UDP 네트워크의 경우 전송할 때와 수신할 때 경로가 같지 않기 때문에 일반적으로 일주 지연 시간을 이용하지만 각 편도 전송 지연 시간 차이는 시스템의 다른 요소에 대해서 오류 요소로 작용할 수 있다. 본 논문에서는 일주 지연 시간을 전송시 지연 시간과 수신시 지연 시간으로 따로 측정 분석하였다. 측정 결과 편도 전송 지연 시간 차이 값은 수십 밀리초 범위를 가지며 이는 NTP 등에서 시각을 동기화 할 때 통상적인 정확도, 수 밀리초를 훨씬 넘어선다. 이것은 편도 지연 시간 차이값이 시각 동기, 네트워크 성능 평가 등에서 중요한 오류값으로 작용한다는 것을 의미한다. 분석 결과를 실험 데이터에 적용할 경우 실제 편도 지연 시간에 근사한 값을 구할 수 있고 좀더 정확한 시각 동기, 네트워크 성능 평가가 가능하게 된다.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.35-44
• /
• 2003

XML becomes the standard for exchanging documents and data on the Web. Schema is used to define XML documents. Among schema, XDR schema, developed chiefly by Microsoft, is a leading schema for practical use. UML is a notation in object-oriented software development and a useful tool to represent the structure of a system. In this paper, we study the transformation method and algorithm from XDR schema to UML diagram. By this transformation, the structure of XDR schema is represented graphically. Thus we can easily understand the structure of XDR schema and we can create XML documents effectively by enhancing reusability and flexibility.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.677-679
• /
• 2014

생명현상은 기능적 요소인 단백질의 활성에 의해 유지되고 조절된다. 최근 단백질의 복잡한 네트워크 정보가 생명현상을 조절하는 기능적 단위로 인식되면서 단백질 네트워크의 최소 단위인 단백질-단백질 상호작용 정보의 중요성이 강조되고 있다. 특히 단백질의약품의 경우 단백질 네트워크 상에서 리셉터 단백질과 리간드 단백질 사이의 상호작용에 의해서 약효가 나타나도록 설계되기 때문에 상호작용에 관여하는 인터페이스 정보의 확보가 필수적이다. 단백질-단백질 상호작용 인터페이스 확인을 위한 연구들이 활발히 이루어지고 있으나 인터페이스 정보의 가시화에 대한 연구는 극히 제한적이다. 본 논문에서는 리셉터 단백질과 리간드 단백질에 대한 3차구조 분석을 통해 단백질-단백질 상호작용에 관여하는 인터페이스 정보를 가시화하였다. 기존의 단백질 3차구조 정보 서비스 사이트인 PDB에서 확인할 수 없는 인터페이스 정보를 3차원으로 시각화하여 인터페이스 상에 위치하는 아미노산 정보를 새롭게 제공함으로써 의약품 연구자들이 단백질 구조와 인터페이스 구조를 쉽게 파악할 수 있도록 하였다. 이는 의약품 등 단백질-단백질 상호작용 정보를 활용하는 바이오 산업 분야에 필요한 정보를 제공함으로써 산업 활성화에 기여할 것으로 기대된다.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.233-254
• /
• 2022

Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.746-756
• /
• 1995

This paper describes the intractive visual programming environment using multi-view which shows the tools of visualization for called and the visualizations for called member-function flow in C＋＋ language. This research defines new visual symbols for class and constructs interactive visual programming environment of various views by using visual symbols. Our proposed interactive multi-view visual programming environment can represent visualization for representation of class and execution relationships between objects in the object-oriented language, which is easy to understand the structure of object-oriented program, therefore our proposed interactive visual programming environment enables easy program development, and can use of education and trainning for beginner in useful.

• Science of Emotion and Sensibility
• /
• v.9 no.spc3
• /
• pp.209-224
• /
• 2006

Hierarchy which is often named as the tree-structure is used to reduce complexity and show primitive structures of complicated information. This paper aims at explaining information-visualization methods using hierarchies in multimedia domains and prospecting the possible applications by examining how they affect the user's tasks involved in information-seeking activities. As a result, four types of information visualization methods named Treemap, Hyperbolic, Cone Tree and DOI Tree employed in multimedia domain, are presented and pros and cons of each method are explained in this paper. Another important part is defining the core tasks and other related-tasks in information-seeking activities, such as, overview, zoom, filter, details-on-demand, relate, history, and extract. Followings are major findings. Treemap uses 'overview' as the core task, which makes user to gain a overall meaning of the whole information cluster. Hyperbolic and DOI Tree apply 'Boom' task through the function of focus+context or by the function of meaningful scaling to magnify or downsize each node. Cone Tree, also, makes the information organizer to classify the patterns of information acquired in the process of users' information-seeking activities by using 'extract' task. Through this study, it is finally found out that the information-visualization methods using hierarchies in multimedia domains should incorporate the wide variety of functional needs related to users' information-seeking behaviors beyond the visual representation of information.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.45-51
• /
• 2012

Programming is an area that many students have difficulty on because it requires various skills, such as problem analysis, logical thinking, and procedural problem-solving skills. In this paper, a system visualizing algorithm was used to set up algorithmic concepts easily and effectiveness of the system was analyzed through scholastic achievement test and survey after learning through this process. For evaluation, we divided students who take courses on programming language and algorithm in 3 universities into 2 groups with 6 teams in each group. The group that trained this system visualizing algorithm had scored 17.4 points higher in terms of scholastic achievement than the group that did not train such method. Moreover, according to the survey, the group had higher scores in terms of interest level, concentration level, comprehension, effectiveness, and convenience.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1197-1213
• /
• 2014

Due to the increase in size of the computer network, the network security systems such as a firewall, IDS, IPS generate much more vast amount of information related to network security. So detecting signs of hidden security threats has become more difficult. Security personnels' 'Network Security Situational Awareness(NSSA)' is effectively determining the security situation of overall computer network on the basis of the relation between the security events that occur in the several views. The process of situational awareness is divided into three stages of the 'identification,' 'understanding' and 'prediction'. And 'identification' and 'understanding' are prerequisites for 'predicting' and the following appropriate responses. But 'identification' and 'understanding' in the vast amount of information became more difficult. In this paper, we propose Honeycomb security situational awareness visualization system that is designed to help NSSA in large-scale networks by using visualization techniques known effective to the 'identification' and 'understanding' stages. And we identified the empirical effects of this system on the basis of the 'VAST Challenge 2012' data.