• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.1-12
• /
• 1999

A new algorithm of constructing binary decision diagram(BDD) for design verification of switch-level circuits is proposed in this paper. In the switch-level circuit, functions are characterized by serial and parallel connections of switches and the final logic values may have high-impedance and unstable states in addition to the logic values of 0 and 1. We extend the BDD to represent functions of switch-level circuits as acyclic graphs so called switch-level binary decision diagram (SLBDD). The function representation of the graph is in the worst case, exponential to the number of inputs. Thus, the ordering of decision variables plays a major role in graph sizes. Under the existence of pass-transistors and domino-logic of precharging circuitry, we also propose an input ordering algorithm for the efficiency in graph sizes. We conducted several experiments on various benchmark circuits and the results show that our algorithm is efficient enough to apply to functional simulation, power estimation, and fault-simulation of switch-level design.

• Journal of the Korean School Mathematics Society
• /
• v.8 no.2
• /
• pp.203-222
• /
• 2005

The purpose of this study is to investigate students' understanding of functions based on concept image and concept definition suggested by Vinner, For the study a graphing calculator was provided as a tool for students to use for their exploration. Three students participated in the study using the qualitative research method to identify their processes of understanding functions. The student with previous experiences of the functions had various concept images about the functions and did not have many opportunities to modify their images because the student did not want to depend on the calculator. However, the student who did not have many chances to study about the functions before used the calculator effectively for developing the concept definition on the functions. The calculator played an important role in connecting different representations and finding relationships between these representations supported by dynamic exploration.

• Journal of Wetlands Research
• /
• v.15 no.3
• /
• pp.397-406
• /
• 2013

Wetland conservation plan has been established to protect ecologically important wetlands based on vegetation integrity, spatial distribution of endangered species, but recently more demands are concentrated on the landscape ecological approaches such as topological relationship, neighboring area, spatial arrangements between wetlands at the broad scale. Landscape ecological analysis and graph theory are conducted to identify spatial characteristics related to core nodes and weak links of wetland networks in Nakdong basin. Regular planar model, which is selected for wetland networks, is applied in the Nakdong basin. The analysis indicates that 5 regional groups and 4 core wetlands are extracted with 15km threshold distance. The IIC and PC values based on the binary and probability models suggest that the wetland group C composed of main stream of Nakdong river and Geumho river is the most important area for wetland network. Wetland conservation plan, restoration projected of damaged and weak links between wetlands should be proposed through evaluating the node, links, and networks from wetlands at the local to the regional scale in Nakdong basin.

• Communications of Mathematical Education
• /
• v.13 no.1
• /
• pp.381-408
• /
• 2002

본 논문에서는 테크놀로지를 활용해 본인이 직접 조작하고 시각화 할 수 있는 환경에서 함수와 그래프, 그를 이용한 문제해결에서 학생들이 수학적 개념 발달을 통해 어떠한 언어적 상호작용이 일어나는가에 관해 조사하고자 한다. 또한 이때 나타나는 언어적 상호작용을 분석하기 위한 분류 틀을 개발하여 언어적 상호작용의 양상을 밝히며, 컴퓨터가 학생들의 의사소통에 어떠한 역할을 하는가를 알아봄으로써 학생의 인지 발달은 어떻게 이루어지는 가를 파악하여 현장 수업에 기여하고자 한다.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.189-194
• /
• 2012

In this paper, we propose a query expansion method based on word graphs using pseudo-relevant and pseudo non-relevant documents to achieve performance improvement in information retrieval. The initially retrieved documents are classified into a core cluster when a document includes core query terms extracted by query term combinations and the degree of query term proximity. Otherwise, documents are classified into a non-core cluster. The documents that belong to a core query cluster can be seen as pseudo-relevant documents, and the documents that belong to a non-core cluster can be seen as pseudo non-relevant documents. Each cluster is represented as a graph which has nodes and edges. Each node represents a term and each edge represents proximity between the term and a query term. The term weight is calculated by subtracting the term weight in the non-core cluster graph from the term weight in the core cluster graph. It means that a term with a high weight in a non-core cluster graph should not be considered as an expanded term. Expansion terms are selected according to the term weights. Experimental results on TREC WT10g test collection show that the proposed method achieves 9.4% improvement over the language model in mean average precision.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.699-707
• /
• 2003

RBAC is accepted as a more advanced control method than existing DAC and MAC. Studies on the permission-role part of RBAC model are relatively insufficient compared with those on the user-role part, and researches on symmetric RBAC models to overcome this is also in an incipient stage. Therefore there is much difficulty in assigning permissions suitable for roles. This paper proposes an symmetric RBAC model that supplements the constraints on permission assignment set forth by previous studies. The proposed symmetric RBAC model reflects the conflicts of interests between roles and the sharing and integration of permissions on the assignment of permissions by presenting the constraints on permission assignment that take the separation of duties and role hierarchies into consideration. In addition, by expressing constraints prescribing prerequisite relations between dynamic permissions through AND/OR graphs, it is possible to effectively limit the complicated prerequisite relations of permissions. The constraints on permission assignment for the proposed symmetric RBAC model reduce errors in permission assignment by properly detailing rules to observe at the time of permission assignment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.1
• /
• pp.123-128
• /
• 2010

Graph expression of attack scenarios is a necessary method for analysis of vulnerability in server as well as the design for defence against attack. Although various requirement analysis model are used for this expression, they are restrictive to express combination of complex scenarios. Role Based Petri Net suggested in this paper offer an efficient expression model based role on Petri Net which has the advantage of concurrency and visuality and can create unknown scenarios.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.4
• /
• pp.427-432
• /
• 2016

The mnemonic-system in numbers is useful to remember numbers. In this mnemonic-system, the graph or image to apply many ways such as dot, line, bar, and etc is a rather neat mnemonic. Mnemonics related to numbers are concerned chiefly with translating information into a method that the brain can retain better than its original form. In Tracing the previous work of this paper, we suggested a simple graph algorithm and arranged image algorithm for the mnemonic-system in numbers. In this paper, we evaluate and implement the numerical information system based on the mnemonic system to apply previous algorithm in mobile environments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.12-17
• /
• 2010

An automatic facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.705-711
• /
• 2003

An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in !be image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the face identification system.