• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.977-982
• /
• 2007

There have been many efforts in automatic object recognition using computing technologies. Especially in the development of automated construction equipment, automatic object recognition is very important issue for the proper equipment maneuvering. 3D laser scanning, which uses (time-of-flight) method to construct the 3-dimensional information, is applied to the civil earth work environment for its high accuracy, quick data collection, and object recognition capability that will be developed by the authors in the future. The 3D earth model is also used as a fundamental information for intelligent earth work task planning. This paper presents the analysis of the 3D laser scanner market and selection of the most optimum 3D scanner for the intelligent earth work planning. As well as the hardware configuration for the automated 3D earth modeling is developed but also the software structure and detailed user interface are designed in this research. In addition, it is presented in this paper that the accuracy comparison test between TotalStation(R) which is a traditional survey tool and ScanStation(R). The accuracy test is done by relative distance measurement using known targets.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.59-66
• /
• 2015

A stochastic modeling approach as a mathematical method for workflow intelligence is widely used for analyzing and simulating workflow models in the literature. In particular, as a resource-centric modeling approach, this paper proposes a stochastic model to represent work-handover relationships between performers in a workflow-supported social network. Calculating probabilities for the work-handover relationships are determined by two types of probabilities. One is the work-transition probability between activities, and the other is the task assignment probability between activities and performers. In this paper, we describe formal definitions of stochastic workflow models and stochastic work-handover relationship models, as well. Then, we propose an algorithm for extracting a stochastic work-handover relationship model from a stochastic workflow model. As a consequence, the proposed model ought to be useful in performing resource-centric workflow simulations and model-log comparison analyses.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.801-808
• /
• 1999

지금까지, 전기통신망과 장비들의 관리에 대해서는 많은 연구들이 진행되었지만, TMN 상위 계층의 서비스 관리와 비즈니스 관리에 대한 연구는 많이 수행되지 못했다. 최근 전세계적으로 TMN 상위 계층의 관리기능 구현을 위해서 CORBA 기술을 적용하고자하는 관심이 증가하고 있다. 본 논문에서는, 정보모델과 상호운용에 관한 TMN과 CORBA의 주요특징들을 비교하고, TMN 프레임웍와 효율적인 CORBA 기술 연동을 위한 플랫폼 구조를 제안한다. 제안된 구조에서, TMN 관리 정보를 CORBA IDL 인터페이스로 변환해주는 GDMO/ASN.1 - CORBA IDL 변환기가 고안, 구현되었고, JIDM의 상호 작용 변환의 구현을 위해서 TMN/CORBA 게이트웨이 또한 고안되었다. 그리고 이러한 기능의 확장을 위해서 모듈 형식으로 라이브러리들과 코드 생성기들이 설계, 구현되었다.Abstract Up to now, a lot of efforts have been made for the management of telecommunication networks and equipment, but less effort has been made for the realization of higher-layer service and business management. There are recently worldwide growing interests for applying CORBA technology for the realization of higher layer Telecommunication Management Network (TMN) management functions. In this paper, we compare the features of TMN and CORBA with respect to information model, and operational behavior. And then, we propose a platform architecture for the efficient integration of CORBA technology within TMN framework. Within platform architecture, GDMO/ASN.1 to IDL translator has been designed and implemented for translating TMN management information into CORBA IDL interface. The TMN/CORBA gateway is also designed for realization of the interaction translation specification of JIDM task force. The libraries and code generators have been designed and implemented in a modular fashion to provide the functional extensibility.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.315-319
• /
• 2015

This paper addresses the design and implementation of an Android application for real-time precise motion control. To provide stable real-time performance, we implemented the application in two parts: Android service in the form of a daemon process, which periodically transfers a set of position commands for all motors through a real-time fieldbus, and Android UI application, which generates and delivers the set of position commands to the Android service. To support such a real-time motion control application, we use multi-core partitioning, which partitions the processor cores into a real-time partition to be used by the real-time motion control service and a non-real-time partition to be used by the Android application, and set up a shared buffer between them for communication. Our experiments show that we can obtain a motion control period of 2 ms with 99% task activation jitters less than ${\pm}55{\mu}s$ for a configuration where each of the four threads controls two motors in a group.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.504-515
• /
• 2008

Fast transmission speeds and various wired network services have been combined with the convenience and mobility of wireless services. The combination of wired/wireless technologies is spreading rapidly since it enables the creation of new services and provides new features to both users and service providers. In such wired/wireless integrated services, network integration is very important because such systems are integrated by a linkage between heterogeneous networks and they involve an integration of transmission technologies across networks. In this situation, existing security and communication technologies are unsuitable since the network are integrated with heterogeneous networks. The network may also have several security flaws. In existing homogeneous networks, user authentication and key management between heterogeneous networks are required for these new technologies. The establishment of security technologies for heterogeneous devices is a very important task between homogeneous networks. In this paper, we propose a secure and efficient key management system for a heterogeneous network environment. Our system provides secure communications between heterogeneous network devices.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.821-829
• /
• 2000

Over the past decade, the topic of work breakdown structure (WBS) has gained an increasing amount of attention from information technology professionals as an effective tool for managing the complexity of a large-scale information system development project. It is a method for planning and controlling a large-scale information system development. A WBS provides the basis for project organization, cost estimation, task scheduling, and contract management. Based on the authors' practical experience, this paper discusses how to establish a specific WBS and some considerations for developing a well-defined WBS. The model of WBS suggested in this study will provide useful insight and guidelines for establishing the spec-ific WBS for a large-scale information systems development.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.1020-1033
• /
• 2021

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.

• Journal of Internet Computing and Services
• /
• v.20 no.4
• /
• pp.73-79
• /
• 2019

Selecting a proper journal to submit a research paper is a difficult task for researchers since there are many journals and various decision factors to consider during the decision process. For this reason, journal recommendation services are exist as a kind of intelligent research assistant which recommend potential journals. The existing services are executing a recommendation based on topic similarity and numerical filtering. However, it is impossible to calculate topic similarity when a researcher does not input paper data, and difficult to input clear numerical values for researchers. Therefore, the journal recommendation method which consider the importance of decision factors is proposed by constructing the preference matrix based on the paper publication history of a researcher. The proposed method was evaluated by using the actual publication history of researchers. The experiment results showed that the proposed method outperformed the compared methods.

• Journal of Korean Society of Archives and Records Management
• /
• v.19 no.3
• /
• pp.205-222
• /
• 2019

This study analyzed the problems that occurred while constructing and operating the cloud record management system at the record management workplace and suggested ways to improve the system. In the study, the cloud record management system has the following problems: first, it has not been accompanied by the change in the legislative system. Second, it has not been utilizing the benefits of cloud technology. Third, it has not been considering the changes after the system construction. Given this, the study suggested three improvement plans to solve these problems: first, in relation to the reformed legislative system, the study proposed the diversification of records management units (file-item structure) and the restriction on access to records. Second, the study suggested a system redesign by improving the current work process based on paper documents. Third, to solve records management issues, the study presented the establishment of the governance body and the proactive countermeasure of the National Archives of Korea.