• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1861-1866
• /
• 2000

This paper describes a multi-constrained university timetabling problem that is a one of the field of artificial intelligent research area. For this problem, we propose the 2type edge graph that is can be represented time-conflict and day-conflict constraints simultaneously. The genetic algorithms are devised and considered for it. And we describe a method of local search in traditional random operator for its search efficiency. In computational experiments, the solutions of proposed method are average 71% costs that ware compared with solutions of random method in 10,000 iterations.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2135-2141
• /
• 2015

Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.71-71
• /
• 2004

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.49-63
• /
• 2008

RDF is the base ontology model which is used in Semantic Web defined by W3C. OWL expands the RDF base model by providing various vocabularies for defining much more ontology relationships. Recently Jain and Farkas have suggested an RDF access control model based on RDF triple. Their research point is to introduce an authorization conflict problem by RDF inference which must be considered in RDF ontology data. Due to the problem, we cannot adopt XML access control model for RDF, although RDF is represented by XML. However, Jain and Farkas did not define the authorization propagation over the RDF upper/lower ontology concepts when an RDF authorization is specified. The reason why the authorization specification should be defined clearly is that finally, the authorizatin conflict is the problem between the authorization propagation in specifying an authorization and the authorization propagation in inferencing authorizations. In this article, first we define an RDF access authorization specification based on RDF triple in detail. Next, based on the definition, we analyze the authoriztion conflict problem by RDF inference in detail. Next, we briefly introduce a method which can quickly find an authorization conflict by using graph labeling techniques. This method is especially related with the subsumption relationship based inference. Finally, we present a comparison analysis with Jain and Farkas' study, and some experimental results showing the efficiency of the suggested conflict detection method.

• Journal of The Korean Association For Science Education
• /
• v.27 no.5
• /
• pp.404-411
• /
• 2007

The purpose of this study was to examine the types of explanation about different experimental data on students' preconceptions on physical experiment. 45 students were selected from P University by examining their pre-test. The subjects had a scientific conception about a simple pendulum's period of movement, and expected that there was no change in the movement even when the mass of water increased in the can. The students were presented data about pendulum movement inside a can. They recorded this in a blank table and drew a graph about the movement of the pendulum. The responses of students were tested by presenting written anomalous experimental data. Students' recognition, trust about the anomalous data, cognitive conflict, belief change about their preconceptions were examined with written tests also. To measure students' cognitive conflict levels, CCLT (Cognitive Conflict Levels Test) developed in a previous study was used. Some students responded based on preconceptions and regarded the data as manufactured data or experimental error. The students who recognized the anomaly in the situation showed higher cognitive conflict levels than those who didn't recognize the anomaly in the situation. The students who changed their beliefs about preconceptions recognized the data as anomalous situations and showed high cognitive conflict levels than those who didn't abandon their preconceptions. The students who have unchanged beliefs about their preconceptions regarded the data as experimental error.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.422-433
• /
• 2009

As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.53-69
• /
• 1994

Deadlock in flexible manufacturing systems (FMS) which refers to the stop state of job flow in the system can be commonly occurred in operating FMS. This state mainly due to bad movements of jobs and commonly job routings should be avoided to maximize the utilization of high-capital resources in this study, the deadlock generated from the conflict between flow objects competing to occupy space resources in FMS is investigated. Capacity Designated Directed Graph (CDG) is constructed to represent the space resources and flow object routings. From the characteristics of CDG, an algorithm for the detection of the deadlock possibility is proposed. Finally two deadlock avoidance rule are proposed and implemented in the control on Automated Guided Vehicle system in an FMS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.77-82
• /
• 2006

Situation awareness는 유비쿼터스 환경에서 사용자의 상황에 맞는 적절한 서비스를 제공하기 위한 방법으로, 다양한 context와 action이력을 기술하여 협동 시스템을 표현할 수 있는 Situation Aware-Interface Definition Language(SA-IDL) 접근방법이 유용하다. 하지만, SA-IDL로 다수의 상황인지 서비스를 만들게 될 때 서비스 단독으로는 문제가 없을지라도 여러 개의 서비스들 사이에서는 충돌문제가 발생할 수 있다. 이런 충돌을 검출해내고 해결하기 위해서, 을 수학적으로 모델링된 SA-IDL을 통해, 충돌을 수학적으로 정의하여 기술하고, graph theory적인 접근 방법과 자기 상관계수를 통한 마크호프 예측 기법으로 해결하고자 한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.681-691
• /
• 1986

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.