• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.295-297
• /
• 2003

실시간 운영체제는 여러 개의 독립적인 태스크가 동시에 실행될 수 있는 멀티태스킹 환경을 제공한다. 이러한 독립적인 태스크들 사이에 정보를 주고받기 위해서는 태스크들 사이의 통신이 필요하며 이러한 ITC(Inter-Task Communication)를 지원하는 방법에는 Global Variable과 Message 전송 두 가지 방법이 있다. Global Variable 은 Data Corruption 의 위험이 있기 때문에 보통의 실시간 운영체제에서는 Message 전송 방식을 주로 사용하는데 이러한 방식에는 메시지 큐, 메시지 메일박스, 메시지 포트 등이 있다. 본 논문에서는 태스크들 간에 또는 태스크와 ISR(Interrupt Service Routine)이 여러 개의 메시지를 서로 전달할 수 있는 메시지 큐에 대해서 설명하고 있다. 또한 태스크 또는 ISR 이 메시지 큐로부터 메시지를 주고받을 때 메모리의 동적 할당을 보다 효과적으로 처리함으로써 효율적인 메시지 큐 제어기법에 대해서 제시하고 있다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.273-274
• /
• 2023

본교에서 강의실, 회의실 등 공용공간을 사용하기 위해서는 사용자가 수기로 양식을 작성하여 제출하고 담당자가 처리해야 한다. 이 방식은 사용자가 사용하고자 하는 공간의 예약 현황을 확인할 수 없고, 사용신청 과정에서 직접 담당자를 찾아가야 한다는 불편함이 따른다. 본 연구에서는 이러한 불편함을 개선하기 위하여 마이크로 서비스 아키텍처 기반의 공간 예약 웹서비스를 구현한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3672-3679
• /
• 2012

Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.4
• /
• pp.269-274
• /
• 2021

In secret communication, steganography is the sending and receiving of secret messages without being recognized by a third party. In the spatial domain method bitwise information is inserted into the virtual bit plane of the decomposed pixel values of the image. That is, the bitwise secret message is sequentially inserted into the least significant bit(LSB) of the image, which is a cover medium. In terms of application, the LSB is simple, but has a drawback that can be easily detected by a third party. If the upper bit plane is used to increase security, the image quality may deteriorate. In this paper, I present a method for concealing Hangul secret messages in image steganography based on the lo-th bit plane and the decomposition of modified pixel intensity values. After decomposing the Hangeul message to be hidden into choseong, jungseong and jongseong, then a shuffling process is applied to increase confidentiality and robustness. PSNR was used to confirm the efficiency of the proposed method. It was confirmed that the proposed technique has a smaller effect in terms of image quality than the method applying BCD and Fibonacci when inserting a secret message in the upper bit plane. When compared with the reference value, it was confirmed that the PSNR value of the proposed method was appropriate.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.345-347
• /
• 2006

In this paper, we study the robot controller design using the voice and data communication via CDMA(Code Division Multiple Access) mobile communication network. We design the robot remote controller using the three methods, telephone call speech recognition, DTMF (Dual Tone Multiple Frequency) realization, SMS(Short Message Service) transmission/reception way via CDMA mobile communication network. We investigate the validity and effectiveness of the proposed remote controller which applied to the mobile robot.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.171-172
• /
• 2008

We propose the sensor networks middleware based on publish/subscribe model for adaptive service to client. Publish/subscribe middleware make capability of sensor to data through the advertisement message. Based on capability of sensor, Publish/subscribe middleware adaptively service to client. And client make a collection of information that it require. Therefore middleware service more effectively.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.465-466
• /
• 2016

본 논문은 상황인식 기반 위치추적 시스템을 위한 위치 트리거 서비스 구현을 위한 위치 트리거 파라미터와 메시지를 기반으로 위치 트리거 처리기를 설계한다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2017

Short message service (SMS) is one of the most important communication methods for people who use mobile phones. However, illegal advertising spam messages exploit people because they can be used without the need for friend registration. Recently, spam message filtering systems that use machine learning have been developed, but they have some disadvantages such as requiring many calculations. In this paper, we implemented a spam message filtering system using the set-based POI search algorithm and sentence similarity without servers. This algorithm can judge whether the input query is a spam message or not using only letter composition without any server computing. Therefore, we can filter the spam message although the input text message has been intentionally modified. We added a specific preprocessing option which aims to enable spam filtering. Based on the experimental results, we observe that our spam message filtering system shows better performance than the original set-based POI search algorithm. We evaluate the proposed system through extensive simulation. According to the simulation results, the proposed system can filter the text message and show high accuracy performance against the text message which cannot be filtered by the 3 major telecom companies.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.3
• /
• pp.230-235
• /
• 2009

The TMO may contain two types of methods, time-triggered methods(also called the spontaneous methods of SpMs) which are clearly separated from the conventional service methods (SvMs). The SpM executions are triggered upon design time whereas the SvM executions are triggered by service request message from clients. In this paper, we describes the application environment as the patient monitor telemedicine system with TMO structure. Vital sign information web viewer systems is also the standard protocol for medical image and transfer. We have to design to obtain useful vital sign information, which is generated at parsing data receiver modulor of HIS with TMO structure, that is offered by the central monitor of ICU. In order to embrace new technologies as telemedicine service, it is important to develope the standard protocol between different systems in the hospital, as well as the communication with external hospital systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.450-463
• /
• 2000

Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. GEN_BLOCK redistribution, which is redistribution between different GEN_BLOCKs, is essential for load balancing. However, prior research on redistribution has been focused on regular redistribution, such as redistribution between different CYCLIC(N)s. GEN_BLOCK redistribution is very different from regular redistribution. Message passing in regular redistribution involves repetitions of basic message passing patterns, while message passing for GEN_BLOCK redistribution shows locality. This paper proves that two optimal condition, reducing the number of communication steps and minimizing redistribution size, are essential in GEN_BLOCK redistribution. Additionally, by adding a relocation phase to list scheduling, we make an optimal scheduling algorithm for GEN_BLOCK redistribution. To evaluate the performance of the algorithm, we have performed experiments on a CRAY T3E. According to the experiments, it was proven that the scheduling algorithm shows better performance and that the conditions are critical in enhancing the communication speed of GEN_BLOCK redistribution.