• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.260-268
• /
• 1998

In this paper, I propose a metric model for measuring complexity of Web documentations which are wrote by HTML and XML. The complexity of Web documentation has effect on documentation understandability which is an important metric in maintenance and reusing of Web documentation. The understandable documents have more effect on WEI. The proposed metric uses the entropy to represent the degree of information flows between Web documentations. The proposed documentation complexity measures the information flows in a Web document based on the information passing relationship between Web document files. I evaluate the proposed metric by using the complexity properties proposed by Weyuker, and measure the document complexity. I show effectiveness of analyzing the correlation between the number of document file and document complexity.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.437-447
• /
• 2007

A variety of similarity metrics have been used to measure the degree of web page changes. In this paper, we first define criteria for web page changes to evaluate the effectiveness of the similarity metrics in terms of six important types of web page changes. Second, we propose a new similarity metric appropriate for measuring the degree of web page changes. Using real web pages and synthesized pages, we analyze the five existing metrics (i.e., the byte-wise comparison, the TF IDF cosine distance, the word distance, the edit distance, and the shingling) and ours under the proposed criteria. The analysis result shows that our metric represents the changes more effectively than other metrics. We expect that our study can help users select an appropriate metric for particular web applications.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.292-299
• /
• 2004

For Web System composed of a variety of hardware, software and network system, there is a wide difference in price, function and capacity. In addition, it is important to select the most suitable system when web system is constructed as the claim of high-quality web service from user has increased. Data of bench-marking is usually employed when the system is selected. Evaluation with the result of bench-marking, however, is not easy at web situation composed of a variety of systems. In this paper, first integrated bench-marking of hardware, software and network system metric were determined, and the plan to effectively compare and evaluate the result of bench-marking by using fuzzy set were offered.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.625-633
• /
• 2008

Recently, the participation, opening and joint ownership of the users are important issue. The users want professional and accurate information from web. But users often suffer from retrieving accurate information. Even though the users find information they want, it is not guaranteed that the information is reliable since there are too much information placed on the web. Thus, we propose the novel rank metric to promote reliability and efficiency in information retrieval. In order to verify our approach, we implement a web site based on the proposed rank metric for nonofficial medical science information. The proposed rank metric based on user's level. This is to give score of text through differential rate depending on the user's level. The proposed rank metric enhances the reliability of text which is reflecting the user's mental factor. Thus, this method can be used for enhancing the reliability of text.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.117-126
• /
• 2010

Software complexity is used to evaluate a target system's maintainability. The existing complexity metrics on web applications are count-based, so it is hard to incorporate the understandability of developers or maintainers. To make up for this shortcomings, entropy-theory can be applied to define complexity, however, it is assumed that information quantity of each paper is identical. In this paper, structural complexity of a web application is defined based on information theory and similarity. In detail, the proposed complexity is defined using entropy as the previous approach, but the information quantity of individual pages is defined using similarity. That is, a page which are similar with many pages has smaller information quantity than a page which are dissimilar to others. Furthermore, various similarity measures can be used for various views, which results in many-sided complexity measures. Finally, several complexity properties are applied to verify the proposed metric and case studies shows the applicability of the metric.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.291-301
• /
• 2012

A scalar metric for the assessment of hull surface producibility was known to be useful in estimating the complexity of a hull form of ships or large offshore structures by looking at their shape. However, it could not serve as a comprehensive measuring tool due to its lack of important components of the hull form such as longitudinals, stiffeners, and web frames attached to the hull surface. To have a complete metric for cost estimation, these structural members must be included. In this paper, major inner structural members are considered by measuring the complexity of their geometric shape. The final scalar metric thus consists of the classes containing inner members with various curvature magnitudes as well as the classes containing curved plates with single and double curvature distribution. Those two distinct metrics are merged into a complete scalar metric that accounts for the total cost estimation of complex structural bodies.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.139-148
• /
• 2006

This study is intended to propose quality criteria and Web metrics for usability quality evaluation of multimedia Web sites. Recently, applications of the Web sites are not limited to the area of industry and operating as it integrates the new technology. Also as information super highway becomes common with development or network technology, multimedia Web site is on the rise due to various use of multimedia attributes. Therefore this study expands to apply HTML based Web site quality evaluation studied in Software engineering, HCI, Hypermedia to multimedia Web site, and suggests new metrics by integrating flash usability which is expanding its portion in multimedia Web site lately. The Web metrics proposed in this study are verified by heuristic evaluation from a group of expert. It analyses the results of quantitative and qualitative qualify evaluation on Web Award Korea by comparing the award-winning, high-quality Web site with non-winning Web sites. This study can be used to establish guideline for high-quality multimedia Web site development in the future.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.785-794
• /
• 2006

Nowadays, Internet is used worldwide and network traffic is increasing dramatically. Much of Internet traffic is due to the web applications. And I propose a new cooperative web caching scheme, called DCOORD which tries to minimize the overall cost of Web caching. DCOORD reduces the communication cost by coordinating the objects which are cached at each cache server. In this paper, I compare the Performance of DCOORD with two well-known cooperative Web caching schemes, ICP and CARP, using trace driven simulation. In order to reflect the cost factor in the network communication, I used the CSR(Cost-Saving Ratio) as our performance metric, instead of the traditional hit ratio. The performance evaluations show that DCOORD is more cost effective than ICP and CARP.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.281-289
• /
• 2006

Even though software developing environment has been changing to Web basis very fast, there are just few studies of quality metric or estimation model for Web software. In this study after analyzing the correlation between the risk level and property of objects using linear regression, six middle sized industrial system has been used to propose the correlation model of size and Number of Classes(NOC), size and Number of Methods(NOM), complexity and NOC, and complexity and NOM. Among of six systems 5 systems(except S06) have high correlation between size(LOC) and NOM, and four systems(except S04 & S06) have high correlation between complexity and NOC / NOM. As Web software architecture with three sides of Server, Client and HTML, complexity of each sides has been compared, two system(S04, S06) has big differences of each sides compleity values and one system(S06) has very higher complexity value of HTML, So the risk level could be estimated through NOM to improve maintenance in case of that the system has no big differences of each sides complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.399-410
• /
• 2002

Web cache, which is functionally another word of proxy server, is located between client and server. Web cache has a limited storage area although it has broad bandwidth between client and proxy server, which are usually connected through LAN. Because of limited storage capacity, existing objects in web cache can be deleted for new objects by some rules called replacement algorithm. Hit rate and byte-hit rate are general metrics to evaluate replacement algorithms. Most of the replacement algorithms do satisfy only one metric, or sometimes none of them. In this paper, we propose two replacement algorithms to achieve both high hit rate and byte-hit rate with great satisfaction. In the first algorithm, the cache is appropriately partitioned according to file types as a basic model. In the second algorithm, the cache is composed of two levels; the upper level cache is managed by the basic algorithm, but the lower level is collectively used for all types of files as a shared area. To show the performance of the proposed algorithms, we evaluate hit rate and byte-hit rate of the proposed replacement algorithms using the trace driven simulation.