• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.655-658
• /
• 2008

접근제어는 권한이 있는 사용자에게 데이터에 접근할 수 있도록 제한하는 것을 말한다. 본 논문에서는 웹 주소록과 일정관리 기능을 여러 사용자가 공유할 수 있게 하기 위해서 접근제어 기법을 적용한 웹사이트를 개발하였다. 접근권한을 기술하기 위하여 그룹의 개념을 도입하여 그룹일정에 대해서 공유범위를 설정할 수 있게 하였다. 한편 주소록과 일정관리 데이터를 vCard와 vCalendar 등의 마이크로포맷 표준을 도입 하였다. 그리고 최근 웹 2.0 기술로 주목받고 있는 루비 온 레일스(Ruby on Rails) 프레임워크를 사용하여 구현 하였다.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.167-181
• /
• 2010

WebDAV is an IETF standard protocol which supports asynchronous collaborative authoring on the Web. The WebDAV Access Control Protocol provides various methods of controlling the resources on a WebDAV server and their properties, helping high-level group activities to be performed through the WebDAV server. In this paper, to provide high level collaboration, we introduce a technique for managing access control over WebDAV resources through the WebDAV Access Control Protocol and describe the development of an access control manager for the CoSlide Collaborative system based on the technique. To provide users with the access control features in an easily understandable manner, the developed technique presents the privileges for performing WebDAV methods instead of the standard privileges in the WebDAV Access Control Protocol. In addition, we present the facility for detecting conflicts between new access privileges on resources and old access privileges on them. We applied the method-based access control management technique to the CoSlide collaborative system. The developed access control manager enables us to create group workspaces with flexible access control strategies for group members and resources.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.85-97
• /
• 2005

In this paper, we construct the traffic information database by using the acquired data from the traffic information devices installed in road network, and, by referring to this database, propose the intersection simulation system which can dynamically manage the real-time traffic flow for each section of road from the intersections, This system consists of hierarchical 3 parts, The lower layer is the physical layer where the traffic information is acquired on an actual road. The traffic flow control framework exists in the middle layer. The framework supports the grouping of intersection, the collection of real-time traffic flow information, and the remote monitoring and control by using the traffic information of the lower layer, This layer is designed by extending the distributed object group framework we developed. In upper layer, the intersection simulator applications controlling the traffic flow by grouping the intersections exist. The components of the intersection application in our system are composed of the implementing objects based on the Time-triggered Message-triggered Object(TMO) scheme, The intersection simulation system considers the each intersection on road as an application group, and can apply the control models of dynamic traffic flow by the road's status. At this time, we use the real-time traffic information collected through inter-communication among intersections. For constructing this system, we defined the system architecture and the interaction of components on the traffic flow control framework which supports the TMO scheme and the TMO Support Middleware(TMOSM), and designed the application simulator and the user interface to the monitoring and the controlling of traffic flow.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.91-92
• /
• 2023

이 연구에서는 선박이 군집을 이뤄 항해하는 방법으로, 추종 선박이 리더 선박의 궤적을 따라 항해하는 추종 알고리즘을 구현하고, 성능 검증을 위해 소형 RC 모형 보트를 사용하여 해상 실험을 수행하였다. 이 알고리즘은 추종 선박이 리더 선박의 궤적을 추종점으로 저장하고, 추종점까지의 목표 침로를 계산하여 추종하는 방법이다. 목표 침로는 시선각 유도법칙을 통해 계산하였으며, 목표 침로를 추종하기 위해 PD 제어를 적용한 침로 제어기를 구현하였다. 또한, 전방 선박과의 충돌을 방지하기 위해 전방 선박과의 거리에 따라 속력을 제어하는 알고리즘을 구현하였다. 구현된 알고리즘을 검증하기 위해 해상 실험을 진행하였으며, 결과를 분석하였다.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.597-604
• /
• 2002

