• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.265-278
• /
• 2011

The objective of this paper is to analyze and characterize end-to-end packet statistics after modeling and simulation of WiFi (IEEE 802.11g) and WiMAX (IEEE 802.16e) of a virtual wireless network using OPNET Modeler Wireless Suite. Wireless internal and external network simulators such as Remcom's Wireless InSite Real Time (RT) module, WinProp: W-LAN/Fixed WiMAX/Mobile WiMAX, and SMI system, are designed to consider data transfer rate based on wireless propagation signal strength. However, we approached our research in a different perspective without support for characteristic of these wireless network simulators. That is, we will discuss the purpose of a visual analysis for these packets, how to receive each point packets (e.g., wireless user, base station or access point, and http server) through end-to-end virtual network modeling based on integrated wired and wireless network without wireless propagation signal strength. Measuring packet statistics is important in QoS metric analysis among wireless network performance metrics. Clear packet statistics is an especially essential metric in guaranteeing QoS for WiMAX users. We have found some interesting results through modeling and simulation for virtual wireless network using OPNET Modeler Wireless Suite. We are also able to analyze multi-view efficiency through experiment/observation result.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.347-356
• /
• 2007

In designing a branch predictor, in addition to accuracy, microarchitects should consider power consumption, especially for embedded processors. This paper proposes a power-aware branch predictor, which is based on the gshare predictor, by accessing the BTB (Branch Target Buffer) only when the prediction from the PHT (Pattern History Table) is taken. To enable the selective access to the BTB, the PHT in the proposed branch predictor is accessed one cycle earlier than the traditional PHT to prevent the additional delay. As a side effect, two predictions from the PHT are obtained through one access to the PHT, which leads to more power savings. The proposed branch predictor reduces the power consumption, not requiring any additional storage arrays, not incurring additional delay (except just one MUX delay) and never harming accuracy. Simulation results show that the proposed predictor reduces the power consumption by $35{\sim}48%$ compared to the traditional predictor.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.371-382
• /
• 2007

Modern server systems are usually composed in the form of cluster systems in order to serve not only as many users but also as many kinds of applications as possible. The progression of the cluster system architecture leads in a middleware approach based on the Java framework. The middleware approach alleviates the efforts for the construction and the management of a server system but still preserves its performance and applications on the server. In this research, we introduce a new clustering scheme for the easy construction and maintenance of a cluster server system with the Java Management Extensions. We first demonstrate the construction and configuration process. Our experiment sets can verify that it is easy to construct, expand and manage a middleware based cluster system as well as the applications which reside on it. In addition, we can achieve reasonable performance on our service oriented clustered system with the help of state-of-the-art middleware. The experimental results of performance demonstration contain the availability of a server, and the effectiveness of load balancing and scheduling mechanisms. Especially, our service oriented scheduling mechanism was shown to successfully manage load imbalance under the normal load and cope with the overloaded situations, compared with other known scheduling mechanisms.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.197-206
• /
• 2010

High-quality and low-price digital printing devices are nowadays abused to print or forge official documents and bills. Identifying color laser printers will be a step for media forensics. This paper presents a new method to identify color laser printers with printed color images. Since different printer companies use different manufactural systems, printed documents from different printers have little difference in visual. Analyzing this artifact, we can identify the color laser printers. First, high-frequency components of images are extracted from original images with discrete wavelet transform. After calculating the gray-level co-occurrence matrix of the components, we extract some statistical features. Then, these features are applied to train and classify the support vector machine for identifying the color laser printer. In the experiment, total 2,597 images of 7 printers (HP, Canon, Xerox DCC400, Xerox DCC450, Xerox DCC5560, Xerox DCC6540, Konica), are tested to classify the color laser printer. The results prove that the presented identification method performs well with 96.9% accuracy.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.465-472
• /
• 2015

We propose a novel plane detection in disparity space and evaluate its performance. Our method simplifies and makes scenes in disparity space easily dealt with by approximating various surfaces as planes. Moreover, the approximated planes can be represented in the same size as in the real world, and can be employed for obstacle detection and camera pose estimation. Using a stereo matching technique, our method first creates a disparity image which consists of binocular disparity values at xy-coordinates in the image. Slants of disparity values are estimated by exploiting a line simplification algorithm which allows our method to reflect global changes against x or y axis. According to pairs of x and y slants, we label the disparity image. 4-connected disparities with the same label are grouped, on which least squared model estimates plane parameters. N plane models with the largest group of disparity values which satisfy their plane parameters are chosen. We quantitatively and qualitatively evaluate our plane detection. The result shows 97.9%와 86.6% of quality in our experiment respectively on cones and cylinders. Proposed method excellently extracts planes from Middlebury and KITTI dataset which are typically used for evaluation of stereo matching algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.4
• /
• pp.79-86
• /
• 2016

