• Journal of Information Technology and Architecture
• /
• v.10 no.4
• /
• pp.435-449
• /
• 2013

The performance of Enterprise Architecture (EA) in the Korea's public IT domain produces mixed results and responses. On the one hand, EA earns positive remarks and enthusiasm as a central government-wide IT governance framework with its significant IT budget saving records. At the same time, however, the response to EA at the department and agency level is tainted with disappointment, fatigue, and reluctance. This essay suggests that this is perhaps caused by the sterile lackluster concept of EA Business Architecture employed in the current EA practice of the enterprise. The possibility for liberating and reviving the concept of EA Business Architecture is explored. Various conceptual axes and branches of EA Business Architecture are identified based upon extensive EA field experience and observations, and discussions are made on how the concept of EA Business Architecture can be expanded and amplified on those conceptual axes and branched. The resulting EA Business Architecture conceptualization is consolidated into an illustrative typology for EA Business Architecture. In the end the theoretical and practical implications of the research are discussed along with its contribution and limitation.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.605-614
• /
• 2006

The success of a software development project can be determined by the use of QCD. And as a software's size and complexity increase, the importance of early quality assurance rises. Therefore, more effort should be given to prevention, as opposed to correction. In order to provide a framework for the prevention of defects, defect detection activities such as peer review and testing, along with analysis of previous defects, is required. This entails a systematization and use of quality data from previous development efforts. FMEA, which is utilized for system safety assurance, can be applied as a means of software defect prevention. SW-FMEA (Software Failure Mode Effect Analysis) attempts to prevent defects by predicting likely defects. Presently, it has been applied to requirement analysis and design. SW-FMEA utilizes measured data from development activities, and can be used for defect prevention on both the development and management sides, for example, in planning, analysis, design, peer reviews, testing, risk management, and so forth. This research discusses about related methodology and proposes defect prevention model based on SW-FMEA. Proposed model is extended SW-FMEA that focuses on system analysis and design. The model not only supports verification and validation effectively, but is useful for reducing defect detection.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.193-204
• /
• 2011

Since web applications are accessed by anonymous users via web, more security risks are imposed on those applications. In particular, because security vulnerabilities caused by insecure source codes cannot be properly handled by the system-level security system such as the intrusion detection system, it is necessary to eliminate such problems in advance. In this paper, to enhance the security of web applications, we develop a static analyzer for detecting the well-known security vulnerability of PHP file inclusion vulnerability. Using a semantic based static analysis, our vulnerability analyzer guarantees the soundness of the vulnerability detection and imposes no runtime overhead, differently from the other approaches such as the penetration test method and the application firewall method. For this end, our analyzer adopts abstract interpretation framework and uses an abstract analysis domain designed for the detection of the target vulnerability in PHP programs. Thus, our analyzer can efficiently analyze complicated data-flow relations in PHP programs caused by extensive usage of string data. The analysis results can be browsed using a JAVA GUI tool and the memory states and variable values at vulnerable program points can also be checked. To show the correctness and practicability of our analyzer, we analyzed the source codes of open PHP applications using the analyzer. Our experimental results show that our analyzer has practical performance in analysis capability and execution time.

• Journal of the Korean association of regional geographers
• /
• v.4 no.2
• /
• pp.79-94
• /
• 1998

This study begins with emphasis on the approach to public policy development and the extent to which a GIS framework can be used to evaluate projects objectively. This paper relates to public policy making and the use of GIS as a strategic management tool rather than the development of GIS technologies which has been the focus of attention since the advent of the first generation GIS systems in the 1960s. In order to consolidate a view towards public policy, the aim of this study is to show the advantages of using GIS to generate results which could be evaluated by cost and benefit analysis giving options of the alternative methods to estimate the feasibility of projects (both tangible and intangible) in a real public policy scenario. This study also reports that the tangible benefits associated with the GIS projects are better information processing, the easy analysis of data and the cost savings of map updates and printing, whilst the intangible benefits include quality decision making, and precise management of data through computing networks. In GIS context, the task of analysing and evaluating GIS projects is assumed in order to facilitate scientific and quantitative cost-benefit analysis. Previous methods of the cost-benefit analysis has not fully supported the evaluation of the intangible benefits and it has not been possible to make public policy realistic or scientifically understandable limiting decision makers in public domain. With the GIS decision makers are able to explore the potential of projects with this powerful decision supporting tool in practical application. On the basis of its potentials and limitations to cost-benefit analysis, therefore, it can be concluded that more flexible analysis and evaluation methodologies are needed to extend into the intangible benefits. In order to balance the evaluation of both quantitative and qualitative approaches on the cost-benefit analysis new or additional utilities will be required for the next GIS generation appraisal tool.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.73-80
• /
• 2012

