• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2009년도 춘계학술발표논문집
• /
• pp.696-699
• /
• 2009

A VPN is a private network that uses a public network to connect remote sites or users together. As its popularity grows, companies, organization and even the government turned to it as a means of extending their own networks. To setup a Virtual Private a proper IP VPN Architecture must first be selected. In this paper, the types of IP Virtual Private Network Architecture like the MPLS-Based, IPSec-Based and the SSL/TLS-Based are discussed and compared. The comparison may serve as a guide for selecting the proper IP Virtual Private Network Architecture that is suitable for the company's needs.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.252-257
• /
• 1998

A method of multimedia information data acquisition based on fuzzy rules is proposed, where the multimedia means the five senses of a human being. Observed information is characterized by VAGOT(visual, acoustic, gustatory, olfactory and tactile) time series data and the goal is to extract an appropriate subset of the VAGOT data based on a given instruction. Fuzzy rules based on visual and acoustic information are used to identify the appropriate time interval on the fireworks multimedia information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권3호
• /
• pp.976-990
• /
• 2020

The k-means algorithm is widely used in academia and industry due to easy and simple implementation, enabling fast learning for complex datasets. However, k-means struggles to classify datasets without prior knowledge of specific domains. We proposed the repulsive k-means (RK-means) algorithm in a previous study to improve the k-means algorithm, using the repulsive force concept, which allows deleting unnecessary cluster centroids. Accordingly, the RK-means enables to classifying of a dataset without domain knowledge. However, three main problems remain. The RK-means algorithm includes a cluster repulsive force offset, for clusters confined in other clusters, which can cause cluster locking; we were unable to prove RK-means provided optimal convergence in the previous study; and RK-means shown better performance only normalize term and weight. Therefore, this paper proposes the advanced RK-means (ARK-means) algorithm to resolve the RK-means problems. We establish an initialization strategy for deploying cluster centroids and define a metric for the ARK-means algorithm. Finally, we redefine the mass and normalize terms to close to the general dataset. We show ARK-means feasibility experimentally using blob and iris datasets. Experiment results verify the proposed ARK-means algorithm provides better performance than k-means, k'-means, and RK-means.

• 한국정보처리학회논문지
• /
• 제4권8호
• /
• pp.1921-1929
• /
• 1997

본 논문은 멀티미디어 데이타 스트림이 시스템 메모리를 거치지 않고 멀티미디어 데이타 처리기와 통신망 접속기 간에 직접 전달될 수 있는 방법에 대한 연구이다. 멀티미디어 플랫폼에서 통신망 접속기와 멀티미디어 데이타 처리기 간에 추가적인 데이타 전송로 도입이 없이 기존의 단일 데이타 전송로를 통한 양자간의 직접 데이타 전달방법을 제안한다. 그리고 직접전달을 위해 필요한 하드웨어적 구조와 기능을 정의하고, 멀티미디어 데이타가 상호간 전송/반입되는 과정을 제어 흐름도로 기술한다. 제안된 방법과 기존의 일반적인 방법과의 비교 검토를 위해, 직접전달 방법이 시스템 버스의 사용 회수와 사이클을 줄일 수 있음을 보인다.

• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.43-50
• /
• 2022

For high-quality education of the modern generation of students, forms of organizing the educational process and the latest methods of obtaining knowledge that differ from traditional ones are necessary. The importance of multimedia teaching tools is shown, which are promising and highly effective tools that allow the teacher not only to present an array of information in a larger volume than traditional sources of information, but also to include text, graphs, diagrams, sound, animation, video, etc. in a visually integrated form. Approaches to the classification of multimedia learning tools are revealed. Special features, advantages of multimedia, expediency of use and their disadvantages are highlighted. A comprehensive analysis of the capabilities of multimedia teaching tools gave grounds for identifying the didactic functions that they perform. Several areas of multimedia application are described. Multimedia technologies make it possible to implement several basic methods of pedagogical activity, which are traditionally divided into active and passive principles of student interaction with the computer, which are revealed in the article. Important conditions for the implementation of multimedia technologies in the educational process are indicated. The feasibility of using multimedia in education is illustrated by examples. Of particular importance in education are game forms of learning, in the implementation of which educational elements based on media material play an important role. The influence of the game on the development of attention by means of works of media culture, which are very diverse in form and character, is shown. The importance of the role of multimedia in student education is indicated. In the educational process of multimedia students, a number of educational functions are implemented, which are presented in the article. Recommendations for using multimedia are given.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.407-412
• /
• 2007

