• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.72-78
• /
• 2017

Prior art search is a core process of technology management performed by inventors and applicants, patent examiners, and employees in the patent industry. As a result of insufficient academic research on a systematic prior art search methodology, the process has been often carried out depending on the subjective judgment of researchers. Previous studies on exploring prior arts based on semantics have also have the risk of underestimating the similarity of major prior arts due to the nature of patent documents where the same technical ideas are expressed in various terms. In this study, we propose an effective prior art search methodology based on hierarchical citation analysis, which provides a clear criterion for selecting core prior arts by calculating weights according to the relative importance of the collected patents. In order to verify the feasibility of the proposed methodology, a case study was conducted to explore the core prior art of one patent in the display field. As a result, 10 core prior art candidates were selected out of the 206 precedent patents.

• Journal of Intelligence and Information Systems
• /
• v.22 no.4
• /
• pp.247-264
• /
• 2016

With the rapid acceleration of low-birth rate and population aging, the employment of the neglected groups of people including the middle aged class is a crucial issue in South Korea. In particular, in the 2010s, the number of the middle aged who want to find a new job after retirement age is significantly increasing with the arrival of the retirement time of the baby boom generation (born 1955-1963). Despite the importance of matching jobs to this emerging middle aged class, private job portals as well as the Korean government do not provide any online job service tailored for them. A gigantic amount of job information is available online; however, the current recruiting systems do not meet the demand of the middle aged class as their primary targets are young workers. We are in dire need of a specially designed recruiting system for the middle aged. Meanwhile, when users are searching the desired occupations on the Worknet website, provided by the Korean Ministry of Employment and Labor, users are experiencing discomfort to search for similar jobs because Worknet is providing filtered search results on the basis of exact matches of a preferred job code. Besides, according to our Worknet data analysis, only about 24% of job seekers had landed on a job position consistent with their initial preferred job code while the rest had landed on a position different from their initial preference. To improve the situation, particularly for the middle aged class, we investigate a soft job matching technique by performing the following: 1) we review a user behavior logs of Worknet, which is a public job recruiting system set up by the Korean government and point out key system design implications for the middle aged. Specifically, we analyze the job postings that include preferential tags for the middle aged in order to disclose what types of jobs are in favor of the middle aged; 2) we develope a new occupation classification scheme for the middle aged, Korea Occupation Classification for the Middle-aged (KOCM), based on the similarity between jobs by reorganizing and modifying a general occupation classification scheme. When viewed from the perspective of job placement, an occupation classification scheme is a way to connect the enterprises and job seekers and a basic mechanism for job placement. The key features of KOCM include establishing the Simple Labor category, which is the most requested category by enterprises; and 3) we design MOMA (Middle-aged Occupation Matching Algorithm), which is a hybrid job matching algorithm comprising constraint-based reasoning and case-based reasoning. MOMA incorporates KOCM to expand query to search similar jobs in the database. MOMA utilizes cosine similarity between user requirement and job posting to rank a set of postings in terms of preferred job code, salary, distance, and job type. The developed system using MOMA demonstrates about 20 times of improvement over the hard matching performance. In implementing the algorithm for a web-based application of recruiting system for the middle aged, we also considered the usability issue of making the system easier to use, which is especially important for this particular class of users. That is, we wanted to improve the usability of the system during the job search process for the middle aged users by asking to enter only a few simple and core pieces of information such as preferred job (job code), salary, and (allowable) distance to the working place, enabling the middle aged to find a job suitable to their needs efficiently. The Web site implemented with MOMA should be able to contribute to improving job search of the middle aged class. We also expect the overall approach to be applicable to other groups of people for the improvement of job matching results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.109-120
• /
• 2006

This paper addresses techniques for predicting a future path of an object moving on a road network. Most prior methods for future prediction mainly focus their attention on objects moving in Euclidean space. A variety of applications such as telematics, however, deal with objects that move only over road networks in most cases, thereby requiring an effective method of future prediction of moving objects on road networks. In this paper, we propose a novel method for predicting a future path of an object by analyzing past trajectories whose changing pattern is similar to that of a current trajectory of a query object. We devise a new function that measures a similarity between trajectories by reflecting the characteristics of road networks. By using this function, we predict a future path of a given moving object as follows: First, we search for candidate trajectories that contain subtrajectories similar to a given query trajectory by accessing past trajectories stored in moving object databases. Then, we predict a future path of a query object by analyzing the moving paths along with a current position to a destination of candidate trajectories thus retrieved. Also, we suggest a method that improves the accuracy of path prediction by regarding moving paths that have just small differences as the same group.

