• International Journal of Contents
• /
• v.15 no.2
• /
• pp.38-43
• /
• 2019

Recently, bottom-up information systems (BUIS), developed according to the requirements of individual user departments, have become popular. However, effective management of BUIS projects is not enough, with many organizations having experienced integration challenges with such individual projects. BUIS projects are relatively small and limited in scope, as opposed to the large, complex systems developed through traditional top-down information system development projects. Due to these differences in characteristics, the control modes as well as the aspects to improve development performance in each type of project are also different. Therefore, it is difficult to apply the results of prior research on control in system development projects to improve BUIS project performance. The purpose of this study is to derive a new theory of control to improve BUIS project performance. The results contribute to the improvement of firm performance through effective control of BUIS projects in modern enterprises.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.2
• /
• pp.266-277
• /
• 2019

In modern warfare, securing time for preemptive response is recognized as an important factor of victory. The naval combat system, the core of naval forces, also strives to increase the effectiveness of engagement by improving its real-time information processing capabilities. As part of that, it is considered to use the TPR-tree in the naval combat system's target indexing because spatio-temporal searches can be performed quickly even as the number of target information increases. However, because the TPR-tree is slow to process updates, there is a limitation to handling frequent updates. In this paper, we present a method for improving the update performance of TPR-tree by applying the bottom-up update scheme, previously proposed for R-tree, to the TPR-tree. In particular, we analyze the causes of overlaps occurring when applying the bottom-up updates and propose ways to limit the MBR expansion to solve it. Our experimental results show that the proposed technique improves the update performance of TPR-tree from 3.5 times to 12 times while maintaining search performance.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.17-26
• /
• 2009

In national defense, established information systems are mainly based on simple information processing, such as mass data query. They have thus lacked intelligent ability of information and knowledge representation ability. We therefore need the research about the construction of military ontology which is the main topic for knowledge construction. Military ontology can help us develop the intelligent national defense information system which can search and manage information efficiently. In this paper, we present the six-step bottom-up approach for military ontology extraction, then we apply this approach to one of military domain, called national defense educational training, and finally implement it using $Prot\acute{e}g\acute{e}$ which is one of the most useful ontology development tool.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.21-36
• /
• 2002

This study empirically examined the effects of data warehousing methodology on the success of data warehousing. Research model and two hypotheses were set up to identify the relationships among two types of data warehousing methodology(top-down/bottom-up, dw configuration) and success based on the investigations of such theories as data warehousing, data warehousing methodology, IS success and so forth. And the survey instrument(questionnaire) was developed to collect data. Ultimately 183 questionnaires from 61 korean firms were collected. Findings showed that two types of data warehousing methodology affect significant effect on the success of data warehousing.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.559-562
• /
• 2004

The methodologies to develop land use plans are divided into two different ways, top-down and bottom-up planning. The bottom-up method is more efficient and effective to detailed land use planning. However, it requires considerable amount of information about the present status of land use. Cadastral information system is one of the best information provider for the planning. Building Register Database shows the type, area, use and location of a building. Both cadastral and Building Register systems apparently contain useful information needed to the physical planning. The study focuses on developing a prototype to provide real time information for detailed physical planning by a federated database system using the two databases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.133-140
• /
• 2008

This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.04a
• /
• pp.333-340
• /
• 2000

Research on group decisions and electronic meeting systems have been increasing rapidly according to the widespread of Internet technology. Although various issues have been raised in empirical research, we will try to solve an issue on idea categorizing in the group decision making process of electronic meeting systems. Idea categorizing used at existing group decision support systems was performed in a top-down procedure and mostly b participants; manual work. This resulted in tacking as long in idea categorizing as it does for idea generating clustering an idea in multiple categories, and identifying almost similar redundant categories. However such methods have critical limitation in the electronic meeting systems, we suggest an intelligent idea categorizing methodology which is a bottom-up approach. This method consists of steps to present idea using keywords, identifying keywords' affinity, computing similarity among ideas, and clustering ideas. This methodology allows participants to interact iteratively for clear manifestation of ambiguous ideas. We also developed a prototype system, IIC (intelligent idea categorizer) and evaluated its performance using the comparision experimetn with other systems. IIC is not a general purposed system, but it produces a good result in a given specific domain.

• Information Systems Review
• /
• v.9 no.1
• /
• pp.283-309
• /
• 2007

This case study reviews procedures of the implementation of a strategic performance management system for the KITECH(Korea Institute of Industrial Technology). The purpose of the study is to provide government funding research institutions with cautious considerations when the institutions want to setup performance systems.. KITHCH's strategic performance management system is based on BSC and has following characteristics: 1. KITHCH has spent more than a year in order to obtain the personnel's agreements on mission, strategies and goals. 2. They have focused a mission and strategy focused performance system so that KPIs are as much aligned as possible with strategies. 3. They have developed the system using both top-down and bottom-up frames. The weights for KPIs were formulated with the bottom-up procedure. This study results possible effective factors for successful implementation of a strategic performance management system for research institutions.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.63-76
• /
• 2000

Research on group decisions and electroinc meeting systems have been increasing rapidly according to the widespread of Internet technology. Although various issues have been raised in empirical research, we will try to solve an issue on idea categorizing in the group decision making process of elecronic meeting systems. Idea categorizing used at existing group decision support systems was performed in a top-down procedure and mostly participants\` by manual work. This resulted in tacking as long in idea categorizing as it does for idea generating, clustering an idea in multiple categories, and identifying almost similar redundant categories. However such methods have critical limitation in the electronic meeting systems, we suggest an intelligent idea categorizing methodology which is a bottom-up approach. This method consists of steps to present idea using keywords, identifying keywords\` affinity, computing similarity among ideas, and clustering ideas. This methodology allows participants to interact iteratively for clear manifestation of ambiguous ideas. We also developed a prototype system, IIC (intelligent idea categorizer) and evaluated its performance using the comparision experimetn with other systems. IIC is not a general purposed system, but it produces a good result in a given specific domain.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.63-69
• /
• 1998

The area optimization of the power distribution network is an important problem in the layout design of VLSI systems. In this paper we propose noval methods to solve the problem of designing minimal area power distribution nets, while satisfying voltage drop and electromigration constraints. We propose two novel greedy heuristics for power net design-one based on bottom-up tree construction using greedy merging and the other based on top-down linearly separable partitioning.