• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1150-1152
• /
• 1998

Recently, our electric industry confronts a structural change and high competiveness environment in the course of deregulation. Rapid growth in electricity demand, financial need for new power plant construction, and envionmental problems have led to search for more efficient energy production and energy conservation techmologies. Especially, residential and commercial buildings consumes 40% of electricity demands and building energies are increasing more and more in Korea. The purpose of this paper is to analyze the electricity use of commercial buildings by end-use. Also, we will use it as a basic informations of DSM potential evaluation and evaluation process based on different approach by sector and type of potential.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1313-1318
• /
• 2017

Aggregating local features in a single vector is a fundamental problem in an image search. In this process, the image search process can be speeded up if binary features which are extracted almost two order of magnitude faster than gradient-based features are utilized. However, in order to utilize the binary features in an image search, it is necessary to study the techniques for clustering binary features to generate binary visual words. This investigation is necessary because traditional clustering techniques for gradient-based features are not compatible with binary features. To this end, this paper studies the techniques for clustering binary features for the purpose of generating binary visual words. Through experiments, we analyze the trade-off between the accuracy and computational efficiency of an image search using binary features, and we then compare the proposed techniques. This research is expected to be applied to mobile applications, real-time applications, and web scale applications that require a fast image search.

• Journal of Life Science
• /
• v.14 no.6 s.67
• /
• pp.991-996
• /
• 2004

This paper deals with an integrated system that facilitates researchers to do motif and domain search effectively and systematically. The system we developed is constructed on the basis of the integration of various resources related to motif, domain, and protein family. Those resources that can be classified into databases and search programs are dispersed to be available in Internet. In order to develop this system, we extracted core contents of diverse databases, which are required to analyze the protein function in terms of motifs or domains, to construct local databases and installed motif or domain search programs on our server, which corresponding database has as its own search program. Diverse utilities and CGI (Common Gateway Interface) programs make the databases and the search programs interlocked and web-based graphical user interfaces integrate all the components of our system. Employing our integrated system, end-users can receive its one-stop service to do protein function analysis systematically and effectively, without surfing many sites in Internet and wasting time over integrating search results.

• Journal of IKEEE
• /
• v.25 no.3
• /
• pp.437-444
• /
• 2021

In this paper, we propose an autonomous driving algorithm that allows a robot to explore various terrains, and implement an application that can monitor the robot's movement path during terrain search. The implemented application consists of a status unit that indicates the position, direction, speed, and motion of the mobile robot, a map unit that displays terrain information obtained through terrain search, and a control unit that controls the movement of the mobile robot. In order to control the movement of the robot, only the start and stop of the search/return is commanded by the application, and all driving for the search is performed autonomously. The basic algorithm for terrain search uses an infrared sensor to check for obstacles in the order of left, front, right, and rear, and if there is no obstacle and the path traveled is a dead end, it returns to the previous position and moves in the other direction to continue the search. Repeat the process to explore the terrain.

• MALSORI
• /
• no.59
• /
• pp.53-68
• /
• 2006

We report the evaluation results of the Korean speech recognition platform called ECHOS. The platform has an object-oriented and reusable architecture so that researchers can easily evaluate their own algorithms. The platform has all intrinsic modules to build a large vocabulary speech recognizer: Noise reduction, end-point detection, feature extraction, hidden Markov model (HMM)-based acoustic modeling, cross-word modeling, n-gram language modeling, n-best search, word graph generation, and Korean-specific language processing. The platform supports both lexical search trees and finite-state networks. It performs word-dependent n-best search with bigram in the forward search stage, and rescores the lattice with trigram in the backward stage. In an 8000-word continuous speech recognition task, the platform with a lexical tree increases 40% of word errors but decreases 50% of recognition time compared to the HTK platform with flat lexicon. ECHOS reduces 40% of recognition errors through incorporation of cross-word modeling. With the number of Gaussian mixtures increasing to 16, it yields word accuracy comparable to the previous lexical tree-based platform, Julius.

