• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.71-78
• /
• 2013

In this study, software products developed in the course of testing, software managers in the process of testing software test and test tools for effective learning effects perspective has been studied using the NHPP software. The doubly bounded power law distribution model makeup Weibull distribution applied to distribution was based on finite failure NHPP. Software error detection techniques known in advance, but influencing factors for considering the errors found automatically and learning factors, by prior experience, to find precisely the error factor setting up the testing manager are presented comparing the problem. As a result, the learning factor is greater than automatic error that is generally efficient model could be confirmed. This paper, a numerical example of applying using time between failures and parameter estimation using maximum likelihood estimation method, after the efficiency of the data through trend analysis model selection were efficient using the mean square error and $R^2$.

• Convergence Security Journal
• /
• v.12 no.3
• /
• pp.19-26
• /
• 2012

In this study, software products developed in the course of testing, software managers in the process of testing software and tools for effective learning effects perspective has been studied using the NHPP software. The log type hazard function applied to distribution was based on finite failure NHPP. Software error detection techniques known in advance, but influencing factors for considering the errors found automatically and learning factors, by prior experience, to find precisely the error factor setting up the testing manager are presented comparing the problem. As a result, the learning factor is greater than autonomous errors-detected factor that is generally efficient model could be confirmed. This paper, a failure data analysis of applying using time between failures and parameter estimation using maximum likelihood estimation method, after the efficiency of the data through trend analysis model selection were efficient using the mean square error and $R^2$(coefficient of determination).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.480-488
• /
• 2009

A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the number of nodes entering into/leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.73-86
• /
• 2008

Because of its capability of automatic identification of objects, RFID(Radio Frequency Identification) technologies have extended their application areas to logistics, healthcare, and food management system. Load balancing is a basic technique for improving scalability of systems by moving loads of overloaded middlewares to under loaded ones. Adaptive load balancing has been known to be effective for distributed systems of a large load variance under unpredictable situations. There are needs for applying load balancing to RFID middlewares because they must efficiently treat vast numbers of RFID tags which are collected from multiple RFID readers. Because there can be a large amount of variance in loads of RFID middlewares which are difficult to predict, it is desirable to consider adaptive load balancing approach for RFID middlewares, which can dynamically choose a proper load balancing strategy depending on the current load. This paper proposes an adaptive load balancing approach for RFID middlewares and presents its design and implementation. First we decide a performance model by a experiment with a real RFID middleware. Then, a set of proper load balancing strategies for high/medium/low system loads is determined from a simulation of various load balancing strategies based on the performance model.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.8
• /
• pp.197-210
• /
• 2016

Lately smartphone uasage is increasing and many Internet of Things (IoT) devices support wireless communications. Accordingly, small base stations which called femtocells are supplied to prevent saturation of existing base stations. However, unlike the original purpose of the femtocell with the advanced hacking technologies, Vulnerability such as gaining the administrator authority was discovered and this can cause serious problems such as the leakage of personal information of femtocell user. Therefore, identify security threats that may occur in the femtocell and it is necessary to ways for systematic vulnerability analysis. In this paper, We analyzed the security threats that can be generated in the femtocell and constructed a checklist for vulnerability analysis using the Threat Modeling method. Then, using the constructed checklist provides a scheme that can improve the safety of the femto cell through the actual analysis and taken the results of the femtocell vulnerabilities analysis.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.639-650
• /
• 2002

We have to carry out systematic, definite requirements analysis for the successful development of software. The UML gives the ways to grasp user or customer requirements and decide the boundary of business systems from the use case modeling. This paper presents how to extract use case diagram from the requirements specification systematically by applying the standardized rules as a part of the study for use case modeling. We modify requirements specification by applying $R_{RS}$ (Rules for Requirements Specification) and extract actor, use case, relationship by applying $R_{A}$(Rules for Actors), $R_{U}$(Rules for Use Cases) and $R_{R}$(Rules for Relationships) to the modified requirements specification separately and then become to make out use case diagram in the end. By applying the rules presented in this paper to the requirements specification for personnel management, we can reduce the existing difficulties of extracting use case diagram based on the narrative descriptions without any standardized rules.rules.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.717-726
• /
• 2003

