In this paper, we conduct a performance analysis for the composite scheme that is obtained by combining the data distribution and the data replication schemes usually used for the implementation of distributed directory service systems. The analysis results reveal that the composite model is a viable option to overcome the performance trade-off between the data distribution and the data replication model. In this paper, we present the performance model developed for the composite model by appling queuing modelling. Using the performance model, performance values for a variety of system execution environments are suggested which enable us to bring an efficient design for high performance distributed directories.

In this paper, we present a new echo kernel, which is a modification of polar echo kernel. to improve the detection performance and robustness against attacks. Polar echo kernel may take advantage of large detection margin from the polarity of inserted echo signal, but its poor frequency response in low frequency band degrades sound quality. To solve this problem, we applied bipolar echo pulses to the polar echo kernel. Using the proposed echo kernel the distributions of autocepstrum peaks fur data ‘0’ and ‘1’ are located more distant and improvement of detection performance is achieved. It also makes the low frequency band flat so that the timbre difference in the polar echo kernel can be removed to reproduce the imperceptible sound qualify. Informal listening tests as well as robustness test against attacks were performed to evaluate the proposed echo kernel. Experimental results demonstrated the superiority of the proposed echo kernel to both conventional unipolar and polar echo kernels

In interconnection network for parallel processing, the cycle partitioning problem for parallel transmission with faulty vertieces or edges is very important. In this paper, we assume that k($\leq$m-1) edges do not share any vertices of m dimension hypercube Q$_{m}$ and show that it is possible to construct a cycle set which consists of k cycles covering all the vertices of the hypercube and one cycle including one of the given edges. This cycle set can be used to parallel transmission between two vertices joined by faulty edges.s.

Flash memory becomes more important for its fast access speed, low-power, shock resistance and nonvolatile storage. But its native restrictions that have limited 1ifetime, inability of update in place, different size unit of read/write and erase operations need to managed by FTL(Flash Translation Layer). FTL has to control the wear-leveling, address mapping, bad block management of flash memory. In this paper, we focuses on the fast access to address mapping table and proposed the way of faster valid page search in the flash memory using the VPLT(Valid Page Lookup Table). This method is expected to decrease the frequency of access of flash memory that have an significant effect on performance of read and block-transfer operations. For the validations, we implemented the FTL based on Windows CE platform and obtained an improved result.

Class area is a portion of memory where the constants, fields, and codes of the classes loaded into the Java virtual machine are kept. Knowing the site of the class area is very important especially for embedded Java system with limited memory resources. This paper induces a formula which makes it possible estimate the size of the area. The formula needs some constant values specific to target JVM implementation. We also show that these values can be found using some simple probe classes. An experimental result is included in this paper to confirm the correctness of our approach.

Westfeld[1] analyzed a sequential LSB embedding steganography effectively through the $\chi$$^2$-statistical test which measures the frequencies of PoVs(pairs of values). Fridrich also proposed another statistical analysis, so-called RS steganalysis by which the embedding message rate can be estimated. In this paper, we propose a new steganographic scheme which preserves the above two statistics. The proposed scheme embeds the secret message in the innocent image by randomly adding one to real pixel value or subtracting one from it, then adjusts the statistical measures to equal those of the original image.

The recent technology developments introduce new difficulties into the test process by the increased complexity of the chip. Most widely used method for testing high complexity and embedded systems is built-in self-test(BIST). In this paper, we describe 5-stage pipeline system as circuit under testing(CUT) and proposed a BIST scheme for the hazard detection unit of the pipeline system. The proposed BIST scheme can generate sequential instruction sets by pseudo-random pattern generator that can detect all hazard issues and compare the expected hazard signals with those of the pipelined system. Although BIST schemes require additional area in the system, it proves to provide a low-cost test solution and significantly reduce the test time.

