2014, Vol.19, No.5

Journal of The Korea Society of Computer and Information 2023 KCI Impact Factor : 0.65

pISSN : 1598-849X / eISSN : 2383-9945
https://journal.kci.go.kr/jksci

The proposed scheme schedules given real-time tasks so that energy consumption of multicoreprocessors would be minimized while meeting tasks’ deadline and tolerating a permanent faultbased on the primary-backup task model. Whereas the previous methods minimize the overlappedtime of a primary task and its backup task, the proposed scheme maximizes the overlapped timeso as to decrease the core speed as much as possible. It is analytically verified that the proposedscheme minimizes the energy consumption. Also, the proposed scheme saves up to 77% energy consumption of the previous method through experimental performance evaluation.

In this paper, we propose a self-diagnosis system that is based on the ART2 algorithm in orderto extract more detailed disease information by fuzzy reasoning method especially when theboundary of perceived symptoms are not clearly classified into disease categories. With thatmodification from previous version of the self health pre-diagnosis system, the proposed one isverified as more effective by field experts' evaluation as an intelligent assistant tool for publicusers before they consult with medical experts.

In this paper, I seek the chromatic number, the maximum number of colors necessary when adjoining vertices in the plane separated apart at the distance of 1 shall receive distinct colors. The upper limit of the chromatic number has been widely accepted as 4 ≤ x(G) ≤ 7 to which Hadwiger-Nelson proposed x(G) ≤ 7 and Soifer x(G) ≤ 9 . I firstly propose an algorithm that obtains the minimum necessary chromatic number and show that x(G) = 3 is attainable by determining the chromatic number for Hadwiger-Nelson’s hexagonal graph. The proposed algorithm obtains a chromatic number of x(G) = 4 assuming a Hadwiger-Nelson’s hexagonal graph of 12 adjoining vertices, and again x(G) = 4 for Soifer’s square graph of 8 adjoining vertices. assert. Based on the results as such that this algorithm suggests the maximum chromatic number of a planar graph is x(G) = 4 using simple assigned rule of polynomial time complexity to color for a vertex with minimum degree.