• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.35-48
• /
• 2010

For the next generation mobile communication system, diverse wireless network techniques such as beyond 3G LTE, WiMAX/WiBro, and next generation WLAN etc. are proceeding to the form integrated into the All-IP core network. According to this development, Beyond 3G integrated into heterogeneous wireless access technologies must support the vertical handover and network to be used of several radio networks. However, unified management of each network is demanded since it is individually serviced. Therefore, in order to solve this problem this study is introducing the theory of Common Radio Resource Management (CRRM) based on Generic Link Layer (GLL). This study designs the structure and functions to support the vertical handover and propose the vertical handover algorithm of which policy-based and MCDM are composed between LTE and WLAN systems using GLL and CRRM. Finally, simulation results are presented to show the improved performance over the data throughput, handover success rate and the system service cost.

• The Journal of the Korea Contents Association
• /
• v.17 no.5
• /
• pp.337-356
• /
• 2017

The purpose of the research is to explore the main cause and effect of successful marriage that Korean husbands, who are multicultural families had. To do the research, the experiment has been done with 7 husbands for 2 months. The 7 husbands took depths interview and analyzed the result by grounded theory approach. As a result, the husband experienced 'repentance of marriage' because of 'unready marriage', but 'Raising children', 'Helping housework' and 'recognition from friends and colleague' have affected the husbands to have a successful marriage adaptation. Based on the result, a political and practical proposal has been proposed to the Korean husbands who are multi-cultural family. Here are the examples of the proposal. As a social welfare policy, 'obligation of information offering for prospective spouse', 'following the Labor Standards and parental leave', 'expansion of visiting supervise system' and 'making guidance for husbands and distribute map of Immigration Office, Multicultural Family Support Center and Community Center' have proposed. And as an alternative plan for a practical social welfare policy and continuous social awareness improvement, 'various education program', 'a program with domestic married couple', 'a program with parents-in-law', 'a specific program to increase the housework participation for husbands' and necessity of development and practice of group program for husband have been emphasized.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.268-278
• /
• 2004

In this paper, we describe our experience in the design and implementation of the SMART file system to handle multimedia workload. Our work has three design objectives: (ⅰ) efficient support for sequential workload, (ⅱ) avoiding disk fragmentation, (ⅲ) logical unit based file access. To achieve these three objectives, we develop a file system where a file consists of linked list of Data Unit Group. Instead of tree like structure of the legacy Unix file system, we use single level file structure. Our file system can also access the file based upon the logical unit which can be video frame or audio samples. Data Unit Group is a group of logical data units which is allocated continuous disk blocks. At the beginning of each Data Unit Group, there exists an index array. Each index points to the beginning of logical data units, e.g. frames in the Data Unit Group. This index array enables the random access and sequencial access of semantic data units. SMART file system is elaborately tailored to effectively support multimedia workload. We perform physical experiments and compare the performance of SMART file system with EXT2 file system and SGI XFS file system. In this experiment, SMART file system exhibits superior performance under streaming workload.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.778-787
• /
• 1999

이제까지 대부분의 다중 에이전트 시스템에서는 에이전트 사회에 속한 모든 응용 에이전트를 작업 요청에 관계없이 처음부터 구동시킨다고 가정하였다. 이러한 에이전트 정적 구동 방법은 에이전트 관리를 단순하게 해주는 이점을 제공하지만 워크플로우 관리나 전자상거래와 같이 매우 많은 수의 에이전트로 구성되는 응용 분야에서는 시스템 과부하와 자원의 낭비 등 많은 문제점을 초래한다. 동적 에이전트 관리는 이에 대한 해결책으로 아주 많은 수의 에이전트를 포함하는 다중 에이전트 시스템에서 현재 수행중인 작업에 관련된 에이전트만을 선별하여 구동시키고, 작업이 끝난 에이전트는 종료시킴으로써 자원의 낭비를 막고 에이전트간의 상호작용 시에 요구되는 에이전트 통신의 복잡도 부담을 감소시키는 효과를 낸다. 본 논문에서는 자바로 에이전트 관리 시스템을 구현하고, 이 관리 시스템을 통해 각기 다른 언어로 개발된 응용 에이전트가 분산된 환경에서 상호 협력을 통해 작업을 수행할 수 있는 기법을 제안한다. 사용자나 다른 에이전트의 요청으로 에이전트를 동적으로 수행시키기 위해 다른 언어로의 확장을 가능하게 하는 Java Native Interface(JNI)를 사용한 기술 및 이러한 이질적인 에이전트간의 원활한 통신을 위해서 KQML 언어 인터페이스를 통한 통신 기능을 제안한다. 이질적 에이전트의 동적 관리를 가능하게 함으로써 다중 에이전트 시스템의 자원 이용 효율성과 확장성을 높이고 다양한 환경 변화에 대한 적응성과 개선된 협동능력을 제공한다.Abstract It has been assumed that all application agents in a multi-agent system are pre-invoked and remain active regardless of whether they are actually used. Although this kind of static agent invocation simplifies the management of agents, it causes several problems such as the system overload and a waste of resources, especially in the areas of the workflow management and the electronic commerce that consist of tens and even hundreds of application agents. A solution for these problems is the scheme of dynamic agent management that selectively invokes only agents that are actually requested and terminates them when they are no longer needed. This method prevents a waste of system resources and alleviates the complexity of agent communications.This paper proposes an agent management system implemented in Java that supports interactions between application agents that are developed using different languages. Dynamic agent invocation is accomplished by Java Native Interface(JNI) that links two heterogeneous methods, and by KQML language interface that facilitates the communications between heterogeneous agents. This scheme of dynamic agent management provides efficient resource usage, easy extensibility, dynamic adaptibility to changes in the environment, and improved cooperation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.94-101
• /
• 2008

