• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.345-350
• /
• 2009

Hangul search functionality, including dictionary search is used in many Hangeul applications. Existing research of hangeul search method is the study of using hangeul syllable as a basic unit. However when you consider the characteristics of Hangul, the research of using hangeul character as a basic unit is needed. In this paper we propose the character based hangeul search method using the location-specific frequency information and verify the effectiveness of the proposed method through the experiments.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.318-324
• /
• 2001

In this paper we propose the adaptive scheme to place more search points as long as the operation tapability of the motion estimator in the video codec permits. And the proposed algorithm takes advantage of the intuitive fact that the quality of the decoded video is more degraded as the spatial frequency of the corresponding block is increased due to the augmentation of local minima per unit area. Thererore, we propose the scheme to enhance the quality by locating relatively more search points in the block with high frequency components by analyzing the spatial frequencies of the video sequence. As a result, the proposed scheme can adaptively place more search points possibly permitted by the motion estimator and guarantees better quality compared to the TSS and FS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.41-49
• /
• 2011

This paper introduces a new search model which can retrieve information instantly and easily about a given search word on Internet and control search spaces diversely. In the existing web searches, because the user has to stop his work, run web browsers, connect to special internet sites, and type the search word by keyboard. it is a long way and not a simple way. Also the search result is too much. The user suffers difficulties of multiple searches for different categories such as dictionary, image, video clips, etc. The software implemented in this paper enables for the user to select search word simply at any documents on the screen and make search started by simply pressing CRTL key and left button of the mouse simultaneously. The software is a mash up style using the Open API which is provided by a web site and can be freely available in any other sites. By calling different Open APIs of several web sites, the mash-up software can integrate search functions of many different sites. We evaluate that the software implemented in this paper will be a good reference of mash-up as one with characteristics of easy and instant search, simple result, diversity of search category, and scalability of search functions.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.12
• /
• pp.1-10
• /
• 2016

In this paper, we attempt to prevent certain cases by tracing a history and making genogram about open source software and its modification using similarity of source code. There are many areas which use open source software actively and widely, and open source software contributes their development. However, there are many unconscious cases like ignoring license or intellectual properties infringe which can lead litigation. To prevent such situation, we analyze source code similarity using program dependence graph which resembles subgraph isomorphism problem, a typical NP-complete problem. To solve subgraph isomorphism problem, we utilized harmony search of metaheuristic algorithm and compared its result with a genetic algorithm. For the future works, we represent open source software as program dependence graph and analyze their similarity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.880-886
• /
• 2016

With lots of information occurring on the Internet, the search engine plays a role in gathering the scattered information on the Internet. Some search engines show not only search result pages including search keyword but also search result numbers of the keyword. The number of keyword searching result provided by the Google search engine can be utilized to identify overall trends for this search word on the internet. This paper is aimed designing and realizing the system which can efficiently manage the number of searching result provided by Google search engine. This paper proposed system operates by Web, and consist of search agent, storage node, and search node, manage keyword and search result, numbers, and executing search. The proposed system make the results such as search keywords, the number of searching, NGD(Normalized Google Distance) that is the distance between two keywords in Google area.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.417-426
• /
• 2002

Components are stored in a component repository for later reuse. Effective search and retrieval of desired components in a component repository is a very important issue. It usually takes a lot of time and efforts to gather information about a component, and its availability is essential to implement a repository. Software Component Descriptor proposed in CORBA 3 contains information about a component using an XML vocabulary. In this paper we extend Software Component Descriptor to be useful for the search of a component repository. We use a facet scheme as a search method of a component repository. And our new retrieval method supports queries connected with logical operators such as AND, OR, NOT, which were not supported with existing facet retrieval methods. Also we reduce the search complexity considerably.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.133-141
• /
• 2001

Since the computing environment changes very rapidly, the estimation of software effort is very difficult because it is not easy to collect a sufficient number of relevant cases from the historical data. If we pinpoint the cases, the number of cases becomes too small. However is we adopt too many cases, the relevance declines. So in this paper we attempt to balance the number of cases and relevance. Since many researches on software effort estimation showed that the neural network models perform at least as well as the other approaches, so we selected the neural network model as the basic estimator. We propose a search method that finds the right level of relevant cases for the neural network model. For the selected case set. eliminating the qualitative input factors with the same values can reduce the scale of the neural network model. Since there exists a multitude of combinations of case sets, we need to search for the optimal reduced neural network model and corresponding case, set. To find the quasi-optimal model from the hierarchy of reduced neural network models, we adopted the beam search technique and devised the Case-Set Selection Algorithm. This algorithm can be adopted in the case-adaptive software effort estimation systems.

• Journal of The Korean Association of Information Education
• /
• v.6 no.2
• /
• pp.179-186
• /
• 2002

Data structure and algorithm are primary courses for computer programming education. However, now those are not interesting courses for students because the programming methodologies that used these courses are not the proper methodologies for the visual and windows programming. Therefore, we developed the SCSA (Software Component for Search Algorithm) which is a software component for effective search algorithm education, and is based on visual programming in this thesis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.491-498
• /
• 2016

The software defined networks implement a software network control plane, which is physically separated from the data plane. For wide area software defined network deployments, multiple controllers are required, and the placement of these controllers influences importantly the performance of the software defined networks. This paper proposes a Tabu search algorithm, which is one of the meta heuristic algorithms, for an efficient controller placement in software defined networks. In order to efficiently obtain better results, we propose new neighborhood generating operations, which are called the neighbor position move and the neighbor number move, of the Tabu search algorithm. We evaluate the performances of the proposed algorithm through some experiments in terms of the minimum latency and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms the existing genetic algorithm and random method under various conditions.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.175-194
• /
• 2006

A common user interface system, a subset of library portal software products was evaluated in terms of eight broader categories; searching, user interaction; customization; authentication; design; database communication protocols; after sale support; and software platforms supported. As a result, Muse search ENCompass, MetaLib were the three highest scoring common user interface software products. and KDB metasearch in domestic area was the highest scoring products.