• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.109-120
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.60-69
• /
• 2003

In an Information Retrieval System(IRS) based on an inverted file as a file structure it is possible to retrieve related documents when the searcher know the complete words of searching fields. however, there are many cases in which the searcher may not know the complete words but a partial string of words with which to search. In this case, if the searcher can search indexes that include the known partial string, it is possible to retrieve related documents. Futhermore, when the retrieved documents are few, we need a method to find all documents having indexes which include known the partial string. To satisfy these requests, the searcher should be able to construct a query formulation that uses the term truncation method. Also the IRS should have an electronic dictionary that can support a truncated search term. This paper designs and implements an electronic dictionary(ED) structure to support a truncation search efficiently. The ED guarantees very fast and constant searching time for searching a term entry and the inversely alphabetized entry of it, regardless of the number of inserted words. In order to support a truncation search efficiently, we use the Trie structure and in order to accommodate fast searching time we use a method using array. In the searching process of a truncated term, we can reduce the searching time by minimizing the length of string to be expanded.

• The Journal of Information Technology
• /
• v.12 no.3
• /
• pp.7-17
• /
• 2009

This research is about the design of an opinion drawing and analysis system through statistical based Web Mining of web contents, where data of opinions are automatically drawn and analyzed concerning web documents that are scattered around in various web sites that exist within the internet. Furthermore, provides a search service that can easily classify positive/negative opinions and also provide searching and statistical information. Users, who want to search for opinions, can input a specific keyword to observe opinions of others easily. In addition, there is a merit in materializing the monitoring system.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.5-22
• /
• 1998

This study compared whether there are significant differences of searching characteristics between the subject specialists and professional searchers in education in terms of internet search engines. The major findings and conclusions from the study are as follows. Subject specialists used more search terms and Boolean operators and spent more times on the computers than professional searchers. However, professional searchers retrieved more relevant documents and had higher precision ratios than subject specialists.

• Journal of Information Technology Services
• /
• v.19 no.5
• /
• pp.65-81
• /
• 2020

This study aims to examine the effects of users' perceptions of COVID-19 risk on their seeking and processing of relevant information as COVID-19 emerges and spreads worldwide in 2019. We apply the risk information seeking and processing model (RISP Model) to verify whether users' COVID-19 related information seeking and processing behaviors have a positive effect on their preventive and information sharing behaviors. To achieve this research goal, an online survey was conducted with about 400 of social media users. The users' perceptions of risk for COVID-19 increased their perceived insufficiency of COVID-19 information. In addition, the perceived insufficiency of users' information formed a positive relationship with seeking and searching of information behaviors. The processing of COVID-19 related information has increased related preventive behaviors and sharing of information through social media. While searching for information related to COVID-19 prompted personal information sharing behaviors, it did not significantly affect preventive behaviors. Accordingly, in order to promote COVID-19 preventive behaviors as well as overall user health-related behaviors it can be inferred that additional measures are needed in addition to pursuing relevant information.

• Convergence Security Journal
• /
• v.12 no.6
• /
• pp.19-24
• /
• 2012

As the representative of the convergence of broadcasting and communication, the data service was expected to be a new profit source of the related industries. The data service, however, has not satisfied the expectation due to the short of killer services that make it popular with the viewers. According to the several survey reports, a lot of viewers do internet-searching using the key-words related to the TV program they are watching and, with the faith in the survey results, several trials has been performed to port established PC-based searching systems onto TV-set only to fail to get popularity among viewers. The failures are mainly caused that they did not sufficiently consider the viewers' modality that viewers seriously want not to be obstructed by anything when they are absorbed in a program. This paper proposes an MHP-based searching data service designed to minimally interrupt the viewers watching a TV program and to be synchronized with a TV program by using the searching key-words relative to it, the content of which changes as time goes on.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.32-39
• /
• 2009

In this thesis, design effective elimination interference algorithm of ICS repeat system for repeater that improve frequency efficiency. Gennerally, LMS Algorithm apply to ICS repeat system. Error convergence speed and accuracy of LMS Algorithm are influenced by reference signal. For improve LMS Algorithm, suggest Adaptive searching channel estimate algorithm. For using channel characteristic, adaptive searching channel estimate algorithm make reference signal similar interference signal by convolution operation and complement LMS algorithm demerit. For make channel similar pratical channel, apply Jake's Rayleigh multi-path model. LMS algorithm and suggested adaptive searching channel estimate algorithm that have 16 taps apply to ICS repeat system under Rayleigh multi-path channel, so simulate with MATLAB. According to simulate, ICS repeat system with LMS algorithm show -40 dB mean square error convergent after 110 datas iteration and ICS repeat system with adaptive searching channel estimate algorithm show -80 dB mean square en-or convergent after 120 datas iteration. Analyze simulation result, suggested adaptive searching channel estimate algorithm show 40 dB accuracy than LMS algorithm.

• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.632-639
• /
• 2011

Searching distributed resource efficiently is very important in distributed computing, cloud computing environment. Distributed resource searching may have system overheads and take much time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. The open-source community project JXTA defines an open set of standard protocols for ad hoc, pervasive, peer-to-peer computing as a common platform for developing a wide variety of decentralized network applications. In this paper, we proposed peer search algorithm based on JXTA-Sim. original JXTA peer searching algorithm selected a loosely-consistent DHT. Our Lookup algorithm decreases message number of WALK_LOOKUP and reduce the network system overload, and we make a result of same performance both original algorithm and our proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.6
• /
• pp.650-656
• /
• 1999

In this paper, we study on the convergence of the evolution strategies by introducing the Lamarckian evolution and the Baldwin effect, and propose a random local searching and a reinforcement local searching methods. In the random local searching method some neighbors generated randomly from each individual are med without any other information, but in the reinforcement local searching method the previous results of the local search are reflected on the current local search. From the viewpoint of the purpose of the local search it is suitable that we try all the neighbors of the best individual and then search the neighbors of the best one of them repeatedly. Since the reinforcement local searching method based on the Lamarckian evolution and Baldwin effect does not search neighbors randomly, but searches the neighbors in the direction of the better fitness, it has advantages of fast convergence and an improvement on the global searching capability. In other words the performance of the evolution strategies is improved by introducing the learning, reinforcement local search, into the evolution. We study on the learning effect on evolution strategies by applying the proposed method to various function optimization problems.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.15-24
• /
• 1998

In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.