• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.455-462
• /
• 2001

The World Wide Web has become one of the major services provided through Internet. When searching the vast web space, users use bookmarking facilities to record the sites of interests encountered during the course of navigation. One of the typical problems arising from bookmarking is that the list of bookmarks lose coherent organization when the the becomes too lengthy, thus ceasing to function as a practical finding aid. In order to maintain the bookmark file in an efficient, organized manner, the user has to classify all the bookmarks newly added to the file, and update the folders. This paper introduces our learning agent called BClassifier that automatically classifies bookmarks by analyzing the contents of the corresponding web documents. The chief source for the training examples are the bookmarks already classified into several bookmark folders according to their subject by the user. Additionally, the web pages found under top categories of Yahoo site are collected and included in the training examples for diversifying the subject categories to be represented, and the training examples for these categories as well. Our agent employs naive Bayesian learning method that is a well-tested, probability-based categorizing technique. In this paper, the outcome of some experimentation is also outlined and evaluated. A comparison of naive Bayesian learning method alongside other learning methods such as k-Nearest Neighbor and TFIDF is also presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.706-715
• /
• 2004

In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4${\times}$4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4${\times}$4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2％ to 8％ in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.11 s.353
• /
• pp.26-36
• /
• 2006

In this paper, we propose a cost-effective color filter may (CFA) demosaicing method for digital still cameras in which a single CCD or CMOS image sensor is used. Since a CFA is adopted, we must interpolate missing color values in the red, green and blue channels at each pixel location. While most state-of-the-art algorithms invest a great deal of computational effort in the enhancement of the reconstructed image to overcome the color artifacts, we focus on eliminating the color artifacts with low computational complexity. Using spatial correlation of the adjacent pixels, the edge-directional information of the neighbor pixels is used for determining the edge direction of the current pixel. We apply our method to the state-of-the-art algorithms which use edge-directed methods to interpolate the missing color channels. The experiment results show that the proposed method enhances the demosaiced image qualify from $0.09{\sim}0.47dB$ in PSNR depending on the basis algorithm by removing most of the color artifacts. The proposed method was implemented and verified successfully using verilog HDL and FPGA. It was synthesized to gate-level circuits using 0.25um CMOS standard cell library. The total logic gate count is 12K, and five line memories are used.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.9 no.2
• /
• pp.143-150
• /
• 1976

A trial has been made to find out a new method of calculating the survival rate of a fish Population utilizing the length composition data and the characteristics of the frequency curve of the length which usually is normal distribution curve. In this paper, a stochastic method is introduced and applied to calculate the survival rate of yellow croaker caught by Korean trawlers in the Yellow Sea and the East China Sea in 1971. The results are as follows : Mean of survival rate 0.46089 Variance 0.03073 Standard deviation 0.17529 95 percent confidence interval 0.36040-0.56138.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.717-725
• /
• 2000

Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.

• Asia-Pacific Journal of Business
• /
• v.2 no.1
• /
• pp.91-114
• /
• 2011

The market size of e-Commerce in Japan was 15 trillion Yen in 2006, and B2C Internet shopping sales were over 6.57 trillion in 2009. Lakuten is a representative Internet shopping company whose market share is 45%. Lakuten has over 70,000 online stores and Japanese shoppers trust them based on the fair competition rule and pre-control system on e-commerce. Japanese consumers accept new technology rapidly and highly use Internet and mobile channel. This research analyse online shopping behaviors of Japan, a big e-commerce market. Internet shopping intention, satisfaction, and recommendation by Internet shopping motivations, perceived risks, shopping innovativeness were analyzed. A questionnaire survey of 464 Japanese consumer was performed and ANOVA, factor analysis, reliability test have done by SPSS 12.0. As the results, Internet shopping intentions were higher in groups of olders, higher innovativeness. House wives' satisfaction of Internet shopping is highest. High innovativeness group showed higher internet shopping motivation of economics, connivence, hedonic, and social. Student, women, and low income group perceives high risks to Internet shopping. Implications and further researches were suggested based on the results.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.33 no.5
• /
• pp.403-407
• /
• 2000

Ultrastructure and function of testis somatic cells in freshwater prawns Macrobrachium nipponense were studied. The paired testes of the prawn were elongated, united at their anterior end, which lay between the dorsal surface of the hepatopancreas and the heart. Each testis consisted of a large number of seminiferous cords compactly held together by connective tissue. A seminiferous cord was composed of an outer layer of simple squamous epithelium, a basement membrane, the closely packed germ cells and sustentacular cells of the germinal ridge, and an inner layer of simple cuboidal epithelial cells. Leydig cell-like cells in an angular areas filling the space of the seminiferous cords were observed. The nuclei of leydig cell-like cells were characterized by a distinct nucleolus. The simple squamous epithelial layer was composed of flattened cells tying on a basement membrane. The nuclei of the flattened cells were often overlapped in a layer, and the cytoplasm of the cells was observed just near the nuclei. The sustentacular cells were complex in morphology. These cells had relatively small cell bodies from which long cytoplasmic extensions ramified reached the space of germ cells in the germinal ridge. The nuclei of sustentacular cells usually exhibited angular profiles and located most commonly at the periphery of the cords. Cells of simple cuboidal epithelium located between germinal ridge and lumen of seminiferous cord, and part of the cells were adjacent to basal lamina, The cuboidal epithelial cells contained numerous mitochondria, the well-developed rER, the well-developed Golgi complex, and irregularly shaped nuclei. Transition vesicles appeared on the cis side of the Golgi complex. The large vesicles on the trans side of the complex appeared to fuse to form a membrane-bound structure. A number of pits on the cell apex suggested exocytotic activity for secretion of the sperm supporting matrix.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of the Korean association of regional geographers
• /
• v.17 no.5
• /
• pp.582-599
• /
• 2011

The aim of this research is to investigate the various activities of residents conducted at the regenerated Park as well as conflicts and participations of residents that appeared in the regenerative process of the Park in urban low-income group settlement where public spaces for the community are absolutely insufficient, focusing on the Jeonpo-Dolsan Park. Moreover, this research examines the influences of the newly regenerated Park on the daily lives of residents and the meanings and roles of the Park to the residents. The Park not only provided the functions of a general parks but also served the role as the space for the culture, participation, discussion and assembly. Also dirty and uncleaned landscapes was improved because of the regeneration of Park. It was confirmed that the Park contributed to elevating the life quality of residents in urban low-income group settlement by forming an open-minded village, constructing public space for the community and communicating with discontinued neighboring villages. The Park' regeneration was produced not by executing the unilateral redevelopment policy of the administration for the urban low-income group settlement but by inducing the participation of the village residents. Owing to this, the creative regeneration of the Park aroused a motive for place attachment and sense of belonging, expanded public morals and prepared the opportunity to change as a hopeful space in awareness.