• Reproductive and Developmental Biology
• /
• v.30 no.3
• /
• pp.169-174
• /
• 2006

To search of a new porcine pheromonal odorants, the comparative molecular similarity indices analysis(CoMSIA) between porcine odorant binding protein(pOBP) as receptor and ligands of green odorants 2-(Cyclohexyloxy)tetrahydrofurane derivatives as substrate molecule were conducted and disscused quantitatively. In the optimized CoMSIA model(I-AI) with chirality($I:\;C_{1'}(R),\;C_2(S)$) in substrate molecules and atom based fit alignment(AE) of the odorants the statistical PLS results showed the best predictability of the binding affinities based on the LOO cross-validated value ${r^2}_{cv.}\;(q^2=0.856)$ and non cross-validated conventional coefficient(${r^2}_{ncv.}=0.964)$). The structural distinctions of the highest active molecules were able to understand from the interaction between pOBP and green odorants in the contour maps with CoMSIA model.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.58-63
• /
• 2020

This paper proposes the method for improving the localization accuracy of the mobile robot based on the stereo camera. To restore the position information from stereo images obtained by the stereo camera, the corresponding point which corresponds to one pixel on the left image should be found on the right image. For this, there is the general method to search for corresponding point by calculating the similarity of pixel with pixels on the epipolar line. However, there are some disadvantages because all pixels on the epipolar line should be calculated and the similarity is calculated by only pixel value like RGB color space. To make up for this weak point, this paper implements the method to search for the corresponding point simply by calculating the gap of x-coordinate when the feature points, which are extracted by feature extraction and matched by feature matching method, are a pair and located on the same y-coordinate on the left/right image. In addition, the proposed method tries to preserve the number of feature points as much as possible by finding the corresponding points through the conventional algorithm in case of unmatched features. Because the number of the feature points has effect on the accuracy of the localization. The position of the mobile robot is compensated based on 3-D coordinates of the features which are restored by the feature points and corresponding points. As experimental results, by the proposed method, the number of the feature points are increased for compensating the position and the position of the mobile robot can be compensated more than only feature extraction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1816-1821
• /
• 2016

Protein secondary structure is important for the study of protein evolution, structure and function of proteins which play crucial roles in most of biological processes. This paper try to effectively extract protein secondary structure information from the large protein structure database in order to predict the protein secondary structure of a query protein sequence. To find more remote homologous sequences of a query sequence in the protein database, we used PSI-BLAST which can perform gapped iterative searches and use profiles consisting of homologous protein sequences of a query protein. The secondary structures of the homologous sequences are weighed combined to the secondary structure prediction according to their relative degree of similarity to the query sequence. When homologous sequences with a neural network predictor were used, the accuracies were higher than those of current state-of-art techniques, achieving a Q3 accuracy of 92.28% and a Q8 accuracy of 88.79%.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1045-1061
• /
• 2017

This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying to explicit links and attaching the links to LODs have restrictions on reflecting target LODs' changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ~ 0.8 and depth level of 4 provides searching results that include 91% ~ 98% of the trustworthy links and about 170% of triples expanded.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

• The Plant Pathology Journal
• /
• v.25 no.4
• /
• pp.400-407
• /
• 2009

A pathogenesis-related protein (PgPR5) gene that isolated from the leaf of Panax ginseng was characterized. The ORF is 756 bp with a deduced amino acid sequence of 251 residues. The calculated molecular mass of the matured protein is approximately 27.5 kDa with a predicated isoelectric point of 7.80. A GenBank BlastX search revealed that the deduced amino acid of PgPR5 shares highest sequence similarity to PR5 of Actinidia deliciosa (80% identity, 87% similarity). PgPR5 has a C-terminal and N-terminal signal peptide, suggesting that it is a vacuolar secreted protein. The expression of PgPR5 under various environmental stresses was analyzed at different time points using real-time PCR. Our results reveal that PgPR5 is induced by salt stress, chilling stress, heavy metal, UV, and pathogen infection. These results suggest that the PgPR5 could play a role in the molecular defence response of ginseng to abiotic and pathogen attack. This is the first report of the isolation of PR5 gene from the P. ginseng.