• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.77-82
• /
• 2004

In this paper we present a barcode reader to decode two-dimensional symbology PDF417 and propose a novel method to extract the bar-space Patterns directly from the gray-level barcode image, which employs the location and the distance between extreme points of each row or column of the barcode image. This algerian proves to be very robust from the high convolutional distortion environments such as defocussing and warping, even under badly illuminating condition. If the scanned barcode image is a result of the convolution of a Gaussian-shaped point spread function with a hi-level image, popular image segmentation methods such as image thresholding can not distinguish between very narrow bar-space patterns. The Proposed algorithm shows improved Performance over current barcode readers.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.2
• /
• pp.81-91
• /
• 2012

As the recent development of the ubiquitous computing environment, u-GIS is being highlighted as the core technology of the ubiquitous computing environment, and thereby, studies on spatio-temporal data are being actively conducted. In this u-GIS environment, it is still difficult for existing mobile devices to efficiently manage the massive spatio-temporal data of u-GIS that are increasing day by day. Therefore, this paper develops a spatio-temporal query processing system for mobile devices in order to solve the problem. The system provides various spatio-temporal operators to insert/delete/update/search spatio-temporal data and supports a query optimization function that uses a spatio-temporal index for the flash memory and a spatio-temporal histogram for guaranteeing query execution speed. Lastly, by applying the spatio-temporal query processing system developed in this paper to the virtual scenario, this paper has proved that the system can be utilized in various application fields necessary to process spatio-temporal data in the mobile environment.

• Journal of the Korean Society for Library and Information Science
• /
• v.34 no.4
• /
• pp.5-26
• /
• 2000

The purpose of this study was to measure performance of university libraries, especially investigating the components of service quality and their relationship to the customer satisfaction. The result of the study was summarized as follows: First, the factors on satisfaction of library service revealed 12 factors such as access of information, quality of employees, suitable collections, issues related to civil petitions, equipments and facilities, timeliness, operating hours, use of information technology, library user education, reference service, public relation and individual service. Second, the factors of library service on customer satisfaction showed the following primary factors: suitable collections, issues related to civil petitions, access of information, equipments and facilities, timeliness, public relation, reference service, operating hours, and individual service. Third, the components of library service on customwe satisfaction showed the following primary components: availability, the number of books and journals, facilities of air conditioning, public relation, usefulness of retrieval system, waiting time for Internet use, operating hour, speed of repairs, receipt of civil petitions, use of non-book materials.

• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.1
• /
• pp.177-192
• /
• 2008

The purpose of this study is to investigate what fields of library cooperation system should be resolved and to find out a resolution. A survey are used for research method. The contents of survey is about operating performance and main obstacles of cooperation among other libraries. The results show that most of respondents estimated need of cooperation among libraries and operating performance of cooperation was poor. The system needs to be changed. The problems are insufficiency of budget and personnel. two different types of operating body, insufficiency of standard and committee for cooperation system, delayed speed of integrated retrieval system, limitation of sharing of information about users, insufficiency of user's and librarian's recognition of cooperation system. This study proposes improving method through developed model on cooperation system.

• The Journal of the Convergence on Culture Technology
• /
• v.3 no.2
• /
• pp.37-42
• /
• 2017

An internet primary bank, which is formed by internet and banks combined, is called the essence of fin-tech, and is currently experiencing rapid growth. 'K-Bank' and 'Kakao Bank', the representative internet primary banks this year, received positive responses as the origin of financial revolution. internet primary banks provide convenient financial services, benefits in time and money for customers. Not long ago, however, undesirable fraud cases caused by a used commodity dealer have happened. The damage exceeds 20,000,000 won. It is because the newborn banks are unable to check the fraud history through the bank account. In this paper, We will analyze the trend in internet primary banks, offer damages and examples, in addition, prevention of damage, and strategies for development.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1381-1394
• /
• 2006

Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.903-905
• /
• 2012

Recent research on Augmented Reality is Actively expand and Augmented reality feature added to the social network system (Social Network System) has become a necessity. In this paper, GPS-based Augmented Reality System for Social Network is introduced, is proposed. This system can add recent check-in friends in facebook by automatically to synchronizing the location coordinate, and it could also adding location coordinates system is represented in a real-world environment by AR, is Marker-based AR system that was Commonly used AR system is a huge cost by handheld devices in processing and storage space, the disadvantages of the marker-based AR systems can be solved by using Location-based AR applications. Therefore, the proposed GPS-based Augmented Reality System for Social Network, automatically searches for the optimal speed for Wifi and 4G network to iOS Hand AR system was desired in future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.762-767
• /
• 2013

Recently, researches on augmented reality(AR) are actively being conducted, and on addition of AR in social network system has become a necessity. In this paper, we propose GPS-based AR system for social network. This proposed system adds the recent check-in coordinates by automatically synchronizing a friend list in facebook and represents those added location coordinates in a real-world environment by using AR. Marker-based AR system that was commonly used by existing users consumes too much storage space and processing frequency for driving handle devices. But, location-based AR application can solves the disvantages of the standard marker=based AR system. Therefore, this proposed system allows an user with iOS hand devices to use GPS-based AR system by automatically searching the optimal speed for wifi and 4G. This will improve social network service.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.558-566
• /
• 2005

The XML is the new standard fir data representation and exchange on the Internet. In this paper, we describe a new approach for evaluating a path-oriented query against XML document. In our approach, we propose the Parallel Match Indexing Fabric to speed up evaluation of path-oriented query using path signature and design the parallel match algorithm to perform a match process between a path signature of input query and path signatures of elements stored in the database. To construct a structure of the parallel match indexing, we first make the binary tie for all path signatures on an XML document and then which trie is transformed to the Parallel Match Indexing Fabric. Also we use the Parallel Match Indexing Fabric and a parallel match algorithm for executing a search operation of a path-oriented query. In our proposed approach, Time complexity of the algorithm is proportional to the logarithm of the number of path signatures in the XML document.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.1
• /
• pp.166-174
• /
• 2010

SSDs are one of the best media to support portable and desktop computers' storage devices. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for desktop and server computers. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of flash memory operations, as compared to RAM memory. In order to achieve this goal, we propose a new index management scheme based on a compressed hot-cold clustering called CHC-Tree. CHC-Tree-based index management improves index operation performance by dividing index nodes into hot or cold segments and compressing pointers and keys in the index nodes and clustering the hot or cold segments. The offset compression techniques using unused free area in cold index node lead to reduce the number of slow erase operations in index node insert/delete processes. Simulation results show that our scheme significantly reduces the write and erase operation overheads, improving the index search performance of B-Tree by up to 26 percent, and the index update performance by up to 23 percent.