• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.155-160
• /
• 2007

A learning resource is a SCO or a collection of on or more assets in the SCORM. A storage policy is required to search rapidly and reuse assets in e-learning environment. However there are not research results about it. In this paper, We propose a storing method for assets based on cluster and define the mathematical formulation of it. Also, we present criteria for assets evaluation and describe procedure to evaluate each asset. We show that the search based on proposed cluster storing method increase performance than the categorization search through performance evaluation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.2
• /
• pp.63-70
• /
• 2016

A housing market in an urban area is not just a single market but a combination of regionally different submarkets. This study begins with a critical mind that previous researches did not consider the spatial autocorrelation of each area where the housings are located. The clustering analysis of housing submarket which considers spatial autocorrelation is performed as it follows. First, 4 housing market attribute variables are reducted to 1 variable by principle component analysis. Then, after calculating $Gi^*max$ by AMOEBA, 7 housing submarkets which have similar characteristics based on $Gi^*max$ are classified. The characteristics of each submarket are investigated, then political implication is deduced as the following. Different level of housing policy should be made to each cluster because each cluster has different level of spatial autocorrelation.

• Journal of the Economic Geographical Society of Korea
• /
• v.17 no.4
• /
• pp.688-701
• /
• 2014

This article is focused on the agglomeration and decline factors of the footwear industries in Busan metropolitan area from the industrial cluster point of perspective. For the research, 'the components and network of industrial cluster model' are presented which is restructured of M. Porter's cluster model. Moreover, this research have examined the agglomeration and decline process of the footwear industries in Busan area and conducted a survey targeting footwear enterprises in Busan area. In the late 1980's, the footwear industries in Busan area formed the largest footwear industrial cluster in the world. However, the industrial cluster started to decline from early 1990's and now it is reduced in to 1/10 size of the past. The growth factors of Busan footwear industrial cluster include cheap and plentiful labours, penetration of OEM production, entrepreneur spirit, human resources network, government's support and so on. Moreover, the agglomeration of relative companies also created high competitiveness in this cluster. The decay factors are pointed out sudden rise of labour cost, shortage of factory site, rise of land price, alteration of government policy, international relocation of footwear production and growth of overseas industrial cluster. Busan footwear industrial cluster nowadays has declined in its size, but it is the only footwear industrial cluster in Korea.

• Journal of Digital Convergence
• /
• v.14 no.9
• /
• pp.309-315
• /
• 2016

The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.173-181
• /
• 2009

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.926-940
• /
• 2018

In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

• Journal of Korea Technology Innovation Society
• /
• v.7 no.1
• /
• pp.130-158
• /
• 2004

This paper aims at renewing the regional innovation system being embossed increasingly as a new paradigm to develop the regional area, using the innovational cluster based on the industrial properties and innovative base in Chungbuk province. As shown in the results of many researches, Chungbuk province is evaluated highly in regional innovation capability and is satisfied with the level of speciality in technical industry so that it has a potential capability to build the regional innovation system. However the clustering competition is growing in intensity between regional groups and there is a possible situation centralized by the high-tech industry into the metropolitan, so building the specialized innovation cluster requires advanced policy decisions and efforts in our won way. Ultimately, for the purpose of structuring the regional innovation system, the specialized innovation cluster reflected in regional industry and capability would be essential. It is time for Chungbuk province to prepare policies in order to make the Chungbuk-type innovation cluster which is neither uniform nor omnipresent.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.355-357
• /
• 2016

Korea Information Security Industry growth rate (7.1%) declined compared to the previous three years growth (15%). The government has announced a 2020 K-ICT security. According to the policy of promoting the competitiveness of industry consolidation and data protection enable entrepreneurship, job creation, there is a need for the ICT industry in conjunction with cyber security cluster composition. In this paper, I research for cybersecurity cluster. Investigate a successful cyber clusters of foreign and analyzed. In addition, I analysis of existing cluster in the domestic and identify the problem. Consequently, building a cyber-research cluster and the expected effects of cyber-research and on how to operate the cluster.

• Asian Journal of Innovation and Policy
• /
• v.9 no.2
• /
• pp.145-163
• /
• 2020

The COVID-19 is a pandemic that affects all facets of our life and will change many patterns in science technology and innovation. A qualitative study was conducted using Focus Group Interview involving ten industry-academia-research experts with the objective of identifying changes in Korea's national innovation system and science & technology policy after the COVID-19. Eight questions were designed, based on the major components of the national innovation system, such as companies, universities, and research institutes, to discuss the changes in the national innovation system and science & technology policy. Also, keyword analysis and cluster analysis were performed using the network analysis program VOSviewer. It is predicted that, in the wake of the COVID-19, Korea's national innovation system will shift to a new paradigm that is more decentralized, responsive, and autonomous. Furthermore, several policy agendas that can turn these changes into positive momentum of change in science & technology policy are presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.716-720
• /
• 2003

Order-picking process is one of the major operations in warehouses and distribution centers. In low-level picker-to-part system, picker usually combines orders (order batching) as much as possible so that the can pick a set of the combined orders at the same time. For midpoint routing policy, this paper develops an efficient order-batching algorithm based on cluster analysis. The algorithm is compared with a well known existing algorithm in terms of the total travel time and number of batches grouped. The test results show that the proposed heuristic performs better than the other.