• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.53-58
• /
• 2005

In this study, we will employ a multi-agent for the search and extraction of data in a distributed environment. We will use an Integrator Agent in the proposed model on the Hierarchical Clustering and Association Rule Discovery(HCARD). The HCARD will address the inadequacy of other data mining tools in processing performance and efficiency when use for knowledge discovery. The Integrator Agent was developed based on CORBA architecture for search and extraction of data from heterogeneous servers in the distributed environment. Our experiment shows that the HCARD generated essential association rules which can be practically explained for decision making purposes. Shorter processing time had been noted in computing for clusters using the HCARD and implying ideal processing period than computing the rules without HCARD.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.328-333
• /
• 2017

Mobile game apps, which are popular in various mobile devices, tend to be power-hungry and rapidly drain the device's battery. Since a long battery lifetime is a key design requirement of mobile devices, reducing the power consumption of mobile game apps has become an important research topic. In this paper, we investigate the power consumption characteristics of popular mobile games with multiple threads, focusing on the inter-thread. From our power measurement study of popular mobile game apps, we observed that some of these apps have abnormally high-load threads that barely affect the user's gaming experience, despite the high energy consumption. In order to reduce the wasted power from these abnormal threads, we propose a novel technique that detects such abnormal threads during run time and reduces their power consumption without degrading user experience. Our experimental results on an Android smartphone show that the proposed technique can reduce the energy consumption of mobile game apps by up to 58% without any negative impact on the user's gaming experience.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.1
• /
• pp.27-35
• /
• 2013

This paper proposes a face tracking algorithm for a viewpoint adaptive multi-view synthesis system. The original scene captured by a depth camera contains a texture image and 8 bit gray-scale depth map. From this original image, multi-view images that correspond to the viewer's position can be synthesized using geometrical transformations, such as rotation and translation. The proposed face tracking technique gives a motion parallax cue by different viewpoints and view angles. In the proposed algorithm, the viewer's dominant face, which is established initially from a camera, can be tracked using the statistical characteristics of face colors and deformable templates. As a result, a motion parallax cue can be provided by detecting the viewer's dominant face area and tracking it, even under a heterogeneous background, and synthesized sequences can be displayed successfully.

• International Journal of Advanced Culture Technology
• /
• v.9 no.3
• /
• pp.321-326
• /
• 2021

In a multi-cloud environment, it is necessary to minimize physical movement for efficient interoperability of distributed source data without building a data warehouse or data lake. And there is a need for a data platform that can easily access data anywhere in a multi-cloud environment. In this paper, we propose a new platform based on data fabric centered on a distributed platform suitable for cloud environments that overcomes the limitations of legacy systems. This platform applies the knowledge graph database technique to the physical linkage of source data for interoperability of distributed data. And by integrating all data into one scalable platform in a multi-cloud environment, it uses the holochain technique so that companies can easily access and move data with security and authority guaranteed regardless of where the data is stored. The knowledge graph database mitigates the problem of heterogeneous conflicts of data interoperability in a decentralized environment, and Holochain accelerates the memory and security processing process on traditional blockchains. In this way, data access and sharing of more distributed data interoperability becomes flexible, and metadata matching flexibility is effectively handled.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1151-1161
• /
• 1998

In this paper, we are considering a heterogeneous processor system in which each processor may have different performance and reliability characteristics. In other to fully utilize this diversity of processing power it is advantageous to assign the program modules of a distributed program to the processors in such a way that the execution time of the entire program is minimized. This assignment of tasks to processors to maximize performance is commonly called load balancing, since the overloaded processors can perform their own processing with the performance degradation. For the task assignment problem, we propose a new objective function which formulates this imbalancing cost. Thus the task assignment problem is to be carried out so that each module is assigned to a processor whose capabilities are most appropriate for the module, and the total cost is minimized that sum of inter-processor communication cost and execution cost and imbalance cost of the assignment. To find optimal assignment is known to be NP-hard, and thus we proposed an efficient heuristic algorithm with time complexity $O(n^2m)$ in case of m task modules and n processors.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.91-96
• /
• 2009

In this paper, interoperability in heterogeneous wireless mesh network, and mesh nodes for providing efficient IP mobility technique offers multi-hop ARP. Heterogeneous wireless mesh networks to MANETs based on a wireless mesh network backbone and non-MANET architecture is based on a client wireless mesh network and the two mobile networks, combined with a hybrid wireless mesh network are separate. In two different hybrid wireless mesh network routing protocols used to connect the two protocols in the protocol conversion at the gateway to parallel processing problems seriously overload occurs. All of the network reliability and stability are factors that reduce. Therefore, for efficient integration with L3 routing protocols, design techniques to build ARP multi-hop go through the experiment to increase the number of mesh nodes, the packet forwarding rate and an increased hop number of the node was to ensure reliability and stability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.93-96
• /
• 2003

화상회의 시스템에서 대역폭의 이용률을 높이기 위한 연구로서 SARLM(Source Adaptive Receiver-Driven Multi-Layered Multicast)이 있다. 이 기법은 레이어의 병합(merging)과 분할(splitting)을 통해 새로운 레이어(layer)의 수와 각 레이어의 전송률을 결정하는데, 레이어의 병합 시 전체 수신자의 가용 대역폭(available bandwidth)의 이용률이 낮아지는 현상이 발생한다. 본 논문에서는 레이어의 병합 시 수신자의 가용 대역폭의 이용률을 개선한 기법을 제안한다. 제안하는 기법은 특정 레이어를 수신하는 수신자가 아주 적은 경우 하위 레이어의 수신자중 전송률의 많은 증가를 요청하는 수신자와 병합하고, 하위 레이어를 재그룹핑(regrouping) 한다. 실험 결과, 레이어의 병합 시 전체 수신자의 대역폭 이용률을 향상시킬 수 있었다.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2003.11a
• /
• pp.719-722
• /
• 2003

This paper presents the development of reservoir characterization model equipped with parallelized genetic algorithm, and its application for a heterogeneous reservoir system with integration of the well data and multi-phase production data. A parallel processing method performed by PC-cluster was applied to the developed model in order to reduce time for an inverse calculation. By utilizing the developed model, we performed the inverse calculation with the production data obtained from three layered reservoir system to estimate porosity and permeability distribution. As a result, the pressures observed at well almost identical to those calculated by the developed model. Also, it was confirmed that parallel processing could be applied for reservoir characterization study efficiently.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.119-122
• /
• 2012

이종 멀티코어 프로세서는 각기 상이한 마이크로아키텍처, 캐시 사이즈, 클록 주파수를 갖는 다수의 코어 또는 프로세싱 유닛으로 이루어진 마이크로프로세서이다. 저에너지 소비가 산업계의 키워드로 부상하고 있는 이 시기에 이종 멀티코어는 동종 멀티코어보다 더 낮은 전력을 소비하고 성능면에서도 더 나은 프로세서로 주목받고 있다. 하지만, 동종 멀티코어에서의 동작을 가정하는 현재의 운영체제의 작업 스케줄러로는 이종 멀티코어의 이종적인 특성을 잘 활용할 수 없다. 본 논문에서는 이종 멀티코어 프로세서 작업 스케줄링에 관한 연구를 다면적으로 분석하여 각 방법의 장점과 단점을 개략적으로 정리하고 관련된 이슈들을 살펴보고자 한다.