• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.37-44
• /
• 2009

This paper describes a new tiled display framework called, iTDF (Interactive Tiled Display Framework), that is designed to support rapid construction of the interactive digital 3D contents running on top of the cluster-based tiled display. This framework allows synchronizing the rendering slaves, sharing software's state over the network, the features, such as, launching multiple applications on a cluster-based computers, moving and resizing windows, synchronization of rendering slaves, distributed shared memory, and unified input interface. This paper analyzes the requirements of the framework and describes the design and implementation of the framework. A couple desktop-based applications are ported with the new iTDF and to find out the usefulness and usability of the framework.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.11
• /
• pp.795-800
• /
• 2013

Early detection of oestrus in Korean cows is one of the important issues in maximizing the economic benefit. Although various methods have been proposed, we still need to improve the performance of the oestrus detection system. In this paper, we propose a video surveillance system which can detect unusual behavior of multiple cows including the mounting activity. The unusual behavior detection is to detect the dangerous or abnormal situations of cows in video coming in real time from a surveillance camera promptly and correctly. The prototype system for unusual behavior detection gets an input video from a fixed location camera, and uses the motion vector to represent the motion information of cows in video, and finally selects a SVDD (one of the most well-known types of one-class SVM) as a detector by reinterpreting the unusual behavior into an one class decision problem from the practical points of view. The experimental results with the videos obtained from a farm located in Jinju illustrate the efficiency of the proposed method.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.11 s.158
• /
• pp.1589-1597
• /
• 2006

Nowadays, Korean consumers prefer drum-type washing machines to pulsator-type washers. Washing is a complex process involving the interaction of numerous physical and chemical influences. The main factors in the washing operations are the washing chemistry of the detergent along with the mechanical input, the wash temperature, and the time provided by the washing machine. Heavy-duty detergents that are used in drum-type washing machines contain different components from those used in vertical-axis washing machines. The bath ratio and the mechanical actions to which laundry is subjected are different between the drum-type and the vertical-axis washing machines. In this study we examined the effects of wash temperature, wash time, detergent concentration, and revolution speed on the removal of soils from artificially soiled cloths in a drum-type washing machine with heavy-duty commercial detergent. We used multiple regression analyses to find the relative importance of the factors and the optimum washing conditions. The results of these experiments showed that the washing temperature was the most important factor in the effective removal of most soils. This was followed by the washing time, the detergent concentration, and finally the revolution speed. In this study it was found that superfluous amounts of detergent did not sufficiently increase the soil removal rate. Koreans who are used to washing with cold water should increase the wash time to launder more efficiently.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.32 no.4
• /
• pp.27-43
• /
• 1990

This study aimed at developing a generalized model on the estimation of the long - term run - off volume for practical purpose. During the research period of last 3 years( 1986-1988), 3 types of estimation model on the long - term run - off volume(Effective rainfall model, unit hydrograph model and barne's model for dry season) had been developed by the author. In this study, through regressional analysis between determinant factors (bi of effective rainfall model, ai of unit hydrograph model and Wi of barne's model) and catchment characteris- tics(catchment area, distance round the catchment area, massing degree coefficient, river - exte- nsion, river - slope, river - density, infiltration of Watershed) of 11 test case areas by multiple regressional method, a new methodology on the derivation of determinant factors from catchment characteristics in the watershed areas having no hydrological station was developed. Therefore, in the resulting step, estimation equations on run - off volume for practical purpose of which input facor is only rainfall were developed. In the next stage, the derived equations were applied on the Kang - and Namgye - river catchment areas for checking of their goodness. The test results were as follows ; 1. In Kang - river area, average relative estimation errors of 72 hydrographs and of continuous daily run - off volume for 245 days( 1/5/1982 - 31/12) were calculated as 6.09%, 9.58% respectively. 2. In Namgye - river area, average relative estimation errors of 65 hydrographs and of conti- nuous daily run - off volume for 2fl days(5/4/1980-31/12) were 5.68%, 10.5% respectively. In both cases, relative estimation error was averaged as 7.96%, and so, the methodology in this study might be hetter organized than Kaziyama's formula when comparing with the relative error of the latter, 24~54%. However, two case studies cannot be the base materials enough for the full generalization of the model. So, in the future studies, many test case studies of this model should he carries out in the various catchment areas for making its generalization.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.155-166
• /
• 2005

