• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.35D no.9
• /
• pp.70-76
• /
• 1998

By controlling the pixel of a LCD spatial light modulator electronically, we made a real-time moving window passing through the light on a LCD spatial light modulator. By using this LCD moving window, we suggested an angular multiplexed holographic memory system and in case of windows of 10$\times$10 pixels and 2$\times$2 pixels the total numbers of address are 1,536 and 38,400, respectively. To demonstrate the feasibility of the proposed method, we recorded and reconstructed 30 images by 30 input addresses.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.171-174
• /
• 2004

Packet classification is an essential architectural component in implementing the quality-of-service (QoS) in today's Internet which provides a best-effort service to ail of its applications. Multiple header fields of incoming packets are compared against a set of rules in packet classification, the highest priority rule among matched rules is selected, and the packet is treated according to the action of the rule. In this Paper, we proposed a new packet classification scheme based on parallel multiple hashing on tuple spaces. Simulation results using real classifiers show that the proposed scheme provides very good performance on the required number of memory accesses and the memory size compared with previous works.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.6
• /
• pp.377-384
• /
• 2017

The scope of the matrix application is so broad that it can not be limited. A typical matrix application area in computer science is image processing. Particularly, radar scanning equipment implemented on a small embedded system requires real-time matrix transposition for image processing, and since its memory size is small, a general matrix transposition algorithm can not be applied. In this case, matrix transposition must be done in disk space, such as flash disk, using a limited memory buffer. In this paper, we analyze and improve a recently published flash disk-based matrix transposition algorithm named as asymmetric sub-matrix transposition algorithm. The performance analysis shows that the asymmetric sub-matrix transposition algorithm has lower performance than the conventional sub-matrix transposition algorithm, but the improved asymmetric sub-matrix transposition algorithm is superior to the sub-matrix transposition algorithm in 13 of the 16 experimental data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1272-1290
• /
• 2013

Privacy-preserving collaborative filtering schemes are becoming increasingly popular because they handle the information overload problem without jeopardizing privacy. However, they may be susceptible to shilling or profile injection attacks, similar to traditional recommender systems without privacy measures. Although researchers have proposed various privacy-preserving recommendation frameworks, it has not been shown that such schemes are resistant to profile injection attacks. In this study, we investigate two memory-based privacy-preserving collaborative filtering algorithms and analyze their robustness against several shilling attack strategies. We first design and apply formerly proposed shilling attack techniques to privately collected databases. We analyze their effectiveness in manipulating predicted recommendations by experimenting on real data-based benchmark data sets. We show that it is still possible to manipulate the predictions significantly on databases consisting of masked preferences even though a few of the attack strategies are not effective in a privacy-preserving environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.9
• /
• pp.793-802
• /
• 2000

본 논문에서는 분산 공유 메모리(distributed shared memory) 시스템에서 데이터의 일치성(consistency)을 마감시간(deadline) 이내에 완료하기 위해서 새로운 실시간 프로토콜을 제안한다. 분산 공유 메모리 시스템에서 사용되는 공유 데이터는 여러 시스템에 복제를 할 수 있기 때문에 이들간 일치성을 효과적으로 유지시키기 위한 여러 방법이 연구되어 왔다. 기존의 방법들은 평균 액세스 비용을 단축시키기 위한 것이고 프로토콜에 따라 서로 다른 복사본의 개수를 갖게 되며 일치성 유지를 위한 비용은 시스템이 갖고 있는 복사본의 개수에 따라 증가한다. 각 노드가 서로 다른 데드라인을 갖는 실시간 분산시스템에서는 일치성 유지를 주어진 데드라인이내에 완료하기 위해서는 일치성 유지를 위한 비용을 줄이는 것도 요구되지만 데드라인이 상대적으로 급한 노드에 대한 우선적인 처리가 요구된다. 실시간 프로토콜에서는 각 분산 시스템에서 데드라인이 상대적으로 급한 노드가 항시 복사본을 갖게 하고 전체 복사본의 개수를 제한한다. 시뮬레이션을 통해서 실시간 프로토콜의 성능향상을 확인하였다.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.459-462
• /
• 2003

Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users with a preview of processing results. In this paper, we investigate the problem of selectivity estimation in the context of a spatial dataset. Although several techniques have been proposed in the literature to estimate spatial query result sizes, most of those techniques still have some drawback in the case that a large amount of memory is required to retain accurate selectivity. To eliminate the drawback of estimation techniques in previous works, we propose a new method called MW Histogram. Our method is based on two techniques: (a) MinSkew partitioning algorithm that processes skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. With the experimental result, we prove that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• Economic and Environmental Geology
• /
• v.33 no.1
• /
• pp.41-50
• /
• 2000

Geo-radar survey which has the advantage of high-resolution and relatively fast survey has been widely used for engineering and environmental problems. Three-dimensional effects have to be considered in the interpretation of geo-radar for high-resolution. However, there exists a trouble on the analysis of the three dimensional effects. To solve this problem an efficient three dimension numerical modeling algorithm is needed. Numerical radar modeling in three dimensional case requires large memory and long calculating time. In this paper, a finite difference method time domain solution to Maxwell's equations for simulating electromagnetic wave propagation in three dimensional media was developed to make economic algorithm which requires smaller memory and shorter calculating time. And in using boundary condition Liao absorption boundary. The numerical result of cross-hole radar survey for tunnel is compared with real data. The two results are well matched. To prove application to three dimensional analysis, the results with variation of tunnel's incident angle to survey cross-section and the result when the tunnel is parallel to the cross-section were examined. This algorithm is useful in various geo-radar survey and can give basic data to develop dat processing and inversion program.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.307-313
• /
• 2011

In this paper, we compare performance of three models. The Holt-Winters, FARIMA and ARGARCH models, are used in predicting internet traffic data for analysis of traffic characteristics. We first introduce the time series models and apply them to real traffic data to forecast. Finally, we examine which model is the most suitable for explaining the long memory, the characteristics of the traffic material, and compare the respective prediction performance of the models.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.29-34
• /
• 2001

In this paper, a new associative memory system for analog time-sequential data processing is proposed. This system effectively associate time-sequential data using not only matching with present data but also matching with past data. Furthermore in order to improve error correction ability, weight varying in time domain is introduced in this system. The network is simulated with several periodic time-sequential input patterns including noise. The results show that the proposed system has ability to correct input errors. We expect that the proposed system may be applied for a real time processing of analog time-sequential information.