About 75% of software security incidents are caused by software vulnerability. In addition, the after-market repairing cost of the software is higher by more than 30 times than that in the design stage. In this background, the secure coding has been proposed as one of the ways to solve this kind of maintenance problems. Various institutions have addressed the weakness patterns of the standard software. A new Korean programming language Saesark has been proposed to resolve the security weakness on the language level. However, the previous study on Saesark can not resolve the security weakness caused by the API. This paper proposes a way to resolve the security weakness due to the API. It adopts a static analyzer inspecting dangerous methods. It classifies the dangerous methods of the API into two groups: the methods of using tainted data and those accepting in-flowing tainted data. It analyses the security weakness in four steps: searching for the dangerous methods, configuring a call graph, navigating a path between the method for in-flowing tainted data and that uses tainted data on the call graph, and reporting the security weakness detected. To measure the effectiveness of this method, two experiments have been performed on the new version of Saesark adopting the static analysis. The first experiment is the comparison of it with the previous version of Saesark according to the Java Secure Coding Guide. The second experiment is the comparison of the improved Saesark with FindBugs, a Java program vulnerability analysis tool. According to the result, the improved Saesark is 15% more safe than the previous version of Saesark and the F-measure of it 68%, which shows the improvement of 9% point compared to 59%, that of FindBugs.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.431-438
• /
• 2015

In this paper we address the symmetric-invariant problem in boundary image matching. Supporting symmetric transformation is an important factor in boundary image matching to get more intuitive and more accurate matching results. However, the previous boundary image matching handled rotation transformation only without considering symmetric transformation. In this paper, we propose symmetric-invariant boundary image matching which supports the symmetric transformation as well as the rotation transformation. For this, we define the concept of image symmetry and formally prove that rotation-invariant matching of using a symmetric image always returns the same result for every symmetric angle. For efficient symmetric transformation, we also present how to efficiently extract the symmetric time-series from an image boundary. Finally, we formally prove that our symmetric-invariant matching produces the same result for two approaches: one is using the time-series extracted from the symmetric image; another is using the time-series directly obtained from the original image time-series by symmetric transformation. Experimental results show that the proposed symmetric-invariant boundary image matching obtains more accurate and intuitive results than the previous rotation-invariant boundary image matching. These results mean that our symmetric-invariant solution is an excellent approach that solves the image symmetry problem in time-series domain.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.309-316
• /
• 2008

The mission-critical engagement control computer for air defense has to maintain its operation without any fault for a long mission time. The mission performed by large-scale and complex embedded software is extremely critical in terms of dependability and safety of computer system, and it is very important that engagement control computer has high reliability. The engagement control computer was implemented using four processors. The distributed computer composed of four processors quarantees the dependability and safety, and ASR fault-tolerant technique applied to each processor guarantees the reliability. In this paper, the mechanism and performance of ASR fault-tolerant technique are analysed. And MTBF, reliability, availability, and cost-effectiveness for ASR, DMR and TMR techniques applied to the engagement control computer are analysed. The mission-critical engagement control computer using software-based ASR fault-tolerant technique provides high reliability and fast recovery time at a low cost. The mission reliability of the engagement control computer using ASR technique in 4 processors board is almost same the reliability of the computer using TMR technique in 6 processors board. ASR technique is most suitable to the mission-critical engagement control computer.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.235-246
• /
• 2008

Service-Oriented Architecture (SOA) is emerging as an effective approach for developing applications by dynamically discovering and composing reusable services. Generally, the benefits of SOA are known as low-development cost, high agility, high scalability, business level reuse, etc. However, a representative problem for widely applying SOA is the performance problem. This is caused by the nature of SOA such as service deployment and execution in distributed environment, heterogeneity of service platforms, use of a standard message format, etc. Therefore, performance problem has to be overcome to effectively apply SOA, and service performance has to be measured precisely to analyze where and why the problem has occurred. Prerequisite for this is a definition of a quality model to effectively measure service performance. However, current works on service performance lacks in defining a practical and precise quality model for measuring performance which adequately addresses the execution environment and features of SOA. Hence, in this paper, we define a quality model which includes a set of practical metrics for measuring service performance and an effective technique to measure the value of the proposed metrics. In addition, we apply the metrics for Hotel Reservation Service System (HRSS) to show the practicability and usefulness of the proposed metrics.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.