Currently, almost of all the Internet users have as many IDs as the number of sites they have subscribed for, The users should memorize and input every independent ID and password whenever they want to login to the system. Although ID management system is used to solve this problem, 10 and password management will become more complicated in the forthcoming ubiquitous computing environments because so many computers will be interconnected on various kinds of wired and wireless networks, Furthermore, it is not enough to use the existing single Circle of Trust (COT) ID management system for the forthcoming computing environments. To solve this problem, the paper proposes ID federation models in multiple COT domain and implements an ID federation system that can be scaled to mobile computing environment as well as wired computing environment. The proposed ID federation models has been verified to operate with no problem between the systems in different trust domains by doing the ID scaability test.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.147-154
• /
• 2007

In this paper, we propose a new parallel search algorithm to acquire synchronization for UWB(Ultra Wideband) systems that reduces computation of the correlation. The conventional synchronization acquisition algorithms check all the possible signal phases simultaneously using multiple correlators. However it reduces the acquisition time, it makes high power consumption owing to increasing of correlation. The proposed algorithm divides the preamble signal to input the correlator into an m-bit bunch. We check the result of the correlation at first stage of an m-bit bunch data and predict whether it has some synchronization acquisition information or not. Thus, it eliminates the unnecessary operation and save the number of correlation. We evaluate the proposed algorithm under the AWGN and the multi-Path channel model with MATLAB. The proposed parallel search scheme reduces number of the correlation 65% on the AWGN and 20% on the multi-path fading channel.

• Journal of Korean Library and Information Science Society
• /
• v.40 no.1
• /
• pp.253-274
• /
• 2009

Data Envelopment Analysis(DEA) model is a linear programing based technique for measuring the relative performance of organizational units where the presence of multiple inputs and outputs makes comparison difficult. DEA model allows each unit to adopt a set of weight that shows it in the most favorable light in comparison to the other units. The purpose of this study was to evaluate the performance of the libraries of national university in terms of relative efficiency, measured by the method of DEA. Twenty six libraries of national universities in Korea were used to analyze. The number of employees, size of library, budget, and number of books were used for input data, and the number of visitors, number of loan books, and number of books for lending and borrowing were used for output data. We found out that number of libraries with 100% relative efficiency among 26 libraries from 2005 to 2007 were only 9, 9 and 10, respectively. Moreover most of the libraries need to increase outputs and decrease inputs in order to improve efficiency.

• Journal of Advanced Navigation Technology
• /
• v.13 no.4
• /
• pp.509-514
• /
• 2009

In this paper, we designed and analyzed 256GB DRAM-based SSD storage using DDR1 memory and PCI-e interface. SSD is a storage system that uses DRAM or NAND Flash as primary storage media. Since the SSD read and write data directly to memory chips, which results in storage speeds far greater than conventional magnetic storage devices, HDD. Architecture of the proposed SSD system has performance of high speed data processing duo to use multiple RAM disks as primary storage and PCI-e interface bus as communication path of RAM disks. We constructed experimental system with UNIX, Windows/Linux server, SAN Switch, and Ethernet Switch and measured IOPS and bandwidth of proposed SSD using IOmeter. In experimental results, it has been shown that IOPS, 470,000 and bandwidth,800MB/sec of the DDR-1 SSD is better than those of the HDD and Flash-based SSD.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1132-1137
• /
• 2011

In this paper, we propose Modified Multi CAMShift Algorithm(Modified Multi Continuously Adaptive Mean Shift Algorithm) that extracts skin color area and tracks several human body parts for real-time human tracking system. Skin color area is extracted by filtering input image in predefined RGB value range. These areas are initial search windows of hands and face for tracking. Gaussian background model prevents search window expending because it restricts skin color area. Also when occluding between these areas, we give more weights in occlusion area and move mass center of target area in color probability distribution image. As result, the proposed algorithm performs better than the original CAMShift approach in multiple object tracking and even when occluding of objects with similar colors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.255-263
• /
• 2000

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).