Showing papers in "Journal of KIISE:Computer Systems and Theory in 2002"

Finding Approximate Covers of Strings

Abstract: Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

A Secure and Efficient Metering Scheme for Internet Advertising

Abstract: In this paper, we consider a secure and efficient metering scheme to measure the interaction between clients and servers in interned advertising. In most cases internet advertising is composed of clients, servers, and an audit agency who collects a metering information about the number of clients that were served by each server. The metering scheme should always be secure against fraud attempts by servers which maliciously try to inflate the number of their clients and against clients that attempt to disrupt the metering process. So we suggest secure and efficient metering schemes, based on some cryptographic techniques, which are also very accurate and robust

OTP-EKE: A Key Exchange Protocol based on One-Time-Password

Abstract: Mutual authentication is essential for key exchange protocols and password-based authentication scheme is used widely, which is convenient to users and executed on the cheap. Password-based protocol should be not only secure against attach but also efficient to reduce user's load. In this paper, we propose a new key exchange protocol, called OTP-EKE(One Time Password based Encrypted Key Exchange), to provide authentication and to share a session key between a server and a user. We choose a password-based scheme as a user authentication. Especially, we use a one-time-password verifier and server's public password to protect against attacks on server's directory. As for efficiency, we improve the performance by reducing the number of modular exponentiations and the number of rounds.

Computer Generated Color Paper Mosaic Rendering

Abstract: Recently as it is growing concern about NPR(Non-Photorealistic Rendering), Several computer graphics researchers are studying to simulate conventional artistic expressions such as pen-and-ink illustrations, watercolor and impressionism technique. In the NPR it is important thing that someone can produce a representation looked like work drawn or manipulated people directly. In this paper we propose that the technique could make the mosaic work automatically, tore and tagged a paper by hands used to educational and artistical representation, we suggest various methods to express a shape and texture of paper tore by hands without using cutters or scissors.

Design of A Media Processor Equipped with Dual Cache

Abstract: In this paper, we propose a mediaprocessor of dual-cache architecture which is composed of the multimedia data cache and the general-purpose data cache to prevent performance degradation caused by memory delay. In the proposed processor architecture, multimedia data that are written in subword instructions are loaded in the multimedia data cache and the remaining data are loaded in the general-purpose data cache. Also, Ive use multi-block prefetching scheme that fetches two consecutive data blocks into a cache at a time to exploit the locality of multimedia data. Experimental results on MPEG and JPEG benchmark programs show that the proposed processor architecture results in better performance than the processor equipped with single data cache.

Post-Rendering 3D Warping using Projective Texture

Abstract: Due to the recent development of graphics hardware, real-time rendering of complex scenes is still a challenging task As results of researches on image based rendering, the rendering schemes based on post-rendering 3D warping have been proposed In general, these methods produce good rendering results However, they are not appropriate for real-time rendering since it is not easy to accelerate the time-consuming algorithms within graphics subsystem As an attempt to resolve this problem of the post-rendering 3D warping technique, we present a new real-time scheme based on projective texture In our method, two reference images obtained by rendering complicated objects at two consecutive points of time are used Rendering images of high quality for intermediate points of time are obtained by projecting the reference images onto a simplified object, and then blending the resulting images Our technique will be effectively used in developing real-time graphics applications such as 3D games and virtual reality software and so on

A New Network Bandwidth Reduction Method of Distributed Rendering System for Scalable Display

Abstract: Scalable displays generate large and high resolution images and provide an immersive environment Recently, scalable displays are built on the networked clusters of PCs, each of which has a fast graphics accelerator, memory, CPU, and storage However, the distributed rendering on clusters is a network bound work because of limited network bandwidth In this paper, we present a new algorithm for reducing the network bandwidth and implement it with a conventional distributed rendering system This paper describes the algorithm called geometry tracking that avoids the redundant geometry transmission by indexing geometry data The experimental results show that our algorithm reduces the network bandwidth up to 42%

Wavelet-Based Level-of-Detail Representation of 3D Objects

Abstract: In this paper, we propose a 3D object LOD(Level of Detail) modeling system that constructs a mesh from range images and generates the mesh of various LOD using the wavelet transform. In the initial mesh generation, we use the marching cube algorithm. We modify the original algorithm to apply it to construct the mesh from multiple range images efficiently. To get the base mesh we use the decimation algorithm which simplifies a mesh with preserving the topology Finally, when reconstructing new mesh which is similar to initial mesh we calculate the wavelet coefficients by using the wavelet transform. We solve the critical problem of wavelet-based methods - the surface crease problem (1) - by using the mesh simplification as the base mesh generation method.

A Distributed Deadlock Detection and Resolution Algorithm for the OR Model

Abstract: Deadlock detection in distributed systems is considered difficult since no single site knows the exact information on the whole system state. This paper proposes a time-efficient algorithm for distributed deadlock detection and resolution. The initiator of the algorithm propagates a deadlock detection message and builds a reduced wait-for graph from the information carried by the replies. The time required for deadlock detection is reduced to half of that of the other algorithms. Moreover, any deadlock reachable from the initiator is detected whereas most previous algorithms only find out whether the initiator is involved in deadlock. This feature accelerates the detection of deadlock. Resolution of the detected deadlock is also simplified and precisely specified, while the current algorithms either present no resolution scheme or simply abort the initiator of the algorithm upon detecting deadlock.

Design and Performance of a CC-NUMA Prototype Card for SCI-Based PC Clustering

Abstract: It is extremely important to minimize network access time in constructing a high-performance PC cluster system For an SCI based PC cluster it is possilbe to reduce the network access time by maintaining network cache in each cluster node, This paper presents a CC-NUMA card that utilizes network cache for SCI based PC clustering The CC-NUMA card is directly plugged into the PCI solot of each node, and contains shared memory network cache, and interconnection modules. The network cache is maintained for the shared memory on the PCI bus of cluster nodes. The coherency mechanism between the network cache and the shared memory is based on the IEEE SCI standard. A CC-NUMA prototype card is developed to evaluate the performance of the system. According to the experiments. the cluster system with the CC-NUMA card showed considerable improvements compared with an SCI based clustser without network cache.

Deterministic Measures of Fault-Tolerance in Recursive Circulants and Hypercubes

Abstract: The connectivity and edge-connectivity have been the prime deterministic measure of fault tolerance in multicomputer networks. These parameters have a problem that they do not differentiate the different types of disconnected graphs which result from removing the disconnecting vertices or disconnecting edges. To compensate for this shortcoming, one can utilize generalized measures of connectedness such as superconnectivity, toughness, scattering number, vertex-integrity, binding number, and restricted connectivity. In this paper, we analyze such deterministic measures of fault tolerance in recursive circulants and hypercubes, and compare them in terms of fault tolerance.