• Title/Summary/Keyword: 서브그룹

Search Result 108, Processing Time 0.028 seconds

Design and Implementation of Dynamic Multicast Group Key Management Protocol for Multicast Information Security (멀티캐스트 정보 보안을 위한 동적 그룹 키 관리 프로토콜 설계 및 구현)

  • 홍종준;김태우
    • Convergence Security Journal
    • /
    • v.2 no.2
    • /
    • pp.19-27
    • /
    • 2002
  • This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after checking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

  • PDF

Comparison of Association Rule Learning and Subgroup Discovery for Mining Traffic Accident Data (교통사고 데이터의 마이닝을 위한 연관규칙 학습기법과 서브그룹 발견기법의 비교)

  • Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.1-16
    • /
    • 2015
  • Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

Design and Implementation of Dynamic Group Key Management Protocol for Multicast Information Security (전자상거래를 위한 멀티캐스트 그를 키 관리 프로토콜 설계 및 구현)

  • 홍종준;김태우
    • Convergence Security Journal
    • /
    • v.2 no.1
    • /
    • pp.99-107
    • /
    • 2002
  • This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication under electronic commerce. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after checking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

  • PDF

Multicast Scheduling Algorithm using PGM Method in WDM Broadcast Networks (WDM 방송망에서 PGM 기법을 이용한 멀티캐스트 스케줄링 알고리즘)

  • 진교홍
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.248-256
    • /
    • 2002
  • In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H-EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.

Group key management using CBT with multi-core (다중 코어를 가지는 CBT에서의 그룹키 관리)

  • 조태남;김상희;은상아;이상호;채기준;박원주
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.763-764
    • /
    • 2002
  • 원격화상회의나 소프트웨어 배포 등 멀티캐스팅의 보안을 위해서 사용하는 그룹키는 그룹의 규모가 클 경우에도 멤버쉽 변화에 대하여 효율적으로 갱신이 이루어져야 한다. 본 논문에서는 DEP 구조를 멀티캐스트 프로토콜인 CBT에 적용한 2계층 관리 구조를 제안함으로써 키갱신 메시지 전송의 암.복호화 횟수를 제한아였으며, 서브 그룹 관리자를 그룹 통신으로부터 배제할 수 있는 효율적인 키관리 프로토콜을 제시하였다.

  • PDF

A Data Transfer Method of the Sub-Cluster Group based on the Distributed and Shared Memory (분산 공유메모리를 기반으로 한 서브 클러스터 그룹의 자료전송방식)

  • Lee, Kee-Jun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.635-642
    • /
    • 2003
  • The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

Exploring the Research Trends of Learning Strategies in Korean Language Education Using Co-word Analysis (동시출현단어 분석을 활용한 한국어교육에서의 학습전략 연구 동향 탐색)

  • Heo, Youngsoo;Park, Ji-Hong
    • Journal of the Korean Society for information Management
    • /
    • v.38 no.2
    • /
    • pp.65-86
    • /
    • 2021
  • In the foreign language education, learners are an important part of education, however in the Korean language education, the study of learners was insufficient compared to the contents of education, teaching methods and textbooks. Therefore, it is meaningful to analyze how learner research, especially learning strategy research, has been conducted and derive areas that need research for better education. In this study, co-word analysis was conducted on the titles of academic journals and dissertations in order to analyze the learning strategy research in Korean language education. I found it is about "reading" that the most studies related to Korean language learners' learning strategies were conducted and those studies' subjects mostly were 'Chinese international students' and 'marriage-immigrants'. In addition, the results of the subgroup analysis on the research topic show four major subgroups: a group related to 'reading for academic purposes', a group related to 'request, rejection, conversation, etc.', a group related to 'writing', and a group related to 'vocabulary, listening'. This shows that the researchers' major interests in studying Korean learner's strategies are "reading" and "speaking" and their studies have been concentrated in the specific areas. Therefore, it is necessary for researchers to study various functions and subjects in Korean language learner's learning strategies.

A Study on Kinetic Light-Emitting Object Control Systems Using Convergence Wireless Communication and the Methodologies of Research (융복합 무선통신을 이용한 키네틱 발광 오브젝트 제어 장치 및 방법에 관한 연구)

  • Kang, Hee-Ra
    • Journal of Digital Convergence
    • /
    • v.13 no.6
    • /
    • pp.247-256
    • /
    • 2015
  • This study is on kinetic light-emitting object control systems and the methodologies for research. The study explores the methodologies for researching and findings on kinetic light-emitting object control systems, which consist of multiple objects comprising multiple groups; the main control section that transmits the main control signals that correspond to each of the groups in order to display forms using multiple objects; multiple sub control sections that transmit sub control signals in correspondence to each of the objects in the corresponding groups from the above in accord with the main control signal; and multiple driving parts that control the length of the wires connected to each of the multiple objects according to the sub control signal.

Reversible Data Hiding Method Based on Min/Max in 2×2 Sub-blocks (2×2 서브블록에서 최소/최대값을 이용한 가역 정보은닉기법 연구)

  • Kim, Woo-Jin;Kim, Pyung-Han;Lee, Joon-Ho;Jung, Ki-Hyun;Yoo, Kee-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.69-75
    • /
    • 2014
  • A novel reversible data hiding method using pixel value ordering and prediction error expansion in the sub-block is resented in this paper. For each non-overlapping $2{\times}2$ sub-block, we divide into two groups. In the min group, the lowest value is changed to embed a secret bit and the highest value is changed in the max group. The experimental results show that the proposed method achieves a good visual quality and high capacity. The proposed method can embed 13,900 bits on average, it is higher 4,553 bits than the previous method and the visual quality is maintained 31.39dB on average.

A Study on the Load Balancing Algorithm using Unit Sub-block for Distributed Volume Rendering (분산 볼륨 렌더링에서 단위 서브-블록을 이용한 로드 밸런싱 알고리즘에 대한 연구)

  • Kim, Dae-Hyun;Kim, Tai-Yun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.1 no.2
    • /
    • pp.213-225
    • /
    • 1995
  • 3 차원 볼륨 데이터를 시각화(visualization)하기 위해서는 많은 계산 량과 메모리 량을 필요로 한다. 단일컴퓨터에서 순차 알고리즘을 이용하여 데이터를 시각화하고 분석하는 것은 실시간 응용 프로그램에는 부적합하다. 기존의 병렬 볼륨 렌더링에서의 데이터 분할 방법은 대부분 정적 로드 밸런싱(static load balancing)에 기반하고 있다. 동적 로드 밸런싱에 기반한 기존의 방법들은 불륨 데이터의 정규성(regularity)을 이용할 수 없다는 단점이 있다. 본 연구에서는 3 차원 볼륨 데이터에 대하여 로컬 태스크 큐(local task queue) 기법에 기반한 새로운 로드밸런싱 알고리즘을 제안한다. 제안한 방법은 계산에 참여할 노드(node)들을 PVM(parallel virtual machine)의 동적 프로세스 그룹(dynamic process group: DPG)을 이용하여 정적으로 그룹화(grouping)한다. 각각의 DPG들은 로컬 태스크 큐를 기반으로 단위 서브-블록에 대하여 동적 로드 밸런싱을 수행한다. 최적화된 레이 캐스팅 알고리즘들을 분산 환경에 새롭게 적용함으로써 로드 밸런싱으로 생길 수 있는 오버 헤드를 최소화하였다.

  • PDF