• Journal of the Korean Society for information Management
• /
• v.16 no.3
• /
• pp.65-82
• /
• 1999

Internet users are often frustrated when they try to find“right”piece of information quickly. The reason is that the discovery of available and quality based-resources becomes more difficult to end users while the Internet continues to expand rapidly. Not only incorrect keywords and query expression but word sense ambiguation are the cause of dropping-off in efficiency on Internet search. In this paper, studies were conducted to analyze dropping off in efficiency fir Internet search and discussed reducing user s frustration of the Internet and improving their search strategies.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.6_2
• /
• pp.891-897
• /
• 2021

In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

• Journal of Information Science Theory and Practice
• /
• v.8 no.3
• /
• pp.6-14
• /
• 2020

On information markets, we can identify different relations between sellers and their customers, with some users paying with money, some paying with attention, and others paying with their personal data. For the description of these different market relations, this article introduces the notion of arity into the scientific discussion. On unary information markets, customers pay with their money; examples include commercial information suppliers. Binary information markets are characterized by one market side paying with attention (e.g., on the search engine Google) or with personal data (e.g., on most social media services) and the other market side (mainly advertisers) paying with money. Our example of a ternary market is a social media market with the additional market side of influencers. If customers buy on unary markets, they know what to pay (in terms of money). If they pay with attention or with their personal data, they do not know what they have to pay exactly in the end. On n-ary markets (n greater than 1), laws should regulate company's abuse of money and-which is new-abuse of data streams with the aid of competition (or anti-trust) laws, and by modified data protection laws, which are guided by fair use of end users' attention and data.

• International Journal of Knowledge Content Development & Technology
• /
• v.14 no.3
• /
• pp.93-113
• /
• 2024

This study was conducted for the purpose of deriving the existing ScienceON elements and reorganizing them to increase user convenience and utilization. Towards this end, implications were derived by analyzing the current status of the ScienceON's website, case studies and analysis of major similar institution websites, and user satisfaction surveys. Based on the derived contents, key terms were analyzed and redefined, the menu system was reorganized, and the menu names were redefined, and the menu system was reorganized to match the direction and identity of the redefined ScienceON. The study results based on such are as follows. First, the ScienceON's brand selection criteria and direction were based on service sustainability, service inclusiveness, recognition of portal characteristics, user friendliness and intuitiveness. Considering the meaning of branding, branding strategy, and selection criteria for ScienceON branding, ScienceON, Ontong ScienceON, ScienceONPlatform, science information portal, ScienceON, Mecca of science and technology information, and 5 brand names such as ScienceON were proposed. Second, to improve accessibility, usability, and satisfaction, it would be necessary to redefine current terms. Towards this end, it would be necessary to change the terminology of knowledge infrastructure search and to unify and organize the terminology. Third, in the current menu, the services provided as analysis services and curation services are organized in the beta service menu, and data such as papers, patents, reports, and trends are also serviced only through integrated search, and hence, each data type and service type classification must be improved.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1428-1434
• /
• 2006

In this paper, we propose the scheme solving privacy infringement in RFID systems with improving the scalability of back-end server. With RFID/USN becoming important subject, many approaches have been proposed and applied. However, limits of RFID, low computation power and storage, make the protection of privacy difficult. The Hash Chain scheme has been known as one guaranteeing forward security, confidentiality and indistinguishability. In spite of that, it is a problem that requires much of computation to identify tags in Back-End server. In this paper, we introduce an efficient key search method, the Hellman Method, to reduce computing complexity in Back-End server. Hellman Method algorism progresses pre-computation and (re)search. In this paper, after applying Hellman Method to Hash chain theory, We compared Preservation and key reference to analyze and apply to parallel With guaranteeing requistes of security for existing privacy protecting Comparing key reference reduced computation time of server to reduce computation complex from O(m) to $O(\frac{m{^2/3}}{w})$ than the existing form.