• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.349-356
• /
• 2005

Artificial Organism-used application areas are expanding at a break-neck speed with a view to getting things done in a dynamic and Informal environment. A use of general programming or traditional hi methods as the representation of Artificial Organism behavior knowledge in these areas can cause problems related to frequent modifications and bad response in an unpredictable situation. Strategies aimed at solving these problems in a machine-learning fashion includes Genetic Programming and Evolving Neural Networks. But the learning method of Artificial-Organism is not good yet, and can't represent life in the environment. With this in mind, this research is designed to come up with a new behavior evolution model. The model represents behavior knowledge with Classification Rules and Enhanced Backpropation Neural Networks and discriminate the denomination. To evaluate the model, the researcher applied it to problems with the competition of Artificial-Organism in the Simulator and compared with other system. The survey shows that the model prevails in terms of the speed and Qualify of learning. The model is characterized by the simultaneous learning of classification rules and neural networks represented on chromosomes with the help of Genetic Algorithm and the consolidation of learning ability caused by the hybrid processing of the classification rules and Enhanced Backpropagation Neural Network.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.504-511
• /
• 2015

Recently, the amount of data is rapidly increasing with the popularity of the SNS and the development of mobile technology. So, it has been actively studied for the effective data analysis schemes of the large amounts of data. One of the typical schemes is a Voronoi diagram based on kNN join algorithm (VkNN-join) using MapReduce. For two datasets R and S, VkNN-join can reduce the time of the join query processing involving big data because it selects the corresponding subset Sj for each Ri and processes the query with them. However, VkNN-join requires a high computational cost for constructing the Voronoi diagram. Moreover, the computational overhead of the VkNN-join is high because the number of the candidate cells increases as the value of the k increases. In order to solve these problems, we propose a MapReduce-based kNN-join query processing algorithm for analyzing the large amounts of data. Using the seed-based dynamic partitioning, our algorithm can reduce the overhead for constructing the index structure. Also, it can reduce the computational overhead to find the candidate partitions by selecting corresponding partitions with the average distance between two seeds. We show that our algorithm has better performance than the existing scheme in terms of the query processing time.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1311-1319
• /
• 1998

The methods of providing available bandwidth adaptively using feedback to maximize the utilization of network as well as the quality of service have been the focus of recent research activities for ATM(Asynchronous Transfer Mode). This study has been extended from the point-to-point connection to a point-to-multipoint environment as the number of applications requiring multicast service increases. It is known that the effectiveness of feedback based congestion control scheme diminishes as propagation delay increases. Especially for a multicast connection consisting of various paths and destinations with different performance and congestion status, the problem of unfairness due to different propagation delays may occur. The degree of such unfairness may change depending on various aspects of congestion control schemes. These has been, however, relatively little study on these problems. In this paper, we present how various aspects of control schemes-length of the interval between feedback generations, point of time to coalesce feedback cells from child paths, decreasing factor of source rate in case of congestion-affect the degree of unfairness. Simulation results show that degree of unfairness changes according to when the feedback coalescing happens. Expecially it is shown that the effect of feedback coalescing time to the degree of unfairness is more significant for the smaller feedback interval. It is also found that as the source rate decreasing factor becomes larger the average ACR(Allowed Cell Rate) at the source gets lower and the degree of unfairness grow larger.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.857-866
• /
• 2006

Performance of an image retrieval system is usually very low because of the semantic gap between the low level feature and the high level concept in a query image. Semantically relevant images may exhibit very different visual characteristics, and may be scattered in several clusters. In this paper, we propose a content based image rertrieval approach which combines region based image retrieval and a new relevance feedback method using adaptive clustering together. Our main goal is finding semantically related clusters to narrow down the semantic gap. Our method consists of region based clustering processes and cluster-merging process. All segmented regions of relevant images are organized into semantically related hierarchical clusters, and clusters are merged by finding the number of the latent clusters. This method, in the cluster-merging process, applies r: using v principal components instead of classical Hotelling's $T_v^2$ [1] to find the unknown number of clusters and resolve the singularity problem in high dimensions and demonstrate that there is little difference between the performance of $T^2$ and that of $T_v^2$. Experiments have demonstrated that the proposed approach is effective in improving the performance of an image retrieval system.

• Annual Conference of KIPS
• /
• 2001.04b
• /
• pp.727-730
• /
• 2001

