• KSCI Review
• /
• v.14 no.2
• /
• pp.235-244
• /
• 2006

This paper attacked the unknown DoS which mixed a DoS attack, Worm and the Trojan horse which used IP Source Address Spoofing and Smurf through the SYN Flooding way that UDP, ICMP, Echo, TCP Syn packet operated. the applications that used TCP/UDP in VoIP service networks. Define necessity of a Dynamic Update Engine for a prevention, and measure Miss traffic at RT statistics of inbound and outbound parts in case of designs of an engine at IPS regarding an Self-learning module and a statistical attack spread. and design a logic engine module. Three engines judge attack grades (Attack Suspicious, Normal), and keep the most suitable filtering engine state through AND or OR algorithms at Footprint Lookup modules. A Real-Time Dynamic Engine and Filter updated protected VoIP service from DoS attacks, and strengthened Ubiquitous Security anger, and were turned out to be.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.165-174
• /
• 2006

This paper attacked the unknown DoS which mixed a DoS attack, Worm and the Trojan horse which used IP Source Address Spoofing and Smurf through the SYN Flooding way that UDP, ICMP, Echo, TCP Syn packet operated, the applications that used TCP/UDP in VoIP service networks. Define necessity of a Dynamic Update Engine for a prevention, and measure Miss traffic at RT statistics of inbound and outbound parts in case of designs of an engine at IPS regarding an Self-learning module and a statistical attack spread, and design a logic engine module. Three engines judge attack grades (Attack, Suspicious, Normal), and keep the most suitable filtering engine state through AND or OR algorithms at Footprint Lookup modules. A Real-Time Dynamic Engine and Filter updated protected VoIP service from DoS attacks, and strengthened Ubiquitous Security anger, and were turned out to be.

• Spatial Information Research
• /
• v.20 no.5
• /
• pp.67-76
• /
• 2012

Recently the mobile DBMS (Database Management System) is popular to store and manage large data in a mobile device. Especially, the research and development about mobile storage structure and querying method for navigation map data in a mobile device have been performed. The performance of the mobile DBMS in which random data accesses are most queries if the NAND flash memory is used as storage media of the DBMS is degraded. The reason is that the performance of flash memory is good in writing sequentially but bad in writing randomly as the features of the NAND flash memory. So, new storage structure and querying policies of the mobile DBMS are needed in the mobile DBMS in which a flash memory is used as storage media. In this paper, we have studied the policy of the database page management to enhance the performance of the frequent random update and applied this policy to the navigation-specialized mobile DBMS which supports incremental map update. And also we have evaluated the performance of this policy by experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.2
• /
• pp.285-294
• /
• 2014

As the utilization rate of smart device increases, various applications for smart device have been developed. Since these applications can contain important data related to user behaviors in digital forensic perspective, the analysis of them should be conducted in advance. However, lots of applications get to have new data format or type when they are updated. Therefore, whether the applications are updated or not should be checked one by one, and if they are, whether their data are changed should be also analyzed. But observing application data repeatedly is a time-consuming task, and that is why the effective method for dealing with this problem is needed. This paper suggests the automatic system which gets updated information and checks changed data by collecting application information.

• Journal of Internet Computing and Services
• /
• v.23 no.4
• /
• pp.73-85
• /
• 2022

In the era of the 4th industrial revolution, where automation and connectivity are maximized with artificial intelligence, the importance of data collection and utilization for model update is increasing. In order to create a model using artificial intelligence technology, it is usually necessary to gather data in one place so that it can be updated, but this can infringe users' privacy. In this paper, we introduce federated learning, a distributed machine learning method that can update models in cooperation without directly sharing distributed stored data, and introduce a study to optimize distributed consensus among participants without an existing server. In addition, we propose a pattern and group-based distributed consensus optimization algorithm that uses an algorithm for generating patterns and groups based on the Kirkman Triple System, and performs parallel updates and communication. This algorithm guarantees more privacy than the existing distributed consensus optimization algorithm and reduces the communication time until the model converges.

• The Journal of the Korea Contents Association
• /
• v.18 no.10
• /
• pp.111-120
• /
• 2018

