• Review of KIISC
• /
• v.2 no.4
• /
• pp.17-29
• /
• 1992

본 논문에서는 시스템 내의 모든sote들에게 분산되어 있는 정보들을 수렴하여 일치를 이루고, 그 결과를 모든 site들이 알도록 하는 다중 일치 프로토콜을 위한 효과적인 통신 방법을 제안하고자 한다. 분산 시스템에 참여하는 computer 또는 site들의 수를 N이라 할때, $O(N^2)$의 message를 필요로하면서 한 round안에 일치를 이룰 수 있는 프로토콜은 message의 수가 너무 많다는 것이 단점이다. 이에 본 논문에서는 Finite Projective Planes을 이용하여 message의 수를 줄이면서 두 round 안에 일치를 이룰 수 있는 통신 방법을 제안한다. 이때, 각 round마다 필요한 message의 수는 O(N$)이다. 또한, 이 통신 방법에서 이용되는 Finite Projective Planes을 구축하는 알고리즘을 제안하고자한다.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.117-120
• /
• 2002

In this paper, we construct cryptographic accelerators using hardware Implementations of HMACS based on a hash algorithm such as MD5.It is basically a secure version of his previous algorithm, MD4 which is a little faster than MD5 The algorithm takes as Input a message of arbitrary length and produces as output a 128-blt message digest The input is processed In 512-bit blocks In this paper, new architectures, Iterative and full loop, of MD5 have been implemented using Field Programmable Gate Arrays(FPGAS). For the full-loop design, the performance Is about 500Mbps @ 100MHz

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.520-530
• /
• 2004

A multidatabase system (MDBS) is designed to provide universal access to distributed data across multiple autonomous, heterogeneous local database systems (LDBSs). In this paper, we propose a global concurrency control (GCC) algorithm in MDBS. The proposed GCC algorithm adopts the idea of message ordering in group communication messaging system. A necessary condition of GCC algorithm is that global transactions are serialized in the same order at all LDBSs that they execute. n all operations of a transaction are bundled in a single message and the message arrives at LDBSs in the same order using message ordering property, each LDBS can perform subtransactions in the same order. As a result, message ordering allows to determine easily the relative serialization order of global transactions, and then it can support a local autonomy without any information about the serialization order of transactions executing locally.

• Journal of Digital Convergence
• /
• v.9 no.6
• /
• pp.267-276
• /
• 2011

The purpose of this study was to explore the effect of the interactive message expression and consumer characteristic insert IPTV advertising. The results of this study were follow: Firstly, Attention and attitude of interactive message advertising appeared than general TV advertising so that it was high. Second, In case of interactive message advertising, It appeared efficiently than the advertising without the advertisement detail information which is putting the good detail information. Third, In interactive message expression of IPTV advertising, Floating expression strategy appeared efficiently most. Lastly, Adoption of consumer characteristic was revealed that we had an influence on the knowledge level and the information search intention about IPTV. We present theoretical basis which to present interactive message to IPTV supplier is efficient, and the plan which floating expression can make the click intention of the advertising.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.525-532
• /
• 2006

Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%$\sim$2.1% of the recovery information collection time compared with the latter.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.4
• /
• pp.25-35
• /
• 2008

Variable Message Sign(VMS) is one of the subsystem of Intelligent Transportation Systems (ITS), which is useful for providing real-time information on weather, traffic and highway conditions. However, there are various situations such as incidents/accidents, constructions, special events, etc., which would be occurred on segments, it is unable to control traffic with only the VMS. Thus, it is essential to use of PVMS(Portable Variable Message Signs), which can move to the location needed traffic control and provide more active traffic information than VMS. This study developed a legibility distance model for PVMS messages using in-vehicle Differential Global Positioning Data(DGPS). Traffic conditions, drivers' characteristics, weather conditions and characteristics of PVMS message were investigated for establishing the legibility model based on multiple linear regression analysis. The factors such as height of PVMS characters, spot speed, age, gender and day and night were identified as dominants affecting the variation of legibility distances. It is expected that the proposed model would play a significant role in designing PVMS messages for providing more effective real-time traffic information.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.87-94
• /
• 2008

