• Journal of Fisheries and Marine Sciences Education
• /
• v.19 no.3
• /
• pp.373-382
• /
• 2007

As the Internet users are growing, GIS researchers that would like to integrate various GIS informations have more interests for information searching technologies based on Web. But, even though these researches is growing a infinite possibility of utilizing the map, there are not yet providing more functionalized GIS services. This paper proposes a searching mechanism for the teacher information based on the SVG(Scalable Vector Graphics) format transformed the SHP format. We also implement the home-page link function inserted Web-connection information of the specific locations that could connect specific school web site within SVG file. We also provide the services to interpret requested query with proposed scheme.

• Journal of Fashion Business
• /
• v.12 no.6
• /
• pp.138-151
• /
• 2008

This study aims at providing comprehensive data which would be helpful to establish a web shopping mall by analyzing the structure of web fashion star shops which have recently emerged as a result of advances in digital technology and communication. For the purpose of analyzing VMD strategy used in web fashion star shop, we adopt both of the documental and empirical research methods, based on which we examine the concept of E-commerce and current business situation of web fashion star shop industry, and then analyze the main page, product category page and product detail page in a star shop featured by a male pop star within a web shopping mall. According to our analysis of the structure of web fashion star shop, in case of open market, a banner with star's image on it leads to star shop when people click on the link of the banner, and in case of independent mall, they show each star's unique style in the main page. Product category page is linked to each product detail page which presents items of various fashion coordinates, satisfying needs of consumers to follow star's trendy fashion sense.

• Journal of Information Technology Applications and Management
• /
• v.13 no.2
• /
• pp.55-65
• /
• 2006

Since the World-Wide Web (WWW) has become a major channel for information delivery, information overload also has become a serious problem to the Internet users. Therefore, effective information searching is critical to the success of Internet services. We present an integrated search engine for searching relevant web pages on the WWW in a certain Internet domain. It supports a local search on the web sites. The spider obtains all of the web pages from the web sites through web links. It operates autonomously without any human supervision. We developed state transition diagram to control navigation and analyze link structure of each web site. We have implemented an integrated local search engine and it shows that a higher satisfaction is obtained. From the user evaluation, we also find that higher precision is obtained.

• Journal of Information Management
• /
• v.40 no.2
• /
• pp.1-24
• /
• 2009

This study explored the scientific web spaces of Korea and Japan by applying webmetric and social network analysis techniques with the aim of ascertaining international scholarly communication characteristics between the two countries. In general, more links were generated from the Korean scientific web sites to the Japanese sites than those from the opposite direction, thus implying a higher usage of Japanese scientific information on the web in Korean sites. In addition, university sites in the two countries were highly linked on the web revealing the most active institutions in scholarly communication were the universities. Based on the link analysis, the study also indicated which country was more dependent on the other in scholarly communication in specific scientific fields.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.647-656
• /
• 2003

In Webspace, mining traversal patterns is to understand user's path traversal patterns. On this mining, it has a unique characteristic which objects (for example, URLs) may be visited due to their positions rather than contents, because users move to other objects according to providing information services. As a consequence, it becomes very complex to extract meaningful information from these data. Recently discovering traversal patterns has been an important problem in data mining because there has been an increasing amount of research activity on various aspects of improving the quality of information services. This paper presents a Dynamic Link Recommendation (DLR) algorithm that recommends link sets on a Web site through mining frequent traversal patterns. It can be employed to any Web site with massive amounts of data. Our experimentation with two real Weblog data clearly validate that our method outperforms traditional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.902-910
• /
• 2013

The most representative research network in Korea, KREONET, has developed DynamicKL, an advance reservation based Network Service Agent (NSA) for user driven virtual circuit services. DynamicKL provides reservation, provisioning, release, termination, and inquiry web services for network resources by using an open standard network service interface (NSI), as well as web services for network resources by using a GUI interface. In addition, it has the RICE interface to support a protection management function per VC for virtual circuits and reservations. In this article, a protection management per VC for provisioned VCs and reservations is addressed in the DynamicKL framework, as a contribution to the VC protection management issue, which results in more manageable and reliable VC services compared to other advance reservation frameworks. An administrator can detect successful or unsuccessful VC protections in the event of a primary link failure and successful or unsuccessful VC retrievals after a primary link repair, by using RICE.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1045-1061
• /
• 2017

This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying to explicit links and attaching the links to LODs have restrictions on reflecting target LODs' changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ~ 0.8 and depth level of 4 provides searching results that include 91% ~ 98% of the trustworthy links and about 170% of triples expanded.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.11-18
• /
• 2016

Linked Data is a web standard data definition method devised to connect, expand resources with a standardized type. Linked Data built in various areas expands existing knowledge through an open data cloud like LOD(Linked Open Data). A project to link and service existing knowledge through LOD is under way worldwide. However, LOD project in domestic is being participated in a specific field to the level of research. In this paper, we suggests a method to build the area of technical knowledge like legislations in type of Linked Data, and distribute such Linked Data built to LOD. The construction method suggested by this paper divides knowledge of legislations in structural, semantic, and integrated perspective, and builds each of them by converting to Linked Data according to the perspective. Also, such built Linked Legal Data prepares to link knowledge in a standardized type by distributing them onto LOD. Built Linked Legal Data are equipped with schema for link service in various types, and give help increase understand the access type to existing legal information.

• The Journal of the Korea Contents Association
• /
• v.12 no.5
• /
• pp.357-369
• /
• 2012

The purpose of this paper is to explain and identify how atmospherics of web-sites such as graphics, colour, menu and link have an effect on consumers' emotion and satisfaction, which in turn have influence on repurchase intention in internet shopping malls. A survey study was conducted to collect the data with consumers who have experience purchase or search on internet shopping malls. Analysis of structural equation modeling with AMOS 18.0 was performed to test the research hypothesis. The results of the study are as follows: Menu and link are positively associated on consumers' emotion, but graphics and colour have not influence on both consumers' emotion and satisfaction. Consumers' emotion is positively associated on both satisfaction and repurchase intention, and then satisfaction is also positively associated on repurchase intention.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.58-67
• /
• 2016

With the large amount of complex network data that is increasingly available on the Web, link prediction has become a popular data-mining research field. The focus of this paper is on a link-prediction task that can be formulated as a binary classification problem in complex networks. To solve this link-prediction problem, a sparse-classification algorithm called "Truncated Kernel Projection Machine" that is based on empirical-feature selection is proposed. The proposed algorithm is a novel way to achieve a realization of sparse empirical-feature-based learning that is different from those of the regularized kernel-projection machines. The algorithm is more appealing than those of the previous outstanding learning machines since it can be computed efficiently, and it is also implemented easily and stably during the link-prediction task. The algorithm is applied here for link-prediction tasks in different complex networks, and an investigation of several classification algorithms was performed for comparison. The experimental results show that the proposed algorithm outperformed the compared algorithms in several key indices with a smaller number of test errors and greater stability.