초고속 인터넷 서비스의 확대에 따라 이를 교육에 직 간접적으로 응용하기 위한 노력이 지속적으로 진행되어 왔다. 특히 웹 기반의 가상강의 저작도구를 통한 웹 코스웨어는 원거리 학습자들의 학습 욕구를 자기 주도적인 학습을 통해 가능케 했고 기존의 텍스트, 사운드를 통한 가상강의에서 동영상이 가미된 주문형 교육 서비스(EOD: Education On Demand)가 가능해졌다. 그러나 이를 이용하는 학습자는 전체적인 모듈의 이해를 통해 수업이 진행됨에 따라 학습과정에서는 질의응답을 튜터를 통해 웹 캐스팅이 이루어졌다. 따라서, 질의응답은 텍스트 형식의 E-mail, 채팅, 게시판, 방명록을 통해 이루어지므로 학습자가 요구한 질의 내용을 잘못 이해하고 튜터가 학습 과정에서의 피드백을 제공하지 못함으로써 개인 학습의 동기부여가 감소됨에 따라 흥미를 잃게 되었다. 본 논문에서는 이러한 문제점을 개선하기 위해 멀티 캐스팅 기법을 통해 교육용 서버를 이용한 학습지원도구를 분석, 설계한다. 가상강의는 기본적인 컨텐츠를 제시하고 그를 통해 수업이 진행되는 과정에서의 질의응답을 일대다(One-To-Many)의 멀티 캐스팅 서비스를 튜터가 지정한 교육용 서버를 통해 텍스트 형식이 아닌 강의자료로 쓰인 문서 파일에 직접 작성하여 전송하게 된다. 따라서 튜터는 메일링 서비스를 통해 질문사항을 자신의 폴더 서비스로 확인하고 즉시 학습자에게 피드백을 제공함으로써 튜터와 학습자들간의 커뮤니케이션이 활발히 이루어지며, 상호작용의 증가를 통해 웹 기반의 컨퍼런싱(WBC: Web Based Conferencing)을 가질 수 있게 된다.rver는 Client가 요청한 Content(services)를 전달 해 주는 컨텐트 전달 모듈(Content Deliver Module)과 서버 Phonebook 엑세스 모들(Server Phonebook Access Module)로 구성되어 있다.외 보다 높았다(I/O ratio 2.5). BTEX의 상대적 함량도 실내가 실외보다 높아 실내에도 발생원이 있음을 암시하고 있다. 자료 분석결과 유치원 실내의 벤젠은 실외로부터 유입되고 있었고, 톨루엔, 에틸벤젠, 크실렌은 실외뿐 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.414-422
• /
• 2011

IR (Information Retrieval) systems have the methods that compare relationships between query and index to identify document that may be fit to the user's query keyword. However, the methods usually ignore the importance of relations that are not expressed in the query. Therefore, in this study, we describe how to refine the queries' relation from keyword and to reveal the hidden intent. A useful relationship between query and keyword in IR wth studied and we classified the tion fromrelation. Firstfromall, we did researchmrelated on semantic relationship and ontolhiical researchmin foreign and domestic research, and also analyzed semantic network practices, information retrieval technolhiy, extracted and classified the tion fromrelationships s' relasite's real-world datamin whichminformation retrieval technolhiin fare applied. Next, we souiht to solve the problems occurred frequently i' relasituation that searchers tioically face. I' relacurrent search technolhiy, the mesh searchmresult fare poured by simply comparn ina query with index terms. Therefore, the need for an intelligent search fittn inusers' intent is required. The relationships between two queries to re hiddee and identify relasearcher's intent have to be revealed. By analyzn inthe practical cthes s' queries and classifyn inthem into nine kind fromrelationship tion, we proposed the method to design relation revealn inand role namn i, and we have also illustrated limitations of that methods.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.4
• /
• pp.111-121
• /
• 2007

Diagnosis and Prediction of urban industrial structure is a key subject for establishment of sustainable urban development plan. By this time, studies of industry-related urban spatial structure have been concentrated on measurement of space distribution by industry type mainly using data about urban industries or total worker numbers. Now, status of workers become an important issue so this study analyzed qualitative change of urban industrial structure in the view of space using work status classification system. For that, data for work status in 1994 and 2004 were collected in towns and villages, and space analysis units were coincided based on change data between 1994 and 2004. Then, it analyzed spatial distribution pattern of employment through qualitative standard called work status using GIS. The analysis results by work status type of Busan industrial structure in GIS circumstance were as below. First, traditional labor intensive industries met a limit and service and wholesale/retail sale industries went to be poor livelihood. Therefore, Busan's employment rate should be decreased and worker numbers were statistically increased, however, irregular and non-wage workers were suddenly increased. So, it was determined that the quality of employment in Busan area came down. Second, a traditional downtown area has dwindled; on the other hand, employment has been increased in new town or new industrial complex and in the area developed services rather than the manufacturing industry. It is expected that the result of this study may be meaningful as data to prepare for longterm industrial development plan through qualitative evaluation called work status as well as to make behavior pattern of industrial structure which is basis of urban development.