• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.339-348
• /
• 2004

Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1003-1010
• /
• 2004

In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.6
• /
• pp.505-510
• /
• 2016

This paper presents a searching method of corresponding points robust to rotational error for scan-matching used for SLAM(Simultaneous Localization and Mapping) in mobile robot. A differential driving mechanism is one of the most popular type for mobile robot. For driving curved path, this type controls the velocities of each two wheels independently. This case increases a wheel slip of the mobile robot more than the case of straight path driving. And this is the reason of a drifting problem. To handle this problem and improves the performance of scan-matching, this paper proposes a searching method of corresponding points using extraction of a closest point based on rotational radius of the mobile robot. To verify the proposed method, the experiment was conducted using LRF(Laser Range Finder). Then the proposed method is compared with an existing method, which is an existing method based on euclidian closest point. The result of our study reflects that the proposed method can improve the performance of searching corresponding points.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.16-25
• /
• 2005

In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency

• Journal of Korean Society for Quality Management
• /
• v.29 no.3
• /
• pp.124-137
• /
• 2001

In general, it is very efficient and effective to use screening variables that are correlated with the performance variable in case that measuring the performance variable is impossible (destructive) or expensive. The general methodology for searching surrogate variables is regression analysis. This paper considers the inspection problem in CRT (Cathode Ray Tube) production line, in which the performance variable (dependent variable) is binary type and screening variables are continuous. The general regression with dummy variable, discriminant analysis and binary logistic regression are considered. The cost model is also formulated to determine economically inspection procedure with screening variables.

• Journal of Engineering Education Research
• /
• v.20 no.5
• /
• pp.59-73
• /
• 2017

This study aims to examine whether a gender works to make the difference on the university experiences of natural sciences and engineering major students; and the income and quality gap between the graduates. In this study, university experiences means job market and job searching related experiences such as job fair attending, The main research questions are as follows; fist, what are the significant university experiences related job preparation and application, and is there a gender gap on those experiences? Second, how is the job market performance of the national sciences and engineering graduates for their income level and quality job, and is there a gender gap on the job market performance of the sample? Third, which variables among the university experiences for job searching and application impacts the job quality and income level of the natural sciences and engineering graduates? To find out the research results, this study conducts a panel data analysis with GOMS (Graduates Occupational Mobility Survey) throughout survey year of 2006 to 2015, towards 568,264 as weighted value number. As analysis methods, this study carries out a descriptive analysis, ANOVA, discriminant analysis, linear regression and T-test. Therefore, here are the brief outputs of the study; first, for natural sciences and engineering students, the off-campus experiences such as job fair, job recruit festival and internship programs are more favored; second, female students are more likely to attend personal and self-driven job preparation programs; third, on job market performance, the graduates' income level and company scale rate are higher in the male but job stability is higher in the female; fourth, as a result of the linear regression, gender factor decides the income level in considerable degree; additionally, gender factor shows the difference of the job satisfaction and self-effectiveness on one's job as a qualitative variables. For obtaining strictness, university program factors are controlled through model fitness process. As above, this study finds out the main factors of university life of natural sciences and engineering graduates which are related their job searching and preparation experiences and figures out stronger factors in job market; and examines the statistically significance of the gender in this casual-effect relationship between job preparation and job quality of the graduates.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.251-260
• /
• 2006

Homology searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, proteins distant in an evolutionary history do not conserve amino acid residue arrangements, while preserving their structures. Therefore, homology searching on proteins' secondary structure is quite important in finding out distant homology. In this manuscript, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. CSI was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1129-1135
• /
• 1999

isolated word recognition using the Dynamic Time warping algorithm has shown good recognition rate on speaker dependent environment. But, practically, since the searching time of the dynamic Time Warping algorithm is rapidly increased as searching data is increased. it is hard to implement. In the context-dependent-short-query system such as educational children's workbook on the Web, the number of responses to the specific questions is limited. Therefore, the searching space for the answers can be reduced depending on the questions. In this paper, low cost implementation method using DTW for the Web has been proposed. To cover the weakness of DTW, the searching space is reduced by the context. the searching space, depends on the specific questions, is chosen from interest searchable candidates. In the real implementation, the proposed method show better performance of both time and recognition rate.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.69-78
• /
• 2005

As the study and use of P2P systems are diversified, the effect of excessive amount of traffic, which occurs in searching peers' resource and is considered as a network bandwidth Problem, cannot let the matter Pass without making a protest. In case P2P application doesn't reduce network traffic, it can be much effected to use bandwidth smoothly in the internet environment where various network applications lie scattered and there will be inconvenience when many network users makes use of related applications . In this Paper, we propose a pure P2P model based-broadcasting technique for producing successful hit ratio and traffic amount in the weakly connected environment based-P2P system where situation of peers' connection and exit is ambiguous . The proposed searching technique is designed/implemented to improve a resident problem in the related system and we have estimated the performance of the proposed searching technique comparing our technique with the existing broadcasting based-searching technique .

• Journal of the Ergonomics Society of Korea
• /
• v.27 no.4
• /
• pp.15-26
• /
• 2008

Recently, Internet Protocol TV technology has a latent power for searching information by using internet-connected interactive TV media. It is hard to browse and search web site conveniently since the visual and input devices are not sufficient for navigating through the websites. Zoomable user interface is a possible solution that may reduce users' task load and improve their performance. In this paper, we made three types of web browsers as scroll, physical zooming and semantic zooming type. Fifteen participants asked to do searching tasks and their task time, accuracy and subjective responses are recorded. In the result, though scroll type is evaluated more efficient than other types in task time and accuracy since participants are familiar with scroll type interface, semantic zooming type is highly rated in subjective responses such as perceived searching efficiency, satisfaction and joyfulness. This result implied semantic zooming is a possible solution which is improving user experience of searching websites using Internet Protocol TV.