Korean | English

pISSN : 1598-849X / eISSN : 2383-9945

2020 KCI Impact Factor : 0.4
Home > Explore Content > All Issues > Article List

2012, Vol.17, No.6

  • 1.

    nalysis on the Performance and Temperature of the 3D Quad-core Processor according to Cache Organization

    손동오 | 안진우 | 최홍준 and 2other persons | 2012, 17(6) | pp.1~11 | number of Cited : 0
    Abstract PDF
    As the process technology scales down, multi-core processors cause serious problems such as increased interconnection delay, high power consumption and thermal problems. To solve the problems in 2D multi-core processors, researchers have focused on the 3D multi-core processor architecture. Compared to the 2D multi-core processor, the 3D multi-core processor decreases interconnection delay by reducing wire length significantly, since each core on different layers is connected using vertical through-silicon via(TSV). However, the power density in the 3D multi-core processor is increased dramatically compared to that in the 2D multi-core processor, because multiple cores are stacked vertically. Unfortunately, increased power density causes thermal problems, resulting in high cooling cost, negative impact on the reliability. Therefore, temperature should be considered together with performance in designing 3D multi-core processors. In this work, we analyze the temperature of the cache in quad-core processors varying cache organization. Then, we propose the low-temperature cache organization to overcome the thermal problems. Our evaluation shows that peak temperature of the instruction cache is lower than threshold. The peak temperature of the data cache is higher than threshold when the cache is composed of many ways. According to the results, our proposed cache organization not only efficiently reduces the peak temperature but also reduces the performance degradation for 3D quad-core processors.
  • 2.

    Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem

    Hwang Junha | 2012, 17(6) | pp.13~27 | number of Cited : 4
    Abstract PDF
    Integer programming-based local search(IPbLS) is a kind of local search based on simple hill-climbing search and adopts integer programming for neighbor generation unlike general local search. According to an existing research [1], IPbLS is known as an effective method for the multidimensional knapsack problem(MKP) which has received wide attention in operations research and artificial intelligence area. However, the existing research has a shortcoming that it verified the superiority of IPbLS targeting only largest-scale problems among MKP test problems in the OR-Library. In this paper, I verify the superiority of IPbLS more objectively by applying it to other problems. In addition, unlike the existing IPbLS that combines simple hill-climbing search and integer programming, I propose methods combining other local search algorithms like hill-climbing search, tabu search, simulated annealing with integer programming. Through the experimental results, I confirmed that IPbLS shows comparable or better performance than the best known heuristic search also for mid or small-scale MKP test problems.
  • 3.

    Human Skin Region Detection Utilizing Depth Information

    Jang Seok-Woo | 박영재 | Gyeyoung Kim | 2012, 17(6) | pp.29~36 | number of Cited : 2
    Abstract PDF
    In this paper, we suggest a new method of detecting human skin-color regions from three-dimensional static or dynamic stereoscopic images by effectively integrating depth and color features. The suggested method first extracts depth information that represents the distance between a camera and an object from input left and right stereoscopic images through a stereo matching technique. It then performs labeling for pixels with similar depth features and determines the labeled regions having human skin color as actual skin color regions. Our experimental results show that the suggested skin region extraction method outperforms existing skin detection methods in terms of skin-color region extraction accuracy.
  • 4.

    Multi-sensor Image Registration Using Normalized Mutual Information and Gradient Orientation

    주재용 | Min-Jae Kim | Bonhwa Ku and 1other persons | 2012, 17(6) | pp.37~48 | number of Cited : 2
    Abstract PDF
    Image registration is a process to establish the spatial correspondence between the images of same scene, which are acquired at different view points, at different times, or by different sensors. In this paper, we propose an effective registration method for images acquired by multi-sensors, such as EO (electro-optic) and IR (infrared) sensors. Image registration is achieved by extracting features and finding the correspondence between features in each input images. In the recent research, the multi-sensor image registration method that finds corresponding features by exploiting NMI (Normalized Mutual Information) was proposed. Conventional NMI-based image registration methods assume that the statistical correlation between two images should be global, however images from EO and IR sensors often cannot satisfy this assumption. Therefore the registration performance of conventional method may not be sufficient for some practical applications because of the low accuracy of corresponding feature points. The proposed method improves the accuracy of corresponding feature points by combining the gradient orientation as spatial information along with NMI attributes and provides more accurate and robust registration performance. Representative experimental results prove the effectiveness of the proposed method.
  • 5.

    Pacman Game Using Skin Color Extraction and Center of Gravity of Hand

    SeongYoon Shin | 2012, 17(6) | pp.49~55 | number of Cited : 0
    Abstract PDF
    Pacman is one of the world-famous and have been chosen game in the game room at the arcade. In this paper, pacman game gives you the ability to perform by simple hand movement alone. First, we obtain binary RGB image to extract skin color, and convert into binary image YCbCr by minus the luminance in this image. Next, we extract the hand region by the product of an binary RGB image and binary YCbCr image. Finally, the hand region, we obtain the center of gravity by the minimum bounding rectangle and the center of the hand pixel area, and we used to obtain the center of the hand area with an average of two center of gravity. In other words, we presented the game of motion that can take the place of arrow key by using the center coordinates of hand. In addition, these experiments showed the average movement and error rate, and cause of the error type was also investigated.
  • 6.

    A Resource Allocation Method for Supporting Multiple Sessions in a Mobile Terminal during Handover

    Lee Moonho | Jongchan Lee | 2012, 17(6) | pp.57~66 | number of Cited : 0
    Abstract PDF
    LTE-Advanced network will form the high-speed IP backbone in collaboration with heterogeneous radio access networks for dynamic optimized resource utilization. In order to implement more innovative and attractive services such as U-Cloud streaming, LBS and mobile smart TV, a mobile terminal needs to support multiple sessions simultaneously. Efficient resource allocation schemes are necessary to maintain QoS of multiple sessions because service continuity may be defected by delay and information loss during handover. This paper proposes a resource allocation scheme to accommodate multiple sessions in a mobile terminal on handover period based on session priority mechanism. Simulation is focused on the forced termination probability of handover sessions. Simulation results show that our proposed method provides a better performance than the conventional method.
  • 7.

    A Distributed Conference Architecture with a New Load Control Method

    Jang,Choon-Seo | 2012, 17(6) | pp.67~73 | number of Cited : 1
    Abstract PDF
    A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.
  • 8.

    LSU Message Count Controlled Link State Update Algorithm in QoS Routing

    조강홍 | 김남훈 | 2012, 17(6) | pp.75~81 | number of Cited : 0
    Abstract PDF
    This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link , it thus appears that we have verified the performance of this algorithm.
  • 9.

    Multi-Level Groupings of Minterms Using the Decimal-Valued Matrix Method

    Eungi Kim | 2012, 17(6) | pp.83~92 | number of Cited : 0
    Abstract PDF
    This paper suggests an improved method of grouping minterms based on the Decimal-Valued Matrix (DVM) method. The DVM is a novel approach to Boolean logic minimization method which was recently developed by this author. Using the minterm-based matrix layout, the method captures binary number based minterm differences in decimal number form. As a result, combinable minterms can be visually identified. Furthermore, they can be systematically processed in finding a minimized Boolean expression. Although this new matrix based approach is visual-based, the suggested method in symmetric grouping cell values can become rather messy in some cases. To alleviate this problem, the enhanced DVM method that is based on multi-level groupings of combinable minterms is presented in this paper. Overall, since the method described here provides a concise visualization of minterm groupings, it facilitates a user with more options to explore different combinable minterm groups for a given Boolean logic minimization problem.
  • 10.

    A Linear Time Algorithm for Constructing a Sharable-Bandwidth Tree in Public-shared Network

    Kyun Rak Chong | 2012, 17(6) | pp.93~100 | number of Cited : 1
    Abstract PDF
    In this paper we have proposed a linear time algorithm for solving the minimum sharable-bandwidth tree construction problem. The public-shared network is a user generated infrastructure on which a user can access the Internet and transfer data from any place via access points with sharable bandwidth. Recently, the idea of constructing the SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients on public-shared network, a tree structure is constructed. The problem of constructing a tree structure to serve the video streaming requests by using minimum amount of sharable bandwidth has been shown to be NP-hard. The previously published algorithms for solving this problem are either unable to find solutions frequently or less efficient. The experimental results showed that our algorithm is excellent both in the success rate of finding solutions and in the quality of solutions.
  • 11.

    An Quality Management Effort Estimation Model Based on Defect Filtering Concept

    Sang-Un, Lee | 2012, 17(6) | pp.101~109 | number of Cited : 0
    Abstract PDF
    To develop high quality software, quality control plan is required about fault correction that is latent within software. We should describe fault correction profile properly for this. The tank and pipe model performs complex processes to calculate fault that is remove and escapes. Also, we have to know in which phase the faults were inserted, removed and escaped and know the fault detection rate at any phases. To simplify such complex process, this paper presented model to fault filtering concept. Presented model has advantage that can describe fault more shortly because need not to consider whether was involved in fault that escaped fault is inserted at any step at free step. Also, presented effort estimating model that do fetters in function of fault removal quality and productivity measure and is required in fault detection.
  • 12.

    A Malicious Bot Curing Technique Using DHCP

    Kim Hong Yoon | 2012, 17(6) | pp.111~118 | number of Cited : 0
    Abstract PDF
    In this paper, a technique wherein the DHCP server has a restriction in providing the IP address to the computers that has no malicious bot curing vaccine is proposed, so that users will cooperate in the curing of malicious bot to avoid inconvenience. In order to provide restricted ip address periodically, the DHCP server makes a request of vaccine installation check for user’s computer. Proposed technique is effective in the curing of malicious bot, because it does not depend on specific systems or organizations.
  • 13.

    A Study on Ubiquitous Tree Management System based on GIS and Smart-Phone for Efficiency of Arboreal Growth Management

    정세훈 | ChunBo Sim | 2012, 17(6) | pp.119~130 | number of Cited : 3
    Abstract PDF
    In this paper, we propose ubiquitous tree management system based on GIS and smart-phone using the object-oriented design modeling to maximize the efficiency of tree management. For this, proposed system is implemented in the form of client/server (C/S). The spot tree management system as the client is based on the mobile(PDA, Smart-Phone), whereas the tree management system based on PC as the server makes use of GIS. Also, Web service method instead of CDMA used in exist studies is used for tree data communication among C/S. And problems of existing studies, that is excessive maintenance costs, accessibility shortage of variety users, connectivity shortage of geographic information system will be settled through the convergence of the proposed system development methods, GIS system, smart devices. Therefore, we verify proposed system by using the systemic unit test and qualitative assessment respectively and prove to be more excellent than the existing system based on the mobile, in terms of systemic effectiveness and extendability.
  • 14.

    A Transformation Technique of PIM to PSM based on UML Profiles for Mobile Applications

    Yun-seok Choi | 2012, 17(6) | pp.131~144 | number of Cited : 1
    Abstract PDF
    MDD is suitable to satisfy constraints of development of mobile applications. So, there are various studies about applying MDD to the developments of mobile application but systematic development methods about UML profile for PIM/PSM of mobile applications and model transformation techniques are needed. This paper suggests that a development technique about UML profile for PIM/PSM of mobile applications and a model transformation techniques with the profiles. We classify stereotypes by the characteristics of mobile application to compose profiles and suggest development guidelines of profiles for PIM/PSM. On the suggested model transformation process, the PIM with the profiles is transformed to the intial PSM with the mapping rules and the PSM is transformed to the refined PSM with templates which reflected detailed information of a mobile platform. We developed a location based service mobile application with the suggested techniques on the Android platform and compared with other techniques to validate usefulness of the suggested techniques.
  • 15.

    Fast Distributed Network File System using State Transition Model in the Media Streaming System

    우순 | 이준표 | 2012, 17(6) | pp.145~152 | number of Cited : 0
    Abstract PDF
    Due to the large sizes of streaming media, previous delivery techniques are not providing optimal performance. For this purpose, video proxy server is employed for reducing the bandwidth consumption, network congestion, and network traffic. This paper proposes a fast distributed network file system using state transition model in the media streaming system for efficient utilization of video proxy server. The proposed method is composed of three steps: step 1. Training process using state transition model, step 2. base and decision probability generation, and step 3. storing and deletion based on probability. In addition, storage space of video proxy server is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, the proposed method provides the lowest user start-up latency and the highest bandwidth saving significantly.
  • 16.

    Relevance of the Cyclomatic Complexity Threshold for the Web Programming

    Kim, JeeHyun | 2012, 17(6) | pp.153~161 | number of Cited : 1
    Abstract PDF
    In this empirical study at the Web environment based on the frequency distribution of the cyclomatic complexity number of the application, the relevance of the threshold has been analyzed with the next two assumptions. The upper bound established by McCabe in the procedural programming equals 10 and the upper bound established by Lopez in the Java programming equals 5. Which numerical value can be adapted to Web application contexts? In order to answer this 10 web site projects have been collected and a sample of more than 4,000 ASP files has been measured. After analyzing the frequency distribution of the cyclomatic complexity of the Web application, experiment result is that more than 90% of Web application have a complexity less than 50 and also 50 is proposed as threshold of Web application. Web application has the complex architecture with Server, Client and HTML, and the HTML side has the high complexity 35~40. The reason of high complexity is that HTML program is usually made of menu type for home page or site map, and the relevance of that has been explained. In the near future we need to find out if there exist some hidden properties of the Web application architecture related to complexity.
  • 17.

    Development of Personalized Recommendation System using RFM method and k-means Clustering

    조영성 | 구미숙 | RYU KEUN HO | 2012, 17(6) | pp.163~172 | number of Cited : 5
    Abstract PDF
    Collaborative filtering which is used explicit method in a existing recommedation system, can not only reflect exact attributes of item but also still has the problem of sparsity and scalability, though it has been practically used to improve these defects. This paper proposes the personalized recommendation system using RFM method and k-means clustering in u-commerce which is required by real time accessablity and agility. In this paper, using a implicit method which is is not used complicated query processing of the request and the response for rating, it is necessary for us to keep the analysis of RFM method and k-means clustering to be able to reflect attributes of the item in order to find the items with high purchasablity. The proposed makes the task of clustering to apply the variable of featured vector for the customer's information and calculating of the preference by each item category based on purchase history data, is able to recommend the items with efficiency. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.
  • 18.

    FingerPrint building method using Splite-tree based on Indoor Environment

    신숭선 | Gyoung-Bae Kim | HaeYoung Bae | 2012, 17(6) | pp.173~182 | number of Cited : 3
    Abstract PDF
    A recent advance in smart phones is increasing utilization of location information. Existing positioning system was using GPS location for positioning. However, the GPS cannot be used indoors, if GPS location has an incorrectly problem. In order to solve indoor positioning problems of indoor location-based positioning techniques have been investigated. There are a variety of techniques based on indoor positioning techniques like as RFID, UWB, WLAN, etc. But WLAN location positioning techniques take advantage the bond in real life. WLAN indoor positioning techniques have a two kind of method that is centroid and fingerprint method. Among them, the fingerprint technique is commonly used because of the high accuracy. In order to use fingerprinting techniques make a WLAN signal map building that is need to lot of resource. In this paper, we try to solve this problem in an Indoor environment for WLAN-based fingerprint of a virtual building technique, which is proposed. Proposed technique is classified Cell environment in existed Indoor environment, all of fingerprint points are shown virtual grid map in each Cell. Its method can make fingerprint grid map very quickly using estimate virtual signal value. Also built signal value can take different value depending of the real estimate value. To solve this problem using a calibration technique for the Splite-tree is proposed. Through calibration technique that improves the accuracy for short period of time. It also is improved overall accuracy using predicted value of around position in cell.
  • 19.

    A Design on Security Model of Domestic Internet-based Broadcasting Service

    Hee-Suk Seo | 김성준 | Ahn Woo-Young | 2012, 17(6) | pp.183~190 | number of Cited : 0
    Abstract PDF
    Internet Protocol Television(IPTV) is the use of an IP broadband network to deliver television (cable TV type) services to the end user. Traditional telecommunications service providers as well as alternate service providers and Internet service providers can utilize their IP networks (and broadband consumer access) to deliver broadcast TV, Video on Demand (VOD) and other Internet services to the consumer. As digital technologies progress, illegal copy and redistribution of IPTV content become easier and simpler. Therefore it is required to protect IPTV content or service. In this paper, we analyze the security threats and requirements. We also discuss related issues and solutions for IPTV.
  • 20.

    A Study of the Effectiveness of IT Asset Management Through Application of Balanced Scorecard in the Public Organizations

    Choi.Jun-Hyeog | Kim, Hyung-Jin | 2012, 17(6) | pp.191~199 | number of Cited : 0
    Abstract PDF
    By the way, in light of the knowledge, even public institutions are paying much attention to the management of IT assets for achieving organizational goals. Recently, some public institutions adopt balanced scorecard for enhancing efficiency in operations and management of total administrations. To be interested, some key performance indicators(KPI) of the balanced scorecard reflect the three aspects of IT assets and their possible outcomes. The main focus of this study is to investigate whether there is positive effects of IT asset management through balanced scorecard at public institutions. Specifically, we selected and classified KPIs into different categories depending on three aspects of IT assets, internal process change, and organizational outcomes. To address relationships of KPIs among the categories, we specified each category and developed as a variable respectively. A middle-sized city provided us with 138 KPIs for the development of scales.
  • 21.

    Factors Determining the Quality of Life of Elders Using the Health Town

    Lee Hyoung Ha | 2012, 17(6) | pp.201~209 | number of Cited : 2
    Abstract PDF
    This study was conducted in order to empirically analyze factors affecting the quality of life in the elder resulting from the use of elderly leisure facilities in the community. For this purpose, we surveyed the elder using the senior health town of Gwang-ju Metropolitan City to see whether the quality of life in the elder is influenced by factors such as facilities' environment within the health town, the capacity for the staff and instructors, and the elders’ satisfaction with programs. The results of this study are expected to provide practical solutions for enhancing the quality of life in senior users. The survey was performed with 1,038 elders aged over 60 who were using the senior health town of Gwang-ju Metropolitan City by using a self‐administered questionnaire and being interviewed with surveyors. The period of the survey was from the 10th to 15th of December, 2010. According to the results of this study, variables affecting the elders’ quality of life were academic qualification (B=‐.074, p<0.05), instructors satisfaction (B=.172, p<0.001), staff satisfaction (B=.104, p<0.01), and facilities and environment satisfaction (B=.217, p<0.001). That is, the lower academic background they have, the higher instructors', staff's, facilities and environment's satisfaction are, the quality of life in the elder was positively affected. In particular, facilities and environment's satisfaction show a relatively high effect and this suggests the necessity to modernize cultural and leisurely facilities in community for senior citizens and create pleasant environment in order to improve the quality of life in the elder.