Recently, the importance of geoCRM (geographic Customer Relationship Management) systems are growing rapidly. So, result of the recognition that their applications extend well beyond the traditional CRM systems with the advent of ubiquitous environment and generalized location based services. A majority of traditional CRM systems are either incapable of managing spatial data or are not user-friendly when doing so. On the other hand, the geoCRM systems can be built as providing the geographic-based functions about CRM, including spatial and market analyses and the visualization of customer data, etc. However, it lacks the specific model and implementation of the geoCRM systems, being caused by the incomprehension of needs, the absence of related standards and the difficulties of development, and so on. In this paper, we develop a new spatial analysis supporting system that to enhance productivity through the convenient use and management of spatial data. The functionality provided by our system includes a set of analysis functions based on data mining techniques which allow a user to affect powerful transformation on spatial data. Particularly, both spatial data and non-spatial attributes can be efficiently handled as an object through our OODBMS.

This paper proposes a signature using dominant singular values for video sequence matching. By considering the input image as matrix A, a partition procedure is first performed to separate the matrix into non-overlapping sub-images of a fixed size. The SVD(Singular Value Decomposition) process decomposes matrix A into a singular value-singular vector factorization. As a result, singular values are obtained for each sub-image, then k dominant singular values which are sufficient to discriminate between different images and are robust to image size variation, are chosen and normalized as the signature for each block in an image frame for matching between the reference video clip and the query one. Experimental results show that the proposed video signature has a better performance than ordinal signature in ROC curve.

In this paper, we will present a container auto-landing system, the system use the stereo camera to measure the container depth information. And the container region can be detected by using its hough line feature. In the line feature detection algorithm, we will detect the parallel lines and perpendicular lines which compose the rectangle region. Among all the candidate regions, we can select the region with the same aspect-ratio to the container. The region will be the detected container region. After having the object on both left and right images, we can estimate the distance from camera to object and container dimension. Then all the detect dimension information and depth inform will be applied to reconstruct the virtual environment of crane which will be introduce in this paper. Through the simulation result, we can know that, the container detection rate achieve to 97% with simple background. And the estimation algorithm can get a more accuracy result with a far distance than the near distance.

In this paper, a novel system for avatar motion controlling by tracking face is presented. The system is composed of three main parts: firstly, LCS (Local Cluster Searching) method based face feature detection algorithm, secondly, HMM based feature points recognition algorithm, and finally, avatar controlling and animation generation algorithm. In LCS method, face region can be divided into many small piece regions in horizontal and vertical direction. Then the method will judge each cross point that if it is an object point, edge point or the background point. The HMM method will distinguish the mouth, eyes, nose etc. from these feature points. Based on the detected facial feature points, the 3D avatar is controlled by two ways: avatar orientation and animation, the avatar orientation controlling information can be acquired by analyzing facial geometric information; avatar animation can be generated from the face feature points smoothly. And finally for evaluating performance of the developed system, we implement the system on Window XP OS, the results show that the system can have an excellent performance.

Most of existing watermarking schemes insert and extract a watermark, focusing on the visual conservation of an original image. However, existing watermarking schemes could be difficult for a watermark detection in case of various distortion caused by display-capture devices. Therefore, we propose a new display-capture based mobile watermarking scheme. The proposed watermarking scheme is a new concept for embedding a watermark, which uses the generated image instead of a given original image. For effective watermark decoding, we also present a method for detecting the background image whose error bit can not be corrected because of various heavy distortion and for avoiding it from the decoding process. For this scheme, we adopt distortion coefficients of camera calibration when we separate a background image from a captured image. For finding available correction bits of ECC through the decoding process, we capture 30,000 images and then calculate the separation ratio of a background image and the average error bits per an image. As experimental result, the separation ratio of a background image is about 96.5% in 30,000 captured image. And the false alarm ratio shows about $5.18{\times}10^{-4}$ in the separated background image. And also we can confirm the availability of real-time processing because the mean execution time is about 82ms per an image for capturing and decoding.

Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

In this paper we propose a flexible video authentication scheme based on aggregate signature, which provides authenticity of a digital video by means of cryptographic signature to guarantee right of users. In contrast to previous works, the proposed scheme provides flexible usages on content distribution system, and it allows addition of new contents to the signed contents and deletion of some parts of the signed contents. A modification can be done by content owner or others. Although contents are modified by one or more users, our scheme can guarantee each user's right by aggregation of the each user's signatures. Moreover, proposed scheme has half size of Digital Signature Algorithm (DSA) with comparable security.

We present a physics-based blending method for the second order algebraic implicit surface. Unlike other traditional blending techniques, the proposed method avoids complex mathematical operations and unwanted artifacts like bulge, which have highly limited the application of the second order algebraic implicit surface as a modeling primitive in spite of lots of its excellent properties. Instead, the proposed method provides the designer with flexibility to control the shapes of the blending surface on interactive basis; the designer can check and design the shape of blending surfaces accurately by simply adjusting several physics parameter in real time, which was impossible in the traditional blending methods. In the later parts of this paper, several results are also presented.

Recent development in game technologies has offered various game environments, but the existing games have not provided realistically felt game environments because the element of the game is virtually generated in most of the games. Therefore, we propose a mixed game environment based on spatial augmented reality by using a creature that really exists. In the proposed game environment, tracking based on camera images created in real-time enables the provision of information about the real creature that is both still and moving. The game environment is presented with virtual object by using the coordinate of a real creature. Then, spatial augmented reality technology is applied for mixing a real creature and virtual game elements. Thus, the game scene is displayed by the spatial augmented reality technique based on the real-time coordinate of real creatures. Moreover, by providing the realistic game environment based on the spatial augmented reality, our system can be applied to various game contents that are actually felt as real. Most importantly, our system arouses the players' interest in a new kind of game environment.

More and richer information sources and services are available on the web everyday. However, harmful information, such as adult content, is not appropriate for all users, notably children. Since internet is a worldwide open network, it has a limit to regulate users providing harmful contents through each countrie's national laws or systems. Additionally it is not a desirable way of developing a certain system-specific classification technology for harmful contents, because internet users can contact with them in diverse ways, for example, porn sites, harmful spams, or peer-to-peer networks, etc. Therefore, it is being emphasized to research and develop context-based core technologies for classifying harmful contents. In this paper, we propose an efficient text filter for blocking harmful texts of web documents using context-based technologies and examine which algorithms for feature selection, the process that select content terms, as features, can be useful for text categorization in all content term occurs in documents, are suitable for classifying harmful contents through implementation and experiment.

Online game servers usually has been using the static thread pool system. But this system is not fit for huge online game server because the overhead is always up-and-down. Therefore, in this paper, we suggest the new algorithm for huge online game server. This algorithm is based on the prediction-based dynamic thread pool system. But it was developed for web servers and every 0.1 seconds the system prediction the needed numbers of threads and determine the thread pool size. Some experimental results show that the check time of 0.4 seconds is the best one for online game server and if the number of worker threads do not excess or lack to the given threshold then we do not predict and keep the current state. Otherwise we apply the prediction algorithm and change the number of threads. Some experimental results shows that this proposed algorithm reduce the overhead massively and make the performance of huge online game server improved in comparison to the static thread pool system.