Recently, medical equipments are developed and used for diagnosis or studies. In addition, demand of techniques which automatically deal with three dimensional medical images obtained from the medical equipments is growing. One of the techniques is automatic bone segmentation which is expected to enhance the diagnosis efficiency of osteoporosis, fracture, and other bone diseases. Although various researches have been proposed to solve it, they are unable to be used in practice since a size of the medical data is large and there are many low contrast boundaries with other tissues. In this paper, we present a fast and accurate automatic framework for bone segmentation based on multi-resolutions. On a low resolution step, a position of the bone is roughly detected using constrained branch and mincut which find the optimal template from the training set. Then, the segmentation and the registration are iteratively conducted on the multiple resolutions. To evaluate the performance of the proposed method, we make an experiment with femur and tibia from 50 test knee magnetic resonance images using 100 training set. The proposed method outperformed the constrained branch and mincut in aspect of segmentation accuracy and implementation time.

• KIISE Transactions on Computing Practices
• /
• v.21 no.10
• /
• pp.658-669
• /
• 2015

The paradigm of game development changes with technological trends. If the system can analyze and determine undefined inputs, users' input choices are not restricted. Therefore, game scenarios can have multifarious flows depending upon the user's input data. In this paper, we propose a method of including an output plan in the game system that is based on the user's input but is not restricted to predefined choices. We have implemented an experimental game on the Android platform by combining network communication and APIs. The game interface works as follows: first, the user's input data is transmitted to the server using HTTP protocol; then, the server carries out an analysis on the input data; and finally, the server returns the decision result to the game device. The game can provide users a scenario that corresponds to the decision results. In this paper, we used an image file for the user's input data format. The server calculates similarities between the user's image file and reference images obtained from the Naver Image Search API and then returns determination results. We have confirmed the value of integrating the game development framework with other computing technologies demonstrating the potential of the proposed methods for application to various future game interfaces.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.54-67
• /
• 2015

Nowadays, studies on the fusion of Semantic Web technologies are being carried out to promote the interoperability and value of sensor data in an IoT environment. To accomplish this, the semantic translation of sensor data is essential for convergence with service domain knowledge. The existing semantic translation technique, however, involves translating from static metadata into semantic data(RDF), and cannot properly process real-time and large-scale features in an IoT environment. Therefore, in this paper, we propose a technique for translating large-scale streaming sensor data generated in an IoT environment into semantic data, using real-time and parallel processing. In this technique, we define rules for semantic translation and store them in the semantic repository. The sensor data is translated in real-time with parallel processing using these pre-defined rules and an ontology-based semantic model. To improve the performance, we use the Apache Storm, a real-time big data analysis framework for parallel processing. The proposed technique was subjected to performance testing with the AWS observation data of the Meteorological Administration, which are large-scale streaming sensor data for demonstration purposes.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.705-712
• /
• 2008

Recently, interests in the notion of PKMS(Process based on Knowledge Management System) utilizing BPMS(Business Process Management System) and KMS(Knowledge Management System) have been significantly increased. Specially, most public organizations require their own effective knowledge management strategies since public business service needs various knowledge types. Based on a comprehensive framework that reflects lifecycle requirements of KMS and BPMS, we propose an PKMS system architecture, which performs step-by-step knowledge-providing strategy in public organization. To propose a PKMS architecture, this paper first investigates inter-relationships between public business and various knowledge types, and classifies knowledge types into three groups and then we suggest knowledge management strategies considering priority order among knowledge groups. Based on the proposed knowledge management, a PKMS system architecture can combine the advantages of the KM and BPM paradigms. This paper presents the PKMS system applied to employment insurance business part in real environment and demonstrated the advantages via inter-relationships between KM and BPM requirements.