Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
2
/ 2
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
À¯ÀüÀÚ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ CORBA ±â¹ÝÀÇ Àç»ç¿ë Ŭ·¡½º ¶óÀ̺귯¸® ±¸Çö
¿µ¹®Á¦¸ñ(English Title)
Implementation of Reusable Class Library based on CORBA using Genetic Algorithm
ÀúÀÚ(Author)
À̺´Á¤
¹®º´·Î
¿ìÄ¡¼ö
Byung-Jeong Lee
Byung-Ro Moon
Chi-Su Wu
¿ø¹®¼ö·Ïó(Citation)
VOL 05 NO. 02 PP. 0209 ~ 0222 (1999. 04)
Çѱ۳»¿ë
(Korean Abstract)
°³¹ß °úÁ¤ÀÇ »ý»ê¼º°ú ÇÁ·Î±×·¥ÀÇ ½Å·Ú¼ºÀ» Çâ»ó½ÃÅ°±â À§ÇÏ¿© ¼ÒÇÁÆ®¿þ¾î Àç»ç¿ëÀÌ ¸Å¿ì Áß¿äÇϸç, È¿°úÀûÀÎ Àç»ç¿ëÀ» À§Çؼ ¼¼¹ÐÇÑ ºÐ·ù ¹æ¹ý°ú Á¤È®ÇÑ °Ë»ö ¹æ¹ý¿¡ ±â¹ÝÇÑ °´Ã¼ ÁöÇâ Àç»ç¿ë ¶óÀ̺귯¸®°¡ ÇʼöÀûÀÌ´Ù. º» ¿¬±¸¿¡¼´Â Àç»ç¿ë ¶óÀ̺귯¸®ÀÇ ´ÙÁß Å¬·¯½ºÅ͸µ(multi-way clustering) ºÐ·ù ¹æ¹ý°ú Ŭ·¯½ºÅÍ ±â¹Ý ¼ºÇü °Ë»ö(cluster-based linear retrieval) ¹æ¹ý¿¡ À¯ÀüÀÚ ¾Ë°í¸®Áò(genetic algorithm)À» Àû¿ëÇÑ´Ù. ´ÙÁß Å¬·¯½ºÅ͸µÀº ºÎÇ°µéÀÌ ÇÒ´çµÈ Ŭ·¯½ºÅÍ °³¼ö, Ŭ·¯½ºÅÍ ³»ºÎ À¯»çµµ ±×¸®°í Ŭ·¯½ºÅÍµé »çÀÌÀÇ À¯»çµµ¸¦ ÃÖÀûÈÇϴ Ŭ·¯½ºÅ͸µÀ» ã¾Æ ºÎÇ°À» ¼¼¹ÐÈ÷ ºÐ·ùÇÏ´Â °ÍÀÌ°í, Ŭ·¯½ºÅÍ ±â¹Ý ¼±Çü °Ë»öÀº ÁÖ¾îÁø ÁúÀÇ¿Í À¯»çÇÑ ºÎÇ°À» ¸¹ÀÌ Æ÷ÇÔÇϴ Ŭ·¯½ºÅ͸¦ °Ë»öÇÏ´Â °ÍÀÌ´Ù. º» ³í¹®¿¡¼´Â À¯ÀüÀÚ ¾Ë°í¸®ÁòÀÌ ½Ã¹Ä·¹ÀÌƼµå ¾î´Ò¸µ ¾Ë°í¸®Áò(simulated annealing algorithm)º¸´Ù ¿ì¼öÇÑ Çظ¦ ã´Â °ÍÀ» ½ÇÇèÀ» ÅëÇÏ¿© º¸ÀÌ°í, ¶ÇÇÑ º» ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ CORBA ±â¹ÝÀÇ Àç»ç¿ë Ŭ·¡½º ¶óÀ̺귯¸®(RCL)¸¦ ±â¼úÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Software reuse is very important to improve development productivity and code reliability. An object-oriented reuse library with an elaborate classification scheme and a precise retrieval system is essential for efficient reuse. In this study, we apply a genetic algorithm to multi-way clustering and cluster-based linear retrieval in a reuse library. The multi-way clustering tries to find an optimal component grouping and classify components elaborately by considering the number of clusters, similarity in a cluster, and similarity between clusters; the cluster-based linear retrieval tries to find an optimal query that retrieves clusters containing many components similar to a given query. In this paper, our experimental results have shown that genetic algorithm produces better solutions than simulated annealing algorithm. We also describe a Reusable Class Library(RCL) based on CORBA using the algorithm.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.