Changing group key is necessary for the remaining members when a new member joins or a member leaves the group in multicast communications. It is required to guarantee perfect forward and backward confidentiality. Unfortunately, in large groups with frequent membership changes, key changes become the primary bottleneck for scalable group. In this paper, we propose a novel approach for providing efficient group key distribution in large and dynamic groups. Unlike existing secure multicast protocols, our protocol is scalable to large groups because both the frequency and computational overhead of re-keying is determined by the size of a subgroup instead of the size of the whole group, and offers mechanism to prevent the subgroup managers with group access control from having any access to the multicast data that are transfered by sender. It also provides security service for preserving privacy in wireless computing environments.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.6
• /
• pp.28-36
• /
• 2001

A robust adaptive sliding mode robot control algorithm is derived, which consists of a feed-forward compensation part and discontinuous control part. The unknown parameters is categorized into two groups, with group containing the parameters estimated on-line, and group containing the parameters not estimated on-line. Then a sliding control term is incorporated into the torque input in order to account for the effects of uncertainties on the parameters not estimated on-line and of disturbances. Moreover, the algorithm is computationally simple, due to an effective exploitation of the structure of manipulator dynamics. It is shown that, despite the existence of the parameter uncertainty and external disturbances, the controller is globally asymptotically stable and guarantees zero tracking errors.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.226-238
• /
• 1998

I studied a group management model of virtual class for distance education system on the information superhighway. There are many objects and actions that need to be managed and controlled in virtual classes of a distance education model. Educators should be able to manage students' learning group and immediately be aware of who is attending and who is quitting the learning group in a virtual class. Also, students and educators in virtual classes can communicate and discuss various topics. I proposed a group management model for distance education on a network, and studied management algorithm and MIB (Management Information Base), which are required to manage virtual classes in distance education systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.12
• /
• pp.473-482
• /
• 2019

There have already been studies analyzing the trajectories of objects from data streams of moving objects. Among those studies, there are also studies to discover groups of objects that move together, called companion groups. Most studies to discover companion groups use existing clustering techniques to find groups of objects close to each other. However, these clustering-based methods are often difficult to find the right companion groups because the number of clusters is unpredictable in advance or the shape or size of clusters is hard to control. In this study, we propose a new method that discovers companion groups based on the distance specified by the user. The proposed method does not apply the existing clustering techniques but periodically determines the groups of objects close to each other, by using a technique that efficiently finds the groups of objects that exist within the user-specified distance. Furthermore, unlike the existing methods that return only companion groups and their trajectories, the proposed method also returns their appearance and disappearance time. Through various experiments, we show that the proposed method can detect companion groups correctly and very efficiently.

• Information and Communications Magazine
• /
• v.17 no.3
• /
• pp.123-136
• /
• 2000

데이터(Data), 영상(Video) 그리고 음성(Audio)을 특정 사용자 그룹에게만 전송하는 데이터 전송기술인 멀티캐스트(Multicast)는 효과적인 그룹 접근 제어의 결려와 단일 유니캐스트 통신보다 많은 통신 링크 때문에, 부당한 공격자에게 많은 공격 기회를 제공하고 있다. 이것은 그룹의 수신자에게만 영향을 미치는 것이 아니라 잠재적으로 대부분의 네트워크에 연결된 사용자에게 영향을 미친다. 특히 참가자의 가입과 탈퇴 시에 신분위장, 재전송, 부인공격에 노출되어있기 때문에 이러한 부단한 공격 위협에 대한 보안대책이 필요하다. 본 논문에서는 안전한 멀티캐스트 트래픽 전송을 위한 보안 메커니즘 설계를 위한 기반 기술로서 멀티캐스트에서 보안의 필요성과 멀티캐스트에서 고려해야할 보안 서비스를 분석하고 단일 송신자와 다중 그룹에서 구성될 수 있는 보안 구조 및 보안 구성요소를 연구하였다.