In this paper, we propose an application of data hiding, especially for content adaptation, where one can reduce computational time and get better transcoding results or qualify. Hiding some useful information for content adaptation can help resource tailor to do effective transcoding so that one can achieve lower complexity as well as better quality in content adaptation. Experimental results show that the proposed method based on data hiding gives effectiveness to content adaptation with reasonable subjective quality.

지난 수십년간 많은 SRGM이 제안되었다. 이러한 모델들 중 많은 부분에서 암암리에 소프트웨어 테스트 전 단계를 거쳐서 테스트노력이 상수인 것으로 가정하거나 또는 아예 고려하지도 않았다. 그 후 몇몇 논문을 통하여 테스트노력을 고려한 소프트웨어의 신뢰도 평가가 중요한 인자인 것으로 발표되었다. 이들에 의해 지금까지 제안된 형태를 보면 지수함수형, 레일레이형, 웨이블형, 로지스틱형, 테스트노력함수로서 경우에 따라 이 중 하나의 적합한 형태를 사용해왔다. 본 논문에서는 이 네 가지 형태에 대해서 최소자승평가자(LSE)와 최대가능성평가자(MLE)를 써서 신뢰도 성장 파라미터를 구하는 방법에 대해서 고찰하고, 실제의 데이터를 적용하여 각각의 경우에 대한 파라미터를 구하고 이를 이용하여 목표신뢰도에 맞는 발행시기를 결정하는 문제를 연구하였다.

In this paper, we propose design of PCI Express Physical Layer for IP. The proposed design is compatible with PCI Express Base specification Revision 1.0a. and supports only single Lane. The best feature of this design is that Physical Layer includes Power Management block. Therefor, the entire design of PCI Express component is simplified. In the near future, as optimizing this design and extending Lane, we will redesign Physical Layer.

We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

The requirements for the high quality service is increased according to the changing of the internal environment. But, the computer system can not satisfy the requirement because of the limitation of the computer's own problem. This paper describes the network storage accelerator which can perform the high quality streaming service. We also show the implementation result of the streaming accelerator.

Ethernet is one of the most successful LAN technologies. Now gigabit ethernet is available in real network and some network interface cards(NIC) supports TCP segment offloading (TSO), IP checksum offloading(ICO), Jumbo frame and interrupt moderation. If we use this features appropriately, we obtain high throughput with low CPU utilization. This paper represents the network performance by varying above features.

In order to overcome the limitation based on different avatar models, in this paper, we propose gesture communications between different avatar models using FBML (Facial Body Markup Language). The experimental results demonstrate a possibility that the proposed method could be used as an efficient means to overcome the problem.

Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. These sensors can be deeply embedded in the physical world and spread throughout sensor network environment like smart dust. So ubiquitous computing will be come true. SmartDust project is the one of ubiquitous computing approach. It produces TinyOS, mote(mica, mica2, rene2, mica2dot, etc.), NesC, TinyDB, etc. We constructs sensor network test bed and tests to approach sensor network and ubiquitous computing.

In this paper, we consider issues related to the autonomous management of a server cluster Server clustering technique is widely used for high available Internet servers such as a web server, because it provides very scalable and reliable service. However, it is very burden-some to manage the cluster system. For instance, installation or configuration of a new node requires skilled administrators. Also, when a node is failed, it should be recognized and recovered by a human. The management complexity gets higher while increasing the number of machines for higher throughput. Here, we are going to alleviate the management complexity by building an autonomous cluster server with Jini $_{TM}$ technology from Sun Microsystems.

The PCI Express spec introduces retry buffer in Data Link Layer For data integrity. But this buffer have some restrictions as buffer's usage. So we proposed effective management for retry buffer on PCI-Express interface. Proposed buffer management give increase performance and data integrity simultaneously.

Current web-server deals a multimedia data as well as text data. But dealing a multimedia data is high burden to web-server. So it can degrade web-server response. We introduce H/W feature CDA (Contents Delivery Accelerator). Main function of this H/W is transferring data between SCSI disk and NIC by direct path, and TCP offloading. These 2 functions can accelerate web-server performance. In this paper we will explain problem of current web-server and suggest our new architecture and say various implementation issues.

