• International Journal of Advanced Culture Technology
• /
• 제7권3호
• /
• pp.92-96
• /
• 2019

This study analyzes the problems of fire qualification information websites and job search websites due to incomplete information in the job search process and suggests an improvement plan. It has been confirmed that the main reason for the cost of job searching is incomplete information required for a job search and job search through existing analysis. As a result, it is suggested to construct a smooth information system for economic entities and to provide easy access to information by mitigating the incompleteness of information. Based on this, analysis of the problems of Korean qualifications in the firefighting realm reveals that there is a qualification holder information and a job information site, and a qualification holder management system is established but only information of either qualification acquisition information or employment information is provided. In addition, it is easy to access information through a qualification acquisition information and employment information site via the Internet, but there are inconveniences that qualification acquisition information and employment information are dualized. In order to improve this, it is necessary to build a new customized integrated qualification management system that covers existing Q-net qualification acquisition information and worknet employment information.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• Interdisciplinary Bio Central
• /
• 제1권3호
• /
• pp.9.1-9.6
• /
• 2009

Introduction: In the mass spectrometry-based proteomics, biological samples are analyzed to identify proteins by mass spectrometer and database search. Database search is the process to select the best matches to the experimental mass spectra among the amino acid sequence database and we identify the protein as the matched sequence. The match score is defined to find the matches from the database and declare the highest scored hit as the most probable protein. According to the score definition, search result varies. In this study, the difference among search results of different search engines or different databases was investigated, in order to suggest a better way to identify more proteins with higher reliability. Materials and Methods: The protein extract of human mesenchymal stem cell was separated by several bands by one-dimensional electrophorysis. One-dimensional gel was excised one by one, digested by trypsin and analyzed by a mass spectrometer, FT LTQ. The tandem mass (MS/MS) spectra of peptide ions were applied to the database search of X!Tandem, Mascot and Sequest search engines with IPI human database and SwissProt database. The search result was filtered by several threshold probability values of the Trans-Proteomic Pipeline (TPP) of the Institute for Systems Biology. The analysis of the output which was generated from TPP was performed. Results and Discussion: For each MS/MS spectrum, the peptide sequences which were identified from different conditions such as search engines, threshold probability, and sequence database were compared. The main difference of peptide identification at high threshold probability was caused by not the difference of sequence database but the difference of the score. As the threshold probability decreases, the missed peptides appeared. Conversely, in the extremely high threshold level, we missed many true assignments. Conclusion and Prospects: The different identification result of the search engines was mainly caused by the different scoring algorithms. Usually in proteomics high-scored peptides are selected and low-scored peptides are discarded. Many of them are true negatives. By integrating the search results from different parameter and different search engines, the protein identification process can be improved.

• Journal of Information Processing Systems
• /
• 제14권5호
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Journal of Information Technology Applications and Management
• /
• 제13권4호
• /
• pp.121-140
• /
• 2006

UDDI (Universal Discovery Description and Integration) Registry is used for Web Services registration and search. UDDI offers the search result to the keyword-based query. UDDI supports WSDL registration but it does not supports WSDL search. So it is required that contents based search and ranking using name and description in UDDI registration information and WSDL. This paper proposes a retrieval engine considering contents of services registered in the UDDI and WSDL. It uses Vector Space Model for similarity comparison between contents of those. UDDI registry information hierarchy and WSDL hierarchy are considered during searching process. This engine suppports two discovery methods. One is Keyword-based search and the other is template-based search supporting ranking for user's query. Template-based search offers how service interfaces correspond to the query for WSDL documents. Proposed retrieval engine can offer search result more accurately than one which UDDI offers and it can retrieve WSDL which is registered in UDDI in detail.

• 인지과학
• /
• 제25권3호
• /
• pp.211-232
• /
• 2014

사람들은 하루에도 수없이 어떤 물체나 사람을 찾는다. 이때 찾아야 하는 대상이 무엇인가 하는 정보 외에도 그 대상이 가지고 있는 지각적 정보도 시각탐색에 영향을 줄 수 있다. 본 연구에서는 안구운동추적기를 사용하여 탐색 목표를 알려주는 사전제시 자극의 크기 정보가 시각탐색과정에 영향을 주는지를 알아 보고자 하였다. 실험참가자는 화면가운데 제시된 특정 기호 자극(사전제시 자극)을 먼저 확인하고, 이후 화면 주변에 원형으로 제시된 8개의 자극들(탐색 디스플레이) 중 그 자극(목표자극)을 찾아 그 크기가 사전제시시와 동일한지 혹은 달라졌는지를 판단하는 과제를 실시하였다. 실험조건은 탐색 디스플레이가 모두 동일한 크기를 가진 항목들로 이루어졌는지 여부(동질적 디스플레이/이질적 디스플레이)와 목표자극의 사전제시시 크기(큼/작음)와 탐색시 크기(큼/작음)에 따라 8개의 피험자내 조건으로 구성되었다. 연구가설은 탐색 함목들이 다른 크기를 가진 이질적 디스플레이 조건에서 실험참가자는 사전제시 자극의 크기 정보와 일치하는 항목들을 먼저 살펴볼 전략을 사용할 것이라고 예측하였다. 실험결과, 과제수행 반응시간에서 탐색 디스플레이의 주효과, 목표자극의 탐색시 크기 주효과, 그리고 디스플레이 조건에 따라 다른 목표자극의 사전제시시와 탐색시 크기의 일치성 효과가 관찰되었다. 안구운동 측정치들을 분석한 결과, 그 첫 도약이 탐색 목표자극으로 향한 비율(Initial Saccade to Target Ratio)에서 반응시간과 유사하게 탐색 디스플레이 조건에 따라 목표자극의 크기 일치성 효과가 각각 달리 나타났다. 즉, 목표자극의 크기의 일치성 효과는 이질적 디스플레이 조건에서만 관찰되었는데, 이는 실험참가자들이 목표자극의 크기 정보를 바탕으로 탐색 항목들 중 사전 목표자극의 크기와 같은 항목들에게 먼저 주의를 기울였음을 나타낸다. 사후 분석 결과, 목표자극의 크기가 일관될 때는 이질적 디스플레이 조건의 안구움직임과 과제수행이 동질적 디스플레이 조건 보다 조금 더 빨랐으나, 목표 자극의 크기가 달라질 때는 오히려 더 느려졌음을 알 수 있었다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제15권4호
• /
• pp.267-275
• /
• 2011

This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.

• 소성∙가공
• /
• 제6권5호
• /
• pp.416-424
• /
• 1997

In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.