• Korean System Dynamics Review
• /
• v.3 no.1
• /
• pp.105-129
• /
• 2002

IT companies make a lot of efforts for sharing and utilizing of experiences of their members and transforming them into the organizational knowledge as a competitive core. But they face a dilemma that they have to spend time and financial resource to perform activities around knowledge management for the long-term gains, while carrying field-works for making short-term profits. As an initial attempt to tackle this managerial problem, this paper try to investigate the mechanism of knowledge management in a small IT company in Korea with a synthetic view-point using system dynamics simulation model. It depicts the dynamic behaviors of knowledge management and presents some findings of political leverage. Although it has to be replenished further, the scheme for the dynamism of knowledge management and the findings presented in the paper could be useful for the decision makers particularly of knowledge-intensive organizations

• Journal of Family Resource Management and Policy Review
• /
• v.17 no.3
• /
• pp.125-144
• /
• 2013

This aim in this study is to investigate the meaning of case management and management in general from the case manger's perspective, as well as case mangers' abilities and networks. We also propose a development direction for the establishment of a local integrated family-centered community management system. Regarding the collection of qualitative data, focus group interviews (FGIs) were conducted with 11 case managers from social welfare organizations in the city of C. The interviews consisted of open-ended questions in the following four categories: understanding of case management, case managers' abilities, case management environments, and local community networks. According to the interview analysis, a total of 16 subcategories in 9 categories and 4 domains have been identified. Due to the ambiguity regarding the concept of case management, case management was completely dependent upon individual case managers' abilities. In particular, family-centered case management was found to exist in several organizations in the same region. In terms of case management environments, the following problems have been observed: absence of related departments and staff, confusion regarding performance evaluation standards, limitations in sharing information among organizations, limitations in resource exploration and management, redundant support, and an uncomfortable relationship between the private and public sector. Horizontal exchange and cooperation among organizations are essential to establish and facilitate a local community network. After all, to establish a local family-centered community case management system, the roles of a Healthy Families Center and a Multi-cultural Family Support Center as parts of a family-centered transfer system should be fully emphasized in local society, and the performance of family-centered case management should be developed.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.67-76
• /
• 2008

Grid computing has a large scale virtual computing environment that enables a collaborative processing through sharing resources of geographically distributed organizations. In recent year, the development of wireless networks and mobile devices enables mobile devices to consider as a resource of the grids. However, there are some problems such as low performance of processors, small capacity of storages, limited capacity of battery, and low bandwidth. In this paper, to overcome these limitations occurred in mobile grid environments, we proposed a proxy-based mobile grid system. Our proposed system enables mobile devices to play roles as a resource consumer and a resource provider and to collaborate with wired grids through a mobile router. Also, we propose an adaptive job scheduling scheme to cope with context changes of mobile devices and compare our scheduling scheme with other scheduling schemes using a simulation tool, SimGrid, to verify the validity of our job scheduling scheme.

• Journal of Navigation and Port Research
• /
• v.45 no.4
• /
• pp.186-193
• /
• 2021

To enhance the competitiveness of the Busan Port in accordance with changes in global shipping and port industry trends, the Busan New Port is promoting step-by-step integration and developing a port resource-sharing platform. However, inefficient resource-sharing can cause unnecessary additional costs or impede port productivity, so accurate supply and demand matching of shared resources is required. In this study, the supply and demand of port resources were investigated for employees of Busan New Port and North Port, and port resources that could be ideally shared through IPA(Importance Performance Analysis) were analyzed. As a result of analyzing the equipment in the port, Yard Tractor, Reach Stacker, and Top Handler were the top considerations, and for facilities in the port, berths and aprons, empty container yards, and refrigerated container yards were the most important considerations. As for the data in the port, gate status, equipment specifications, and berth and apron conditions were the top considerations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.97-103
• /
• 2020

Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.423-429
• /
• 2016

The study evaluates user experiences of YouTube and Vimeo, typical Video-sharing websites, to suggest guidelines that are more user-cantered and useful. I did some literature research followed with evaluation of theoretical backgrounds, present conditions and future services. Also, I used the six principles of "Creating Pleasurable Interface" by Stephen Anderson to conduct an in-depth interview. The results indicate that YouTube needs to improve availability of its functions and usability by reducing advertisement. Vimeo needs to improve its popularity by increasing popular contents and add relationship service such as personal broadcasting system and community services. I expect this study will become a good resource for upgrading user experiences of Video-sharing websites. I also believe that this study can guide other studies about user experience in other fields.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.145-150
• /
• 2010

In this paper, the performance of cognitive radio network is analyzed in terms of Erlang capacity. To improve the Erlang capacity with respect to primary user (PU) and secondary user (SU) traffic, we propose an efficient radio resource management scheme utilizing the buffer for new SUs and interrupted SUs. Markov model is developed, and analyzed to derive the performances of the proposed spectrum sharing scheme in both primary system and secondary system. To determine the Erlang capacity region, the blocking probability, the forced termination probability and the non-completion probability are calculated. Simulation results provide insight into the advantages of the buffer utilization. It is observed that the supportable traffic loads of PU and SU can be increased significantly according to the buffer length.

• Journal of Korean Library and Information Science Society
• /
• v.42 no.2
• /
• pp.85-103
• /
• 2011

Bibliographic Network has been a goal about not only to support resource sharing within libraries but also to pursue economic efficiency of cataloging. But nowadays, as resources in diverse media and format have been poured out, printed resources based union catalog should change to new resources finding system which include diverse type of resources. This study analyzes changing factors of bibliographic network and strategies for LC, NII, OCLC, NLA who try to turn over a new service. Finally basis on these findings, suggest task for Korean new generation bibliographic network service which is focused on introducing new collaborating model and developing new resource finding system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.367-377
• /
• 1998

In this paper, we propose a framework (named Multimedia Service Framework) that provides the development and operation of different kind of multimedia applications. This framework defines the architectures and its functionalities for supporting multimedia services, in 3 layers of: Application, Distributed Support System and Network. Firstly, we analyzed general characteristics of multimedia applications, and defined a set of horizontal and vertical services in the Application Architecture. Also, we determined functionalities and services required to support all application services in the Distributed Support System Architecture which must provide functions for the distribution transparencies, resource sharing, interoperability and portabiliy. Finally, in the Network Architecture we proposed the network infrastructure and services to increase the efficiency in resource management and processing capacity of network components such as router and switch, adopting the active networking approach.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.