본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

• 한국멀티미디어학회논문지
• /
• 제23권1호
• /
• pp.1-7
• /
• 2020

Clustering methods essentially take a two-step approach; extracting feature vectors for dimensionality reduction and then employing clustering algorithm on the extracted feature vectors. However, for clustering images, the traditional clustering methods such as stacked auto-encoder based k-means are not effective since they tend to ignore the local information. In this paper, we propose a method first to effectively reduce data dimensionality using convolutional auto-encoder to capture and reflect the local information and then to accurately cluster similar data samples by using a hierarchical clustering approach. The experimental results confirm that the clustering results are improved by using the proposed model in terms of clustering accuracy and normalized mutual information.

• 한국멀티미디어학회논문지
• /
• 제19권1호
• /
• pp.30-40
• /
• 2016

Recently, the competition among global IT companies for the market occupancy of the IoT(Internet of Things) is fierce. Internet of Things are all the things and people around the world connected to the Internet, and it is becoming more and more intelligent. In addition, for the purpose of providing users with a customized services to variety of context-awareness, IoT platform and related research have been active area. In this paper, we analyze third party instant messengers of Windows 8 Style UI and propose a digital forensic methodology. And, we are well aware of the Android-based map and navigation applications. What we want to show is GPS information analysis by using the R. In addition, we propose a structured data analysis applying the hierarchical clustering model using GPS data in the digital forensics modules. The proposed model is expected to help support the IOT services and efficient criminal investigation process.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2000년도 추계학술발표논문집
• /
• pp.266-270
• /
• 2000

내용기반 영상검색시스템에서 객체 단위로 영상을 검색하기 위해서는 영상에서 의미있는 객체를 추출하는 과정이 필수적이며, 이를 위해 영역 분할을 효율적으로 수행하기 위한 양자화가 선행되어야 한다. 일반적인 칼라 양자화 기법은 칼라 수를 줄이되 양자화 된 영상이 원시 영상과 가능할 비슷해 보이도록 하는 것을 목적으로 하지만, 영역 분할을 위한 칼라 양자화에서는 칼라의 표현보나는 의미있는 객체를 용이하게 추출할 수 있도록 양자화 하는 것을 목적으로 한다. 본 논문에서는 기존의 Octree 양자화 방법과 K-means 알고리즘의 장점을 조합하여 영역 분할에 용이한 양자화 결과를 얻을 수 있는 방법을 제안한다. 먼저, Octree 양자화 방법을 수행하여 얻어진 양자화 된 칼라들 중에서 시각적으로 유사한 칼라를 병합함으로써, Octree 양자화 방법의 단점인 강제 분할 문제점을 해결한다. 이어서, 병합 후의 양자화 된 칼라에 대해서만 K-means 알고리즘을 수행함으로써, 보다 빠른 시간 내에 영역 분할에 적합한 양자화 된 영상을 얻는다. 실험을 통해 제안한 방법의 효용성을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.336-343
• /
• 2017

We propose a real time personalized recommendation algorithm on the mobile device. We use a unified collaborative filtering with reduced data. We use Fuzzy C-means clustering to obtain the reduced data and Konohen SOM is applied to get initial values of the cluster centers. The proposed algorithm overcomes data sparsity since it extends data to the similar users and similar items. Also, it enables real time service on the mobile device since it reduces computing time by data clustering. Applying the suggested algorithm to the MovieLens data, we show that the suggested algorithm has reasonable performance in comparison with collaborative filtering. We developed Android-based smart-phone application, which recommends restaurants with coupons and restaurant information.