Complying with highly demand of information through internet. the utility of computer and network is rapidly provided with to schools. This situation brings about many problems. For example, the stolen information through false identification(Hacking) is the most greatest concern. In this paper it tells that the efficient way of preservating computer use is by using operating system of Open Source, which is Linux system. Further more, it shows the system which was organized by IP-Tabling (offered service-Packet Filtering method from the Linux system) functions well as a security system.

This paper suggests user's interface with computer by means of detecting gaze under HMD, head mounted display, environment. System is derived as follows; firstly, calibrate a camera in HMD, which determines geometrical relationship between monitor and captured image. Second, detect the center of pupil using algorithm of the center of mass and represent a gazing position on the computer screen. If user blinks or stares at a certain position for a while, message is sent to computer. Experimental results show the center of mass is robust against glint effects, and detecting error was 7.1%. and 4.85% in vertical and horizontal direction, respectively. To adjust detailed movement of a mouse takes 0.8 sec more. The 98% of blinking is detected successfully and 94% of clicking detection is resulted.

본 논문에서는 정현파를 이용한 spread-spectrum watermarking 에서 비가청성을 높이기 위한 방법과 효율적인 threshold 설정 방법을 제안한다. 제안하는 방법에서는 spread-spectrum 기법을 사용할 때 계산량이 많이 요구되는 심리음향모델 계산을 피하면서도 가청잡음을 줄이기 위한 방법을 제시한다. 또한 outlier 를 이용하여 워터마크 검출에서 적절한 threshold 설정방법을 제안한다.

In this paper, we present a simple framework to measure BRDF(Bidirectional Reflectance Distribution Function) values of objects and to render them using the values more realistically. There are lots of BRDF measurement methods, but the methods have been separated from the effective rendering of the values. Therefore, we suggest the framework which includes the BRDF measurement methods of objects and the effective rendering methods of the measured BRDF data. Before measuring the BRDFs, we do light sources analysis, camera calibration and display device characterization. After measuring them, we apply them to the characterized display device for rendering effectively and realistically.

DCT or Wavelet based on Image compression technique occurred to compression artifact. In order to remove this problem, we can apply many improvement algorithms. But in these cases, these algolithms resulted in bad results against the good quality image. Therefore this paper proposes an automatic image interpretation technique not to apply to the good quality images. In this paper, we exploit the basic nature of DCT.

In this paper we propose an adaptive learning method for HMM classifiers by using splitting and merging techniques to overcome the problem of the conventional teaming, where one HMM classifier per class has been trained, individually. The experimental results demonstrate a possibility that the proposed mechanism could be applied for applications of having multiple clusters in a class.

A Mobile Fingerprint Identification System is implemented in this paper. The proposed system contains a server system to register fingerprints and ID data, PDA with WLAN or CDMA module and fingerprint identification module.

In this paper, we propose sharing 3D media between multisite using enhanced Access Grid (e-AG) which is a composition of 3D display and Access Grld (AG) Conventional AG and other collaborative systems have a limitation to share immersive 3D media Thus, proposed system supports sharing 3D media contents in a AG meeting section. Real object can be shared by acquiring stereo image with pre-calibrated stereo camera and by delivering, and virtual object can be shared by transmitting state information after downloading 3D model. And also, real video scene acquired by stereo camera and virtual object from 3D model can be displayed on the 3D display system of each node adaptively. The characteristics of proposed sharing method are sharing 3D media, displaying 3D media on a system adaptively, supporting real-time interaction. The proposed sharing method will be used remote lecture, remote collaboration with 3D media.

In this paper, we propose a depth-based mesh modeling method to generate virtual environment. The proposed algorithm constructs mesh model from unorganized point cloud obtained from a multi-view camera. We separate the point cloud consisting objects from the background. Then, we apply triangulation to each object and background. Since the objects and the background are modeled independently, it is possible to construct effective virtual environment. The application of proposed modeling method is applicable to entertainment, such as movie and video game and effective virtual environment generation.

