• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.564-582
• /
• 2015

This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step for the sake of driving the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. Numerical results show that the proposed QBFO has more powerful properties in terms of convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. Furthermore, we examine the employment of our proposed QBFO for cognitive radio spectrum allocation. The results indicate that the proposed QBFO based spectrum allocation scheme achieves high efficiency of spectrum usage and improves the transmission performance of secondary users, as compared to color sensitive graph coloring algorithm and quantum genetic algorithm.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.211-223
• /
• 2018

To understand the meaning of data is a common goal of research on unstructured data. Among these unstructured data, there are difficulties in analyzing the meaning of unstructured data related to corpus and sentences. In the existing researches, the researchers used LSA to select sentences with the most similar meaning to specific words of the sentences. However, it is problematic to examine many sentences continuously. In order to solve unstructured data classification problem, several search sites are available to classify the frequency of words and to serve to users. In this paper, we propose a method of classifying documents by using the frequency of similar words, and the frequency of non-relevant words to be applied as weights, and storing them in terms of a multi-pattern storage. We use Tensorflow's Softmax to the nearby sentences for machine learning, and utilize it for unstructured data analysis and the inference of traffic information.

• Journal of the Korean Society for information Management
• /
• v.23 no.1 s.59
• /
• pp.99-119
• /
• 2006

The most widely used information searching method in the current internet environment is the keyword-based one, which has certain limitations in terms of precision and recall. Most major internet portals provide directory-based searching as a means to complement these limitations. However, that they adopt different classification schemes brings significant inconvenience to the users, and it consequently suggests a need to develop mapping gateway to provide cross-portal, or cross-directory information searching. In this context, this study attempts to develop a prototype system of intermediary gateway for integrated search, using the directory services of three major portals, Naver, Yahoo and Empas, and test its performance.

• Journal of Multimedia Information System
• /
• v.2 no.3
• /
• pp.287-294
• /
• 2015

We are living in epoch of information when Internet touches all aspects of our lives. Therefore, it provides a plenty of services each of which benefits people in different ways. Electronic Mail (E-mail), File Transfer Protocol (FTP), Voice/Video Communication, Search Engines are bright examples of Internet services. Between them Social Network Services (SNS) continuously gain its popularity over the past years. Most popular SNSs like Facebook, Weibo and Twitter generate millions of data every minute. Twitter is one of SNS which allows its users post short instant messages. They, 100 million, posted 340 million tweets per day (2012)[1]. Often big amount of data contains lots of noisy data which can be defined as uninteresting and unclassifiable data. However, researchers can take advantage of such huge information in order to analyze and extract meaningful and interesting features. The way to collect SNS data as well as tweets is handled by crawlers. Twitter crawler has recently emerged as a great tool to crawl Twitter data as well as tweets. In this project, we develop Twitter Crawler system which enables us to extract Twitter data. We implemented our system in Java language along with MySQL. We use Twitter4J which is a java library for communicating with Twitter API. The application, first, connects to Twitter API, then retrieves tweets, and stores them into database. We also develop crawling strategies to efficiently extract tweets in terms of time and amount.

• Journal of Korea Multimedia Society
• /
• v.22 no.11
• /
• pp.1313-1323
• /
• 2019

With the development of the Internet and the increase of smart phones, various services considering user convenience are increasing, so that users can check news in real time anytime and anywhere. However, online news is categorized by media and category, and it provides only a few related search terms, making it difficult to find related news related to keywords. In order to solve this problem, we propose a method to recommend related documents more accurately by applying Doc2Vec similarity to the specific keywords of news articles and weighting the title and contents of news articles. We collect news articles from Naver politics category by web crawling in Java environment, preprocess them, extract topics using LDA modeling, and find similarities using Doc2Vec. To supplement Doc2Vec, we apply TF-IDF to obtain TC(Title Contents) weights for the title and contents of news articles. Then we combine Doc2Vec similarity and TC weight to generate TC weight-similarity and evaluate the similarity between words using PMI technique to confirm the keyword association.

• Hwankyungkyoyuk
• /
• v.23 no.3
• /
• pp.1-16
• /
• 2010

Global climate change becomes one of the most serious environmental problems over the world. There is growing recognition thai climate change education, especially for children is important. However, there have been few programmes, curricula, teachers' training chances, and teaching-learning materials for climate change education so far. Therefore, we analyse the world wide web(web) contents in Korea which are available for climate change education, providing fundamental data in developing educational contents for climate change, as well as helping users to search appropriate contents for climate change education. Subjects for this study are 10 web sites of public institutions related to climate change in Korea. The web contents are evaluated in terms of diversity, accuracy, authenticity and the ease of use. The key finding in this study is that the majority of the contents are focused on how to respond to the problem, especially mitigation and also we find that most of the web sites provide text-types of lesson plan and video-types. Consequently, it would be necessary to develop various web contents for climate change education in both quality and quantity aspects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.1-20
• /
• 2018

Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.35 no.5
• /
• pp.29-36
• /
• 2007

The new Urban Park Regulation encourages local governments to introduce new types of urban parte such as historic parte, cultural parks and neighborhood parte. However ambiguity among those parks in terms of main facilities and providing recreational programs makes it difficult for local governments, as well as landscape designers and planners, to adopt this new regulations. In this light, the present study aims to search for park facilities and programs defined by the new regulations, in order to satisfy users' demands for those parks with consideration to parks' unique characteristics. For these purposes, a conjoint analysis was carried out with three hundreds participants. Sampled participants include the citizens of Seoul as well as current residents of Paju. The study results indicate that participants would like to have distinctive programs and facilities at these three new types of parks. However, no considerable differences were observed among the levels of programs and facilities participants wish to have, due to unfamiliarity with, in particular, cultural and historic parks. Despite this insignificant difference among attribute levels, study results clearly suggest that residents wold like to have new types of facilities and recreational programs.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.4
• /
• pp.91-96
• /
• 2014

Mobile image retrieval is one of the most exciting and fastest growing research fields in the area of multimedia technology. As the amount of digital contents continues to grow users are experiencing increasing difficulty in finding specific images in their image libraries. This paper proposes a new efficient and effective mobile image retrieval method that applies a weighted combination of color and texture utilizing spatial-color and second order statistics. The system for mobile image searches runs in real-time on an iPhone and can easily be used to find a specific image. To evaluate the performance of the new method, we assessed the iPhone simulations performance in terms of average precision and recall using several image databases and compare the results with those obtained using existing methods. Experimental trials revealed that the proposed descriptor exhibited a significant improvement of over 13% in retrieval effectiveness, compared to the best of the other descriptors.