In this paper, we analyze the associated rule based deductive algorithm which creates the rules automatically for intrusion detection from the vast packet data. Based on the result, we also suggest the deductive algorithm which creates the rules of intrusion pattern fast in order to apply the intrusion detection systems. The deductive algorithm proposed is designed suitable to the concept of clustering which classifies and deletes the large data. This algorithm has direct relation with the method of pattern generation and analyzing module of the intrusion detection system. This can also extend the appication range and increase the detection speed of exiting intrusion detection system as the rule database is constructed for the pattern management of the intrusion detection system. The proposed pattern generation technique of the deductive algorithm is used to the algorithm is used to the algorithm which can be changed by the supporting rate of the data created from the intrusion detection system. Fanally, we analyze the possibility of the speed improvement of the rule generation with the algorithm simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.177-185
• /
• 2005

NAND-type flash memory is becoming increasingly popular as a large data storage for mobile computing devices. Since flash memory is an order of magnitude more expensive than magnetic disks, data compression can be effectively used in managing flash memory based storage systems. However, compressed data management in NAND-type flash memory is challenging because it supports only page-based I/Os. For example, when the size of compressed data is smaller than the page size. internal fragmentation occurs and this degrades the effectiveness of compression seriously. In this paper, we present an efficient flash compression layer (FCL) for NAND-type flash memory which stores several small compressed pages into one physical page by using a write buffer Based on prototype implementation and simulation studies, we show that the proposed scheme offers the storage of flash memory more than $140\%$ of its original size and expands the write bandwidth significantly.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.879-879
• /
• 2012

강우현상의 공간적 변동성에 대한 해석은 수자원 계획 및 관리를 위해 중요한 관심사가 되고 있다. 일반적으로 우리가 얻을 수 있는 강우자료는 한 지점에 설치되어 있는 우량계에 의한 관측된 지점강우량자료이다. 기존의 집중형 수문모형이 유출과정의 공간적인 분포 및 변화를 유역단위로 평균화해서 취급하는 개념기반의 모형임에 반해서 분포형 수문모형은 유역을 수문학적으로 균일한 매개변수를 갖는 소유역 또는 격자망으로 구분하여 적용하는 것으로, 도시화 등 토지이용의 변화나 기타 유역내의 물리적인 특성의 변화가 수문과정에 미치는 영향을 잘 모의할 수 있다. 따라서 본 연구에서는 Vflo$^{TM}$ 분포형 강우-유출 모형과 IDW, Ordinary Kriging, Thiessen 등의 강우 분포 기법을 이용하여 낙동강 제 1지류인 금호강의 동촌 수위관측소 유역($1,544km^2$)을 출구로 하여 강우-유출모의를 하였다. 이를 위하여 강우-유출에 영향을 주는 매개변수를 선정하고 동촌 수위관측소의 실측 유량자료를 바탕으로 하여 IDW, Kriging, Thiessen 등의 면적강우량 산정방법별로 모형의 보정(2007, 2009) 및 검증(2010)을 실시하였다. 모의 된 유출량과 실측유량의 상관성은 결정계수 $R^2$에서 IDW 과 Kriging의 경우 0.95 ~ 0.99의 상관성을 나타냈으며 Thiessen 의 경우 0.94 ~ 0.99의 값을 나타냈다. Nash-Sutcliffe 모형효율은 IDW의 경우 0.95 ~ 0.98, Kriging의 경우 0.94 ~ 0.99를 나타냈으며 Thiessen의 경우는 0.90 ~ 0.98의 모형효율을 나타내었다. 이때 포화투수계수와 조도계수가 전체 유량과 첨두시간에 영향을 주었다. 호우사상을 선정하여 검보정을 실시 한 결과, 유역의 유출 모의를 수행하였을 때 선행강우량에 따라서 토양의 침투능에 영향을 많이 주고 있기 때문에, 선행 토양함수조건(Antecedent Moisture Condition: AMC)으로 분류한 뒤에 AMC 조건에 따라서 유출-모의를 수행하는 것이 타당하다고 판단된다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.525-533
• /
• 2009

Staging technique is used to provide files for a job in the Grid. If a staged file has large volume, the start time of the job is delayed and the throughput of job in the Grid may decrease. Therefore, removal of staging overhead helps the Grid operate more efficiently. In this paper, we present two methods for efficient file provisioning to clear the overhead. First, we propose RA-RFT, which extends RFT of Globus Toolkit and enables it to utilize RLS with replica information. RA-RFT can reduce file transfer time by doing partial transfer for each replica in parallel. Second, we suggest Remote Link that uses remote I/O instead of file transfer. Remote link is able to save storage of computational nodes and enables fast file provisioning via prefetching. Through various experiments, we argue that our two methods have an advantage over existing staging techniques.