Non-volatile RAM (NVRAM) is a form of next-generation memory that has both characteristics of nonvolatility and byte addressability each of which can be found in nonvolatile storage and RAM, respectively. The advent of NVRAM may possibly bring about drastic changes to the system software landscape. When NVRAM is efficiently exploited in the system software layer, we expect that the system performance can be significantly improved. In this regards, we attempt to develop a new Flash file system, named MiNVFS (Metadata in NVram File System). MiNVFS maintains all the metadata in NVRAM, while storing all file data in Flash memory. In this paper, we present quantitative experimental results that show how much performance gains can be possible by exploiting NVRAM. Compared to YAFFS, a typical Flash file system, we show that MiNVFS requires only minimal time for mounting. MiNVFS outperforms YAFFS by an average of around 400% in terms of the total execution time for the realistic workloads that we considered.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.75-83
• /
• 2008

Joye et al. introduced a new prime generation algorithm (JPV algorithm hereafter), by removing the trial division from the previous combined prime generation algorithm (combined algorithm hereafter) and claimed that JPV algorithm is $30{\sim}40%$ faster than the combined algorithm. However, they only compared the number of Fermat-test calls, instead of comparing the total running times of two algorithms. The reason why the total running times could not be compared is that there was no probabilistic analysis on the running time of the JPV algorithm even though there was a probabilistic analysis for the combined algorithm. In this paper, we present a probabilistic analysis on the running time of the JPV algorithm. With this analytic model, we compare the running times of the JPV algorithm and the combined algorithm. Our model predicts that JPV algorithm is slower than the combined algorithm when a 512-bit prime is generated on a Pentium 4 system. Although our prediction is contrary to the previous prediction from comparing Fermat-test calls, our prediction corresponds to the experimental results more exactly. In addition, we propose a method to improve the JPV algorithm. With this method, the JPV algorithm can be comparable to the combined algorithm with the same space requirement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.415-423
• /
• 2001

Recently, there are many attempts to reproduce real world fine art pieces in digital forms. The digital representations are convenient to store and/or transmit. In contrast, mobiles, or moving sculptures, such as those designed by Alexander Calder cannot to reproduced realistically by usual reproduction techniques. Since mobiles are originally designed to generate motions in response to external forces applied to it, people could not fully enjoy them through photographs or static images. We present a virtual mobile system where use can easily control the mobile and can feel the impressions that the artist originally intended to provide. A real-world mobile is reconstructed in a three-dimensional physically-based model. and then virtual wind is generated to give motions to it. The motions of the mobile are generated by constraint dynamics and impulse dynamics techniques, which are modified to fully utilize the characteristics of the mobile, and finally give interactive displays on the PC platforms. The techniques presented can easily be extended to simulate other interactive dynamics systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.442-460
• /
• 2001

In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.581-591
• /
• 2005

Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.4
• /
• pp.232-243
• /
• 2002

There are many methods for improving TLB (translation lookaside buffer) performance, such as increasing the number of entry in TLB, supporting large page or multiple page sizes. The best way is to support multiple page sizes, but any operating system doesn't support multiple page sizes in user mode. So, we propose the new structure of TLB supporting two pages to obtain the effect of multiple page sizes with high performance and at low cost without operating system support. we propose a new TLB structure supporting two page sizes dynamically and selectively for high performance and low cost design without any operating system support. For high performance, a promotion-TLB is designed by supporting two page sizes. Also in order to attain low power consumption, a banked-TLB is constructed by dividing one fully associative TLB space into two sub-fully associative TLBs. These two banked-TLB structures are integrated into a banked-promotion TLB as a low power and high performance TLB structure for embedded processors. According to the results of comparison and analysis, a similar performance can be achieved by using fewer TLB entries and also power consumption can be reduced by around 50% comparing with the fully associative TLB.