This paper describes a system of detecting multi-views faces and estimating their face poses in an omni-directional camera environment for non-intrusive iris recognition. The paper is divided into two parts; First, moving region is identified by using difference-image information. Then this region is analyzed with face-color information to find the face candidate region. Second part is applying PCA (Principal Component Analysis) to detect multi-view faces, to estimate face pose.

멀티미디어의 시대가 도래함에 따라 셀 수도 없이 많은 영상매체들이 범람하고 있다. 과거에는 영상 매체들의 수는 셀 수 있는 대상으로 분류되는 소수의 보조 매체이었던 것에 반해 지금의 영상매체 특히 동영상을 이용한 전달방식은 과거의 인간 인지의 보조수단이 아닌 인지의 주류로 떠오르고 있는 실정이다. 이에 이 수많은 영상매체를 얼마나 빠르게 인지한 수 있는 가가 중요한 관점으로 떠오르고 있다.

This paper proposes efficient cloth animation and collision handling methods. There have been various techniques for the generation of cloth behavior. However, the cloth animation is still a challenging subject in real-time environments. This paper presents an efficient animation method based on implicit integration. The proposed method can efficiently animate virtual cloth object with complex geometry. In addition, this paper also introduces an efficient collision handling method. The collision resolution is another important issue in cloth animation since deformable objects has special collision problem called self-collision. In this paper, the self-collision was successfully avoided in real - time environments.

The metathesaurus(UMLS, 2003AA edition) supports multi language and includes 875, 233 concepts, 2, 146, 897 concept names. It is impossible for PubMed or NLM serve searching of the metatheaurus to retrieval using a query that is not to be text, a fault sentence structure or a part of concept name. That means the user notice correctly suitable medical words in order to get correct answer, otherwise she or he can't find information that they want to find I propose that the method of searching unified medical language system using automatic modified a query for problem that I mentioned. This method use dictionary that is standard for automation of modified query gauge similarity between query and dictionary using string comparison algorithm. And then, the tested term converse the form of metathesaurus for optimized result. For the evaluation of method, I select some query and I contrast NLM method that renewed Aug. 2003.

Due to recent explosion of information available online, question- answering (Q&A) systems are becoming a compelling framework for finding relevant information in a variety of domains. Question-answering system is one of the best ways to introduce a novice customer to a new domain without making him/her to obtain prior knowledge of its overall structure improving search request with specific answer. However, the current web poses serious problem for finding specific answer for many overlapped meanings for the same questions or duplicate questions also retrieved answer for many overlapped meanings fer the same questions or duplicate questions also retrieved answer is slow due to enhanced network traffic, which leads to wastage of resource. In order to avoid wrong answer which occur due to above-mentioned problem we propose the system using ontology by RDF, RDFS and mobile agent based on JAVA. We also choose wireless internet based embedded device as our test bed for the system and apply the system in E-commerce information domain. The mobile agent provides agent routing with reduced network traffic, consequently helps us to minimize the elapsed time for answers and structured ontology based on our proposed algorithms sorts out the similarity between current and past question by comparing properties of classes.

This paper proposes a pursuing system utilizing the learning method where multiple cooperating agents emulate social behaviors of animals and insects and realize their group behaviors. Each agent contains sensors to perceive other agents in several directions and decides its behavior based on the information obtained by the sensors. In this paper, a neural network is used fir behavior decision controller. The input of the neural network is decided by the existence of other agents and the distance to the other agents. The output determines the directions in which the agent moves. The connection weight values of this neural network are encoded as genes, and the fitness individuals are determined using a genetic algorithm. Here, the fitness values imply how much group behaviors fit adequately to the goal and can express group behaviors. The validity of the system is verified through simulation.