The rapid use of Facebook among colleges, the present study was to explore the motivations of college owned Facebook among college students. The factor analysis The factor analysis showed that the college students perceived that the intimacy, update of college information, sharing daily lives, use of time, seeking useful information are important motivations when they use college Facebook. The extracted factors such as emotional intimacy, information update and sharing daily lives also play significant variables to affect Facebook effectiveness such as "like" and "sharing others." The results suggest that Facebook managers need to use college Facebook as a social medium not by one way communication medium to the college students.

• The Journal of Society for e-Business Studies
• /
• v.12 no.4
• /
• pp.17-27
• /
• 2007

This paper proposes a key distribution and authentication protocol between user, service provider and key distribution center (KDC). This protocol is based on symmetric cryptosystem, challenge-response, Diffie-Hellman component and hash function. In the proposed protocol, user and server update the session key under token-update operation, and user can process repeated efficient authentications by using updated session keys. And another merit is that KDC needs not to totally control the session key between user and server in proposed protocol. Even an attacker steals the parameters from the KDC, the attacker still can not calculate session key. According to the comparison and analysis with other protocols, our proposed protocol provides good efficiency and forward secure session key.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.98-101
• /
• 2015

최근, 텔레비전을 시청하지 않는 대기 상태에서의 셋톱박스의 대기 전력이 여타 가전기기의 대기 전력보다 10 배 이상을 상회하고 있어, 셋톱박스의 대기전력 저감은 국가적으로도 관심을 받고 있다. 셋톱박스의 대기전력 저감을 위해 대기상태의 셋톱박스의 최소전력 동작 모드인 수동대기모드가 제안되었지만, 셋톱박스가 수동대기모드에서는 셋톱박스의 업데이트 및 제어가 어려우므로, 셋톱박스의 수동대기모드 활용은 어려울 것이다. 본 논문은 수동대기모드에 가까운 대기전력을 소모하면서도 대기상태에서도 셋톱박스의 업데이트를 제공할 수 있는 망연동수동대기 모드를 정의하고, 망연동수동대기모드를 이용한 셋톱박스의 업데이트를 위한 셋톱박스 제어기법을 제안하고, 이 제어 기법을 위한 셋톱박스와 네트워크의 구조, 기능, 시그널링에 대해 설명한다. 본 논문의 망연동수동대기모드와 제어 방안은 셋톱박스 사업자 측면에서 활용성이 높으므로, 낮은 대기전력을 소모하는 셋톱박스 시장을 활성화하여 국가 및 세계적인 전력 감소에 큰 기여를 할 것이다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.07a
• /
• pp.144-145
• /
• 2020

본 논문에서는 정밀한 3차원 복원 및 시점 합성을 위해 매칭 비용을 반복적으로 업데이트하는 Generalized Soft 3D Reconstruction (GenSoft3D) 알고리즘을 제안한다. 먼저 다시점 영상들과 카메라 자세정보가 주어지면 GenSoft3D는 볼륨 기반의 다시점 스테레오 매칭 알고리즘으로 시점별 초기 매칭 비용 볼륨 및 시차 맵을 계산한다. 그 후 정제 과정에서 각 시점은 모든 시차 맵을 이용하여 표면 확률 및 가시 확률을 계산한다. 표면 확률은 초기 매칭 비용 업데이트에 사용하며, 가시 확률은 폐색 영역의 정확한 시차를 계산하기 위해 사용된다. 해당 정제 과정을 일정 횟수 반복할 경우 시점별 고정밀의 시차 맵 획득이 가능하다. 또한 시차 맵의 정확도가 향상됨에 따라 정확한 시점 합성이 가능하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.421-425
• /
• 2006

본 논문에서는 TinyOS 기반의 센서 네트워크에 대한 리프로그래밍을 에너지 효율적으로 수행하기 위한 매커니즘을 제안한다. 베이스 스테이션에서 센서노드에게 프로그램 전체를 보내는 대신 이전 버전과의 차이인 델타를 생성해서 전송할 때 Multi-round Rsync 알고리즘을 적용해 델타 파일의 크기를 최대한 줄이는 기법과 업데이트가 불필요한 플래시메모리 페이지에 대한 업데이트를 방지하기 위한 페이지 맵 기법을 통해 Rsync만을 사용하는 기존 방식보다 최대 30% 이상 에너지를 절감할 수 있음을 확인하였다.