• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1306-1313
• /
• 1999

본 연구는 인터넷 기반 공유가상공간에서 시스템의 확장성을 유지하기 위하여 이동객체를 대상으로 하는 이벤트 필터링 기법을 제안하고자 한다. 제안된 다중격자 모델 기법은 이동객체의 경로 상에서 대표적인 이벤트를 샘플링하는 방식을 사용한다. 이 방식은 메시지 트래픽의 양을 동적으로 조절하기 위하여 이동객체 간의 관심정도 정보를 수치적으로 변환하여 이벤트 갱신빈도에 반영한다. 대량의 이동객체를 생성하여 제안된 기법을 적용한 성능평가 실험에서 기존의 방식에 비하여 평균 메시지 전송량이 50%이상 감소하는 것으로 확인할 수 있었다. 다중격자 모델은 참여자의 수와 메시지 트래픽 상황에 따라 가상환경의 공유 QoS를 동적으로 조절할 수 있으며, 인터넷 상에서 다수 사용자를 위한 3차원 가상사회 구축 및 온라인 네트워크 게임 개발 등에 활용될 수 있을 것이다.Abstract This paper proposes an event filtering technique that can dynamically control a large amount of event messages produced by moving objects like avatars or autonomous objects in a distributed virtual environment. The proposed multi-level grid model technique uses the method that extracts the representative events from the paths of moving objects. For dynamic control of message traffics, this technique digitizes the DOIs of the avatars and reflects the interest information controlling the frequency of message transmission. For the performance evaluation, a large number of moving objects were created and the model was applied to these avatar groups. In the experiments, more than 50% of messages have been reduced in comparison with the existing AOI-based filtering techniques. The proposed technique can dynamically control the QoS in proportion to the number of users and the amount of messages where a large number of users share a virtual space. This model can be applied to the development of 3D collaborative virtual societies and multi-user online games in the Internet.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.604-625
• /
• 2018

Nowadays, SMS spam has been overflowing in many countries. In fact, the standards of filtering SMS spam are different from country to country. However, the current technologies and researches about SMS spam filtering all focus on dividing SMS message into two classes: legitimate and illegitimate. It does not conform to the actual situation and need. Furthermore, they are facing several difficulties, such as: (1) High quality and large-scale SMS spam corpus is very scarce, fine categorized SMS spam corpus is even none at all. This seriously handicaps the researchers' studies. (2) The limited length of SMS messages lead to lack of enough features. These factors seriously degrade the performance of the traditional classifiers (such as SVM, K-NN, and Bayes). In this paper, we present a new fine categorized SMS spam corpus which is unique and the largest one as far as we know. In addition, we propose a classifier, which is based on the probability topic model. The classifier can alleviate feature sparse problem in the task of SMS spam filtering. Moreover, we compare the approach with three typical classifiers on the new SMS spam corpus. The experimental results show that the proposed approach is more effective for the task of SMS spam filtering.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.67-73
• /
• 2010

In SIP(Session Initiation Protocol) environment, the presence event notification operation makes presence service user to recognize presence information status changes of the other party. In conventional method, the user should send each SIP SUBSCRIBE message containing the address of the other party to the presence server. Furthermore each presence subscription requires refresh messages, and the amount of notification messages from the other party becomes large. These facts increases network traffic and the load of presence server. In this paper, to solve these problems a new presence list service has been suggested. It uses a presence list consists of URI of the other party and make it possible to subscribe by using one SUBSCRIBE message. So this method decreases the amount of SUBSCRIBE messages and refresh messages, and it also decreases the amount processing event notification messages from the subscribed the other party. And to increase the efficiency, a presence filtering method which enables to include some parts of selected presence information into the notification message body has been also suggested. The implemented system can reduce SIP message related network traffic and message processing time of the presence server. The performance of this proposed system has been evaluated by experiments, and the results showed decreasing of server processing time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.680-693
• /
• 2008

Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.246-248
• /
• 2005

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. However, CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO (Inha Semyung Humanoid RObot).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.933-935
• /
• 2014

휴대전화 사용의 대중화로 인하여 개개인의 휴대전화로 수신되는 스팸메시지의 양도 덩달아 증가하게 되었다. 이것은 휴대전화 사용자가 불법광고 노출의 원인이 되고 있다. 이에 많은 스팸메시지 차단기법이 제시되었지만 이는 텍스트기반의 문자메시지에 특화되어있어 문자가 포함되어있는 이미지스팸에는 차단이 어렵다는 문제점이 존재 한다. 이에 본 논문에서는 휴대전화로 오는 이미지메시지 중 스팸이미지를 검출해 내는 모바일 스팸이미지 필터링 시스템을 제시하고자 한다. 제시하고자 하는 시스템은 스팸이미지를 분석하여 이미지의 패턴을 검사하여 특정 패턴이 포함된 이미지에 대해서 스팸이미지로 분류하여 필터링하게 됨으로써, 실제 휴대전화로 수신되는 스팸이미지를 이용한 실험을 진행하였다. 그 결과 기존 텍스트기반 스팸필터링시스템에서 할 수 없었던 스팸이미지 필터링을 할 수 있음을 확인 하였다.

• Smart Media Journal
• /
• v.7 no.4
• /
• pp.24-29
• /
• 2018

Text analysis technique for natural language processing in deep learning represents words in vector form through word embedding. In this paper, we propose a method of constructing a document vector and classifying it into spam and normal text message, using word embedding and deep learning method. Automatic spacing applied in the preprocessing process ensures that words with similar context are adjacently represented in vector space. Additionally, the intentional word formation errors with non-alphabetic or extraordinary characters are designed to avoid being blocked by spam message filter. Two embedding algorithms, CBOW and skip grams, are used to produce the sentence vector and the performance and the accuracy of deep learning based spam filter model are measured by comparing to those of SVM Light.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.4
• /
• pp.3-38
• /
• 1996

The mobile station shall convolutionally encode the data transmitted on the reverse traffic channel and the access channel prior to interleaving. Code symbols output from the convolutional encoder are repeated before being interleaved except the 9600 bps data rate. All the symbols are then interleaved, 64-ary orthogonal modulation, direct-sequence spreading, quadrature spreading, baseband filtering and QPSK transmission. The sync, paging, and forward traffic channel except the pilot channel in the forward CDMA channel are convolutionally encoded, block interleaved, spread with Walsh function at a fixed chip rate of 1.2288 Mcps to provide orthogonal channelization among all code channels. Following the spreading operation, the I and Q impulses are applied to respective baseband filters. After that, these impulses shall be transmitted by QPSK. Authentication in the CDMA system is the process for confirming the identity of the mobile station by exchanging information between a mobile station and the base station. The authentication scheme is to generate a 18-bit hash code from the 152-bit message length appended with 24-bit or 40-bit padding. Several techniques are proposed for the authentication data computation in this paper. To protect sensitive subscriber information, it shall be required enciphering ceratin fields of selected traffic channel signaling messages. The message encryption can be accomplished in two ways, i.e., external encryption and internal encryption.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.449-452
• /
• 2000

This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.775-782
• /
• 2005

The service of wireless network has problems due to low bandwidth, frequent disconnection, low packet transport and user' mobility. In this paper, we proposed the cooperative methods of update to perform efficiently wireless network services. The proposed method performs the updates by cooperative filtering and streaming by $mbuffer_{in}$ and $mbuffer_{out}$. The simulation results show performance improvement of the proposed method compared to others.