This paper proposes the distributed virtual environment framework for collaboration between heterogeneous platforms. The proposed system consists of Client, Content Server(CS), and Reflector Server(RS). The Client is composed of VR library(VRL), Interaction Manager(IM), Distributed Interaction Manager(DIM), and Network Interface(NI). The proposed Client structure can support various display environments. The XML-based IM and DIM lets the users define and add the interactions. The proposed Server structure synchronizes the distributed interaction between heterogeneous platforms and provides transparency to the users. Therefore, the proposed framework enables the users to implement virtual collaboration environment for their tasks. Moreover, it can also be used for research and development activities between a large number of the remote users. The usefulness of the framework was verified by applying it to the virtual heritage tour system.

The agglutinative nature of Korean language makes the problem of automatic indexing of Korean much different from that of Indo-Eroupean languages. Especially, indexing with compound nouns in Korean is very problematic because of the exponential number of possible analysis and the existence of unknown words. To deal with this compound noun indexing problem, we propose a new indexing methods which combines the merits of the morpheme-based indexing methods and the n-gram based indexing methods. Through the experiments, we also find that the best performance of n-gram indexing methods can be achieved with 1.75-gram which is never considered in the previous researches.

In this paper, we describe an implementation of indexing and presentation system conforming to TV-Anytime standards. This system has a metadata indexing scheme for multimedia contents, a video indexing algorithm for news and soccer videos, and an MPEG-2 TS player for nonlinear browsing. We also implement an authoring tool for the algorithms mentioned above.

In this paper, we propose a new scheme for automatic segmentation of the liver in CT images. The proposed scheme is carried out on region of interest(ROI) blocks that include regions of the liver with high probabilities. The ROI approach saves unnecessary computational loss in finding the accurate boundary of the liver. The proposed method utilizes the composition of multi-size morphological filters with a prior knowledge, such as the general location or the approximate intensity of the liver to detect the initial boundary of the liver. Then, we make the gradient image with the weight of the initial liver boundary and segment the liver legion by using an immersion-based waters hed algorithm in the gradient image. finally, the refining process is carried out to acquire a more accurate liver region.

