• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.1-16
• /
• 2005

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. Accordingly, this study suggests the re-ranking retrieval model which reflects the content based similarity between user's inquiry terms and index words by grasping the document knowledge structure. In order to accomplish this, the former constructs a thesaurus and similarity relation matrix to provide the subject analysis mechanism and the latter propose the algorithm which establishes a search model such as query expansion in order to analyze the user's demands. Therefore, the algorithm that this study suggests as retrieval utilizing the information structure of a retrieval system can be content-based retrieval mechanism to establish a 2-step search model for the preservation of recall and improvement of accuracy which was a weak point of the previous fuzzy retrieval model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.400-404
• /
• 2006

We suggest a method to detect rear car license plate of one more cars by using blobs. First, we try to search all of the blobs from an input image based on the difference between objects and background. Second, we obtain rectangles enclosed the blobs, and rectangle clusters by considering the properties, for example, the number, size, distance, position. Third, the cluster is verified by the Support Vector Machine. Even if we only use the adaptive binarization as the preprocessing, the detection ratio is very high.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.46-55
• /
• 2020

Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.857-866
• /
• 2006

Performance of an image retrieval system is usually very low because of the semantic gap between the low level feature and the high level concept in a query image. Semantically relevant images may exhibit very different visual characteristics, and may be scattered in several clusters. In this paper, we propose a content based image rertrieval approach which combines region based image retrieval and a new relevance feedback method using adaptive clustering together. Our main goal is finding semantically related clusters to narrow down the semantic gap. Our method consists of region based clustering processes and cluster-merging process. All segmented regions of relevant images are organized into semantically related hierarchical clusters, and clusters are merged by finding the number of the latent clusters. This method, in the cluster-merging process, applies r: using v principal components instead of classical Hotelling's $T_v^2$ [1] to find the unknown number of clusters and resolve the singularity problem in high dimensions and demonstrate that there is little difference between the performance of $T^2$ and that of $T_v^2$. Experiments have demonstrated that the proposed approach is effective in improving the performance of an image retrieval system.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.80-90
• /
• 2002

Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

• The Journal of Society for e-Business Studies
• /
• v.9 no.1
• /
• pp.83-104
• /
• 2004

Recently, information systems that require storage and retrieval of huge amount of data are becoming used widely. Accordingly, research efforts have been made to develop Linux cluster file systems in the SAN environment in which clients themselves can manage metadata and access data directly. Also a semi-flat directory structure based on extendible hashing has been proposed to support fast retrieval of files[1]. In this research, we have designed and implemented the semi-flat extendible hash directory under the Linux system. In order to evaluate the practicality of the directory, we have also implemented the B+-tree based directory and experimented the performance. According to the performance comparisons, the extendible hash directory has the better performance at insert, delete, and search operations. On the other hand, the B+-tree directory is better at sorting files.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

• The Korean Journal of Malacology
• /
• v.26 no.2
• /
• pp.185-188
• /
• 2010

The Web-based the genus Haliotis SNP database was constructed on the basis of Intel Server Platform ZSS130 dual Xeon 3.2 GHz cpu and Linux-based (Cent OS) operating system. Haliotis related sequences (2,830 nucleotide sequences, 9,102 EST sequences) were downloaded through NCBI taxonomy browser. In order to eliminate vector sequences, we conducted vector masking step using cross match software with vector sequence database. In addition, poly-A tails were removed using Trimmest software from EMBOSS package. The processed sequences were clustered and assembled by TGICL package (TIGR tools) equipped with CAP3 software. A web-based interface (Haliotis SNP Database, http://www.haliotis.or.kr) was developed to enable optimal use of the clustered assemblies. The Clustering Res. menu shows the contig sequences from the clustering, the alignment results and sequences from each cluster. And also we can compare any sequences with Haliotis related sequences in BLAST menu. The search menu is equipped with its own search engine so that it is possible to search all of the information in the database using the name of a gene, accession number and/or species name. Taken together, the Web-based SNP database for Haliotis will be valuable to develop SNPs of Haliotis in the future.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.701-708
• /
• 2005

Structuring mechanism, important to serve messages in post-office box structure, is to construct the hierarchy of classes according to the contents of message objects. This Paper Proposes $\alpha$-cut based genealogy grouping method to cluster a lot of structured objects in application domain. The proposed method decides the relationship first by semantic similarity relation and fuzzy relation, and then performs the grouping by operations of search( ), insert() and hierarchy(). This hierarchy structure makes it easy to process group-related processing tasks such as answering queries, discriminating objects, finding similarities among objects, etc. The proposed post-office box structure may be efficiently used to serve and manage message objects by the creation of groups. The Proposed method is tested for 5500 message objects and compared with other methods such as non-grouping, BGM, RGM, OGM.

• Journal of Technology Innovation
• /
• v.4 no.1
• /
• pp.1-26
• /
• 1996

Traditional studies of new venture performance have focused on the characteristics of entrepreneurs and have shown conflicting results on the relationship between the characteristics and performance of new ventures. Recently, some researchers have broadened their search to include aspects of the industry and the strategy of new ventures. The purposes of this study are to identify wtrategic archetypes of new ventures based on the taxonomic approach and to explain the differences in new venture characteristics and performance among strategic archetypes. To find the strategic archetypes, 114 new venture CEOs from various industries were asked to describe their ventures' competitive strategy through 19 questionnaire items on competitive methods. Using factor analysis and subsequent cluster analysis, four archetypes were identified such as : versatile type, technology-driven type, market-oriented type, and cost reduction type. The results imply that there exist different types of venture strategy even among new technology-based venture firms in Korea, and show the differences in performance among strategic archetypes: market-oriented type and versatile type are better than cost reduction type in terms of growth rate and profitability. Because the venture strategy in identified as a major determinant of the venture performance in this study, the choice of venture strategy suitable for firm's industrial characteristics and internal resource bases becomes a very strategic decision for firm's sustained growth. Further studies are needed to strengthen some methodological limitations of the study.