• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.112-119
• /
• 2008

Today, A matter of concern of home network technology increase. The standard of communication between home network devices are required. IEEE 802.1 AVB(Audio/Video Bridging) specifies transmission method for time-sensitive data between these devices using Ethernet in bridged local area networks. IEEE 802.1 AVB and IEEE 1588 PTP(Precision Time Protocol) have various message type for grandmaster selection and synchronize the devices. These messages bring on complexity protocol. We propose a method that uses Single TimeSync frame in order to the problem. Our proposal is appropriate process complexity and low transmission delay for home network by using the TimeSync frame. Furthermore, after all devices are adjusted to the single TimeSync frame, a resource reservation, a forwarding and queueing rule are needed for a time-sensitive application.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.357-367
• /
• 2005

According to the recent advancement of mobile computing technology and the hardware technology, the mobile device has rapidly come into wide use.'rho data in the central management server needs to confirm to that in mobile devices in order for the mobile device users to access the needed data regardless of time and place. This is called Data Synchronization. Currently, major mobile device manufacturing companies provide the data synchronization solutions, but these solutions are not compatible with other mobile devices/other applied services. In order to solve this problem, OMA(Open Mobile Alliance), mainly composed of mobile telecommunication companies, has suggested using the SyncML(Synchronization Markup Language) data synchronization method. This is an attempt to make a public standard. In this paper, the data synchronization client that synchronizes the PIMS (Personal Information Management System) data in mobile devices like PDA is developed, complying with the SyncML standard requirements.

• 한국지구과학회:학술대회논문집
• /
• 2005.09a
• /
• pp.291-291
• /
• 2005

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.13 no.7
• /
• pp.130-142
• /
• 1995

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.23 no.6 s.193
• /
• pp.42-49
• /
• 2005

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.20 no.7
• /
• pp.14-21
• /
• 2002

• Proceedings of the Zoological Society Korea Conference
• /
• 2000.10a
• /
• pp.292.2-293
• /
• 2000

• Proceedings of the Zoological Society Korea Conference
• /
• 2003.08a
• /
• pp.219.3-219
• /
• 2003

• Journal of The Korean Association For Science Education
• /
• v.20 no.4
• /
• pp.491-504
• /
• 2000

Recent research has shown that students' interest in learning physics is not a simple one. In this study the dimensions of students' interest in learning physics have been identified. These are the topic being taught, the activity in which the students are involved, and the motive of the students for learning physics. A Likert-style pilot questionnaire was constructed for identifying these dimensions and given to 13 year-old 162 students. A factor analysis of the results indicates that there are meaningful sub-dimensions in interest. In other words, while there were no specific sub-dimensions in topic dimension, motive dimension could be divided into intrinsic motive and extrinsic motive, and activity dimension could also be divided into receptive, experiential, high cognitive, and interactive activity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.169-175
• /
• 2002

This paper is about the hardness of the Election problem in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of the problem is defined with respect to the difficulty to solve it despite failures. It is shown that problems encountered in the system are classified as three classes of problems: F (fault-tolerant), NF (Not fault-tolerant) and NFC(NF-completeness). Among those, the class NFC is the hardest problems to solve. In this paper, we prove that the Election problem is the most difficult problem which belongs to the class NFC.