Recently, several steganographic algorithms for two-color binary images have been proposed. In this paper, we propose a steganographic algorithm which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m$\times$n blocks. and embeds a r-bit(r=[log$_2$(mn+1]-1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the substantial substitution schemes.

In conventional patchwork, the difference of the mean values of two groups is compared for watermark detection. We propose two modified patchwork schemes based on order statistics, which achieves significant improvements over conventional patchwork. First, we propose that the mean comparison is replaced by the median comparison, to get PSNR improvement due to informed watermarking. Second, we propose a majority voting scheme of a sequential comparison of pixel pairs in a sorted order, which produces significantly lower BER. The performance improvements are mathematically analyzed and tested. In experimental results, PSNR is about 5㏈～10㏈ higher in the first method and BER is about 1/5～l/2 times lower in the second method than conventional patchwork.

In this paper, a design and experiment of PCI Express Core verification Model is described. The model targeting Endpoint core verification is designed by using newly-emerging SystemC which is a system design language based on a new C++ class library and simulation engine. In the verification model, we developed a SystemC Host System model which act as a Root Complex and Device Driver dedicated to the PCI Express Endpoint RTL Core. The test of Host System Model is guided by scenarios which implements and acts point of Device Driver and Root Complex and shows the result of simulation. Also, We present the full structure of verification model and Host model.

Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

Two defects have been pointed out in existing user-based collaborative filtering such as sparsity and scalability, and the research has been also made progress, which tries to improve these defects using item-based collaborative filtering. Actually there were many results, but the problem of sparsity still remains because of being based on an explicit data. In addition, the issue has been pointed out. which attributes of item arenot reflected in the recommendation. This paper suggests a recommendation method using nave Bayesian algorithm in hybrid user and item-based collaborative filtering to improve above-mentioned defects of existing item-based collaborative filtering. This method generates a similarity table for each user and item, then it improves the accuracy of prediction and recommendation item using naive Bayesianalgorithm. It was compared and evaluated with existing item-based collaborative filtering technique to estimate the accuracy.

In this paper, we developed those OpenLS(Open Location Service) Core Services based on the Web-Service, because Web-Service environments provide a suitable method to gather requested information in an appropriate way. The proposed architecture cooperate with OpenLS Core Services( Directory Service, Location Utility Service and Router Determination service) and is an interoperability one - it identifies those global elements of the global Web-Services network that are required in order to ensure interoperability between Web-services. In this paper, a new architecture of OpenLS Core Services is proposed and tested in OpenLS Core Services environments.

In this paper, we propose a DRM(Digital Rights Management) system for streaming media which can not only protect streamed MPEG-4 content but be easily integrated with existing MPEG-4 streaming system. To protect MPEG-4 media more effectively and more securely, encryption should be considered on encoding phase and also streaming server should be designed to support DRM. However that means it cannot support existing streaming system. Our approach is to design a DRM system independent to the streaming server. So, we used an encryption method which can be applied to compressed MPEG-4. The processing time of decryption in client system must be minimized to guarantee the QoS of streaming service. To satisfy this requirement, it is essential to analyze the effect of DRM on performance. We made some performance test and present the result. Also, we apply proposed system to ISMA(The Inter net Streaming Media Alliance) streaming system which is open standard for MPEG-4 media streaming.

본 논문에서는 클라이언트/서버 형태로 신발 공정에 관한 컨베이어 원격 감시 제어 시스템을 웹 기반으로 설계하고 구성하였다. 클라이언트가 원격으로 영상을 감시하고 제어하기 위한 모듈들은 JAVA를 기반으로 제작하였으며, 실시간 제어를 위한 컨베이어 서버는 RTLinux를 기반으로 구성되며, 그 위에서 디바이스 드라이버와 API를 개발하였다. 이러한 소프트웨어 제작과 Lego 기반의 프로토타입핑을 통해 산업 현장에서 웹을 통해 실시간으로 컨베이어를 제어하는 방법을 제시하고자 한다.

In this paper, we describe the effective way of keyboard-hacking prevention and authentication system using a Smart Card. These days the securing information matters for pc-users are becoming more important as the internet business grows rapidly, and the ubiquitous computing environment is open tot everyone. Therefore, PC authentication is necessary to handle the access control to the target PC. Also, the keyboard-inputting information is necessary to be protected properly against the malicious attack. In this paper, we propose the keyboard-hacking protect systems and authentication system using a Smart Card, and show the conveniency and efficiency in the results.

The accuracy of automatic speech recognition system depends on the presence of background noise and speaker variability such as sex, intonation of speech, and speaking rate. Specially, the speaking rate of both inter-speaker and intra-speaker is a serious cause of mis-recognition. In this paper, we propose the compensation method of the speaking rate by the ratio of each vowel's length in a phrase. First the number of feature vectors in a phrase is estimated by the information of speaking rate. Second, the estimated number of feature vectors is assigned to each syllable of the phrase according to the ratio of its vowel length. Finally, the process of feature vector extraction is operated by the number that assigned to each syllable in the phrase. As a result the accuracy of automatic speech recognition was improved using the proposed compensation method of the speaking rate.

In the research for Unmaned Air Vehicles(UAVs), the use of Vision-sensor has been increased. It is possible to calculate the position information of air vehicle by finding a horizontal line. In this paper, we proposed a vision-based algorithm for finding the horizontal line. Experimental results show that the proposed algorithm is faster than an existing algorithm.

JCA(Java Connector Architecture)는 다양한 형태의 데이터 리소스들을 하나의 J2EE 서버에서 사용하기 위해 SUN 에서 제안한 리소스 연동 방안이다. JCA 는 J2EE 서버와 데이터베이스, ERP 등의 레거시 시스템을 연동하기 위해 필요한 다양한 인터페이스들을 제공한다. 이러한 인터페이스들은 데이터 소스로부터 커넥션을 얻기 위한 규약, 이때 필요한 접근 제어 및 인증 관련 규약, 그리고 커넥션과 연관된 트랜잭션에 대한 처리 방안을 제시하는 규약들로 구분된다. 본 논문에서는 JCA의 아키텍처에 대한 설명과 함께 데이터베이스 커넥션에 초점을 맞추어, 트랜잭션의 유무와 상이한 데이터베이스 접근에 따른 3가지 모델에 대해 논의한다.

In this paper, we explore a new data mining capability that is based on Quantitative Attribute and Time Series. Our solution procedure consists of two steps. First, We derive an algorithm to contain the Quantitative Attribute into a set of candidate item. Second, We redefine the concepts of confidence and support for composite association rules. It is shown that proposed methode is very advantageous and can lead to prominent performance improvement.

In this paper, we intend to find user's TV program choosing pattern and, recommend programs that he/she wants. So we suggest item dependency map which express relation between chosen program. Using an algorithm that we suggest, we can recommend an program, which a user has not saw yet but maybe is likely to interested in. Item dependency map is used as patterns for association in hopfield network so we can extract users global program choosing pattern only using users partial information. Hopfield network can extract global information from sub-information. Our algorithm can predict user's inclination and recommend an user necessary information.

본 논문에서는 한국우주전파관측망(Korean VLBI Network; KVN)을 위해 현재 미국 MIT Haystack 천문대에서 개발되고 있는 천문관측 데이터를 위한 고속 대용량 저장장치에 대해 간략히 기술한다. 현재 개발중인 Mark 5 시스템은 하드디스크 기반의 Gbps VLBI 데이터 시스템이다. 주요 시스템은 낮은 가격의 PC 기반으로 8개의 탈부착이 가능한 ATA/IDE 형태의 하드디스크 뱅크를 두 개 가지며 1024Mbps 이상으로 고속기록 및 재생이 가능하다. 뿐만 아니라, Mark 5 시스템은 표준 기가비트 이더넷 연결을 통해 e-VLBI를 지원한다.

Increasingly, Grid technics are developed and demonstrated widely. These days, a point to be considered is that clients use Grid resources more easily. Grid Portals, based on standard Web technologies, are increasingly used to provide user interfaces for using Grid resources. But, due to lack of delegation capabilities in using Grid resources through Grid Portals, it is requested of the security mechanisms. That solution is to using Myproxy Server. Myproxy Server allows Grid user to use Grid resources being interact with Grid Portals. But, while users log in Grid Portals, we are faced with over the overlap of users credentials. This paper describes relationship between Portals and Myproxy, and proposes the way to solve the problem of the overlap of users credentials.

Because UMLS semantic network is bulky and complex, user hard to understand and has shortcoming that can not express all semantic network on screen. To solve this problem, rules to dismember semantic network efficiently are introduction. but there is shortcoming that this should classifies manually applying rule whenever UMLS semantic network is modified. Suggest automatic clustering method of UMLS semantic network that use genetic algorithm to solve this problem. Proposed method uses Linked semantic relationship between each semantic type and semantic network does clustering by structurally similar semantic type linkages. To estimate the performance of suggested method, we compared it with result of clustering method by rule.

We can not distinguish semantism of the feature of the current language “big”, “small”, “beautiful”. But we study artificial linguistic interface work and convert natural language to digital binary linguistic theory, we should define the basical conversion process. When we utilize the sum of product fuzzy theory and the visible numerical value, we can establish reasoning rule of input language. Fuzzy theory should be converted to general resulting rule.

This paper designs and implements fault-tolerant server of meta server for shared filesystem (SANfs) in SAN environment. SANfs is the filesystem that many clients can share data in Network-attached storage in SAN environment and meta server is the server that processes file operation in SANfs. The focus of this paper is the implementation of fault-tolerant server of meta server in SANfs. In the event of a meta server, meta server failovers to a fault-tolerant server where its processing continues seamlessly. If meta server doesn't restore, fault-tolerant server searches reliable client and makes another fault-tolerant server and work as meta server. Heartbeat monitors meta server and shadow server and controls them.

Conventional stride predictor is useful for predicting data values which vary by a constant value. However, when the data values of shift, multiplication, and division instructions are predicted, the stride predictor can't show the best performance. Thus, we propose predictor using stride and shift to improve predictability. The predictor using stride and shift takes advantage of shift values as well as stride values, so that the overall coverage of prediction increases.

모든 생명체는 유전자의 최종 산물인 다양한 단백질들이 각각의 복잡한 기능을 수행함과 동시에 그들 사이의 긴밀한 상호작용에 의해 생명을 유지한다. 도메인 (Domain)은 단백질의 기능적 단위로서 한 개 단백질은 최대 수십 개의 도메인을 가지는데 이들 도메인에 대한 정보는 단백질의 기능을 예측하는데 도움이 될 수 있다. 본 논문에서는 종양을 억제하는 기능을 가지는 단백질과 그러한 기능을 가질 것으로 추정되어지는 단백질의 아미노산 서열, 또 기능이 밝혀지지 않은 미지의 아미노산 서열을 가지고 이미 밝혀져 있는 도메인 서열과 비교 검색하여 이들 사이에 일치하는 도메인을 통하여 표적 단백질의 기능 동정에 관한 연구에 도움이 되며, 또한 기능이 밝혀지지 않은 아미노산 서열의 도메인을 검색하여 새로운 기능을 예측함으로써 다른 실험적 방법과 비교하여 시간과 비용을 절약할 수 있는 효과적인 방법을 얻었기에 제안하고자 한다.

In this paper, we propose a new digital audio watermarking technique with the wavelet transform. The watermark is embedded by eliminating unnecessary information of audio signal based on human auditory system (HAS). This algorithm is an audio watermarking method, which does not require any original audio information in watermark extraction process. In this paper, the masking effect is used for audio watermarking, that is, post-tempera] masking effect. We construct the window with the synchronization signal and we extract the best frame in the window by using the zero-crossing rate (ZCR) and the energy of the audio signal. The watermark may be extracted by using the correlation of the watermark signal and the portion of the frame. Experimental results show good robustness against MPEG1-layer3 compression and other common signal processing manipulations. All the attacks are made after the D/A/D conversion.

This paper proposed to digital watermarking technique for architectural drawing using LINES and ARCs based on vertex in CAD system to prevent infringement of copyright from unlawfulness reproductions and distribution. After extract LINES and ARCs from designed drawing, we embed watermarks using adaptive algorithm in each characteristics. Watermarks robust to various attacks like as geometrical transformation as being embedded in LINE's length and ARC's angle information. Also, the proposed method satisfies enough transparency about watermarked drawing because have suitable embedding strength to each component. By experimental result, we confirmed robustness and invisibility of embedded watermarks in several conversions of architectural design drawing.

DMB is a next-generation multimedia broadcasting system that not only enables digital broadcasting services such as transmission of CD-duality audio, traffic information, and real-time stock information, but also allows reception of high-quality digital TV in high-speed driving conditions. In the DMB system, MPEG-2 TS(Transport Stream) multiplex method and MPEG-4 System SL(Sync Layer) have been selected as the delivery layer. In this paper, an efficient interface scheme between an MPEG-2 TS processing hardware and software-implemented MPEG-4 system within a DMB terminal device is proposed.

This paper defines Normalized Term Frequency Weighting method for automatic text categorization by using Box-Cox, and then it applies automatic text categorization. Box-Cox transformation is statistical transformation method which makes normalized data. This paper applies that and suggests new term frequency weighting method. Because Normalized Term Frequency is different from every term compared by existing term frequency weighting method, it is general method more than fixed weighting method such as log or root. Normalized term frequency weighting method's reasonability has been proved though experiments, used 8000 newspapers divided in 4 groups, which resulted high categorization correctness in all cases.