Message races should be detected for debugging effectively message-passing programs because they can cause non-deterministic executions of a program. Previous tools for detecting message races report that message races occur in every receive operation which is expected to receive any messages. However message races might not occur in the receive operation if each of messages is transmitted through a different logical communication channel so that their incorrect detection makes it a difficult task for programmers to debug programs. In this paper we suggest a tool, MPIRace-Check, which can exactly detect message races by checking the concurrency between send/receive operations, and by inspecting the logical communication channels of the messages. To detect message races, this tool uses the vector timestamp to check if send and receive operations are concurrent during an execution of a program and it also uses the message envelop to inspect if the logical communication channels of transmitted messages are the same. In our experiment, we show that our tool can exactly detect message races with efficiency using MPI_RTED and a benchmark program. By detecting message races exactly, therefore, our tool enables programmers to develop reliable parallel programs reducing the burden of debugging.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.4
• /
• pp.193-202
• /
• 2016

The Korea Augmentation Satellite System (KASS), which is under development in Korea as a Satellite Based Augmentation System (SBAS) is expected to broadcast SBAS messages to air space in Korea according to the international standards defined by the International Civil Aviation Organization (ICAO) and the Radio Technical Commission for Aeronautics (RTCA). Around 13 SBAS messages are broadcast in every second to transmit augmentation information which can be applicable to a wide area in common. Each of the messages requires a different update interval and time-out according to the characteristics, purpose, and importance of transmitted information, and users should receive and combine multiple SBAS messages to calculate SBAS augmented information. Thus, a time to take acquiring first SBAS position by users differs depending on broadcasting various SBAS messages with which order and intervals. The present paper analyzes the considerations on message scheduling for broadcasting of KASS augmentation information and proposes a design of KASS message scheduler using the considerations. Compared to existing SBAS systems, which have a wide range of service area, a service area of the KASS is limited to Korea only. Thus, the numbers of ionosphere grid points and satellites to be augmented are expected to be smaller than those of existing SBAS. By reflecting this characteristic to the proposed design, shortening of broadcast interval of KASS message is verified compared to existing SBAS and a measure to increase a speed of acquisition of user navigation solution is proposed utilizing remaining message slots. The simulation result according to the proposed measure showed that the maximum broadcast interval can be reduced by up to 20% compared to that of existing SBAS, and users can acquire KASS position solution faster than existing SBAS.

• Smart Media Journal
• /
• v.5 no.2
• /
• pp.42-50
• /
• 2016

In case of a emergency situation or a natural disaster, a warning notification system is an essential tool to notify at-risk people in advance and provide them useful information to survive the event. Although some systems have been proposed such as emergency alert system using android, SMS, or P2P overlay network, these works mainly focus on a reliable message distribution methods. In this paper, we proposed a novel design and implementation of a personalized warning notification system to help inform not only the at-risk people but also their family and friends about the coming disaster as well as escape plan and survival information. The system consists of three main modules: the user selection module, the knowledge based message generator, and message distribution modules. The user selection module collects the list of people involved in the event and sorts them based on their level of involvement (their location, working position and social relationships). The knowledge based message generator provides each person with a personalized message that is concise and contains only the necessary information for the particular person based on their working position and their involvement in the event. The message distribution module will then find a best path for sending the personalized messages based on trustiness of locations since network failures may exist in a disaster event. Additionally, the system also have a comprehensive database and an interactive web interface for both user and system administrator. For evaluation, the system was implemented and demonstrated successfully with a building on fire scenario.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.209-217
• /
• 2022

Naval CMS(Combat Management System) is linked to various sensors and weapon equipment and use DDS(Data Distribution Service) for efficient data communication between ICU(Interface Control Unit) Node and IPN(Information Processing Node). In order to use DDS, software in the system communicates in an PUB/SUB(Publication/Subscribe) based on DDS topic. If the DDS messages structure in this PUB/SUB method does not match, problems such as incorrect command processing and wrong information delivery occur in sending and receiving application software. To improve this, this paper proposes a DDS message structure integrity verification method. To improve this, this paper proposes a DDS message structure integrity verification method using a hash tree. To verify the applicability of the proposed method to Naval CMS, the message integrity verification rate of the proposed method was measured, and the integrity verification method was applied to CMS and the initialization time of the existing combat management system was compared and the hash tree generation time of the message structures was measured to understand the effect on the operation and development process of CMS. Through this test, It was confirmed that the message structure verification method for system stability proposed in this paper can be applied to the Naval CMS.