• Title/Summary/Keyword: candidate order approach

Search Result 73, Processing Time 0.023 seconds

Solving the Constrained Job Sequencing Problem using Candidate Order based Tabu Search (후보순위 기반 타부 서치를 이용한 제약 조건을 갖는 작업 순서결정 문제 풀이)

  • Jeong, Sung-Wook;Kim, Jun-Woo
    • The Journal of Information Systems
    • /
    • v.25 no.1
    • /
    • pp.159-182
    • /
    • 2016
  • Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

Application of Candidate Order Approach for Solving Job Sequencing Problem with Finish Date Constraint (완료 시간 제약이 있는 작업 순서 결정 문제 풀이를 위한 후보 순위 접근법 응용)

  • Kim, Jun Woo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2018.07a
    • /
    • pp.421-422
    • /
    • 2018
  • 작업 순서 결정 문제의 목표는 다양한 작업들에 대한 최적의 처리 순서를 결정하여 총 처리시간이나 납기 지연과 관련된 지표들을 최소화하는 것이다. 나아가, 실제 생산 현장에서는 작업 처리 순서를 결정할 때, 긴급도나 고객과의 관계 등과 같은 요인을 고려하여 일부 작업들을 특정 시간 내에 완료해야 할 수 있으며, 이 같은 제약 조건을 완료 시간 제약이라 한다. 본 논문에서는 완료 시간 제약을 갖는 작업 순서 결정 문제의 개념과 특성에 대해 살펴보고, 이러한 문제를 풀이하기 위한 알고리즘 개발에 후보 순위 접근법을 적용할 것을 제안한다.

  • PDF

Design of a Korean Character Vehicle License Plate Recognition System (퍼지 ARTMAP에 의한 한글 차량 번호판 인식 시스템 설계)

  • Xing, Xiong;Choi, Byung-Jae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.2
    • /
    • pp.262-266
    • /
    • 2010
  • Recognizing a license plate of a vehicle has widely been issued. In this thesis, firstly, mean shift algorithm is used to filter and segment a color vehicle image in order to get candidate regions. These candidate regions are then analyzed and classified in order to decide whether a candidate region contains a license plate. We then present an approach to recognize a vehicle's license plate using the Fuzzy ARTMAP neural network, a relatively new architecture of the neural network family. We show that the proposed system is well to recognize the license plate and shows some compute simulations.

DISCOVERY TEMPORAL FREQUENT PATTERNS USING TFP-TREE

  • Jin Long;Lee Yongmi;Seo Sungbo;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.454-457
    • /
    • 2005
  • Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

  • PDF

Definition Sentences Recognition Based on Definition Centroid

  • Kim, Kweon-Yang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.6
    • /
    • pp.813-818
    • /
    • 2007
  • This paper is concerned with the problem of recognizing definition sentences. Given a definition question like "Who is the person X?", we are to retrieve the definition sentences which capture descriptive information correspond variously to a person's age, occupation, of some role a person played in an event from the collection of news articles. In order to retrieve as many relevant sentences for the definition question as possible, we adopt a centroid based statistical approach which has been applied in summarization of multiple documents. To improve the precision and recall performance, the weight measure of centroid words is supplemented by using external knowledge resource such as Wikipedia and redundant candidate sentences are removed from candidate definitions. We see some improvements obtained by our approach over the baseline for 20 IT persons who have high document frequency.

Detection of Pavement Region with Structural Patterns through Adaptive Multi-Seed Region Growing (적응적 다중 시드 영역 확장법을 이용한 구조적 패턴의 보도 영역 검출)

  • Weon, Sun-Hee;Joo, Sung-Il;Na, Hyeon-Suk;Choi, Hyung-Il
    • The KIPS Transactions:PartB
    • /
    • v.19B no.4
    • /
    • pp.209-220
    • /
    • 2012
  • In this paper, we propose an adaptive pavement region detection method that is robust to changes of structural patterns in a natural scene. In order to segment out a pavement reliably, we propose two step approaches. We first detect the borderline of a pavement and separate out the candidate region of a pavement using VRays. The VRays are straight lines starting from a vanishing point. They split out the candidate region that includes the pavement in a radial shape. Once the candidate region is found, we next employ the adaptive multi-seed region growing(A-MSRG) method within the candidate region. The A-MSRG method segments out the pavement region very accurately by growing seed regions. The number of seed regions are to be determined adaptively depending on the encountered situation. We prove the effectiveness of our approach by comparing its performance against the performances of seed region growing(SRG) approach and multi-seed region growing(MSRG) approach in terms of the false detection rate.

A Study on Optimal Site Selection for the Artificial Recharge System Installation Using TOPSIS Algorithm

  • Lee, Jae One;Seo, Minho
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.2
    • /
    • pp.161-169
    • /
    • 2016
  • This paper is intended to propose a novel approach to select an optimal site for a small-scaled artificial recharge system installation using TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) with geospatial data. TOPSIS is a MCDM (Multi-Criteria Decision Making) method to choose the preferred one of derived alternatives by calculating the relative closeness to an ideal solution. For applying TOPSIS, in the first, the topographic shape representing optimal recovery efficiency is defined based on a hydraulic model experiment, and then an appropriate surface slope is determined for the security of a self-purification capability with DEM (Digital Elevation Model). In the second phase, the candidate areas are extracted from an alluvial map through a morphology operation, because local alluvium with a lengthy and narrow shape could be satisfied with a primary condition for the optimal site. Thirdly, a shape file over all candidate areas was generated and criteria and their values were assigned according to hydrogeologic attributes. Finally, TOPSIS algorithm was applied to a shape file to place the order preference of candidate sites.

A whole genomic scan to detect selection signatures between Berkshire and Korean native pig breeds

  • Edea, Zewdu;Kim, Kwan-Suk
    • Journal of Animal Science and Technology
    • /
    • v.56 no.7
    • /
    • pp.23.1-23.7
    • /
    • 2014
  • Background: Scanning of the genome for selection signatures between breeds may play important role in understanding the underlie causes for observable phenotypic variations. The discovery of high density single nucleotide polymorphisms (SNPs) provide a useful starting point to perform genome-wide scan in pig populations in order to identify loci/candidate genes underlie phenotypic variation in pig breeds and facilitate genetic improvement programs. However, prior to this study genomic region under selection in commercially selected Berkshire and Korean native pig breeds has never been detected using high density SNP markers. To this end, we have genotyped 45 animals using Porcine SNP60 chip to detect selection signatures in the genome of the two breeds by using the $F_{ST}$ approach. Results: In the comparison of Berkshire and KNP breeds using the FDIST approach, a total of 1108 outlier loci (3.48%) were significantly different from zero at 99% confidence level with 870 of the outlier SNPs displaying high level of genetic differentiation ($F_{ST}{\geq}0.490$). The identified candidate genes were involved in a wide array of biological processes and molecular functions. Results revealed that 19 candidate genes were enriched in phosphate metabolism (GO: 0006796; ADCK1, ACYP1, CAMK2D, CDK13, CDK13, ERN1, GALK2, INPP1; MAK, MAP2K5, MAP3K1, MAPK14, P14KB, PIK3C3, PRKC1, PTPRK, RNASEL, THBS1, BRAF, VRK1). We have identified a set of candidate genes under selection and have known to be involved in growth, size and pork quality (CART, AGL, CF7L2, MAP2K5, DLK1, GLI3, CA3 and MC3R), ear morphology and size (HMGA2 and SOX5) stress response (ATF2, MSRB3, TMTC3 and SCAF8) and immune response (HCST and RYR1). Conclusions: Some of the genes may be used to facilitate genetic improvement programs. Our results also provide insights for better understanding of the process and influence of breed development on the pattern of genetic variations.

Disaster Recovery Priority Decision of Total Information System for Port Logistics : Fuzzy TOPSIS Approach (항만물류종합정보시스템의 재난복구 우선순위결정 : 퍼지 TOPSIS 접근방법)

  • Kim, Ki-Yoon;Kim, Do-Hyeong
    • Journal of Information Technology Services
    • /
    • v.11 no.3
    • /
    • pp.1-16
    • /
    • 2012
  • This paper is aimed to present a fuzzy decision-making approach to deal with disaster recovery priority decision problem in information system. We derive an evaluation approach based on TOPSIS(Technique for Order Performance by Similarity to Ideal Solution), to help disaster recovery priority decision of total information system for port logistics in a fuzzy environment where the vagueness and subjectivity are handled with linguistic terms parameterized by trapezoidal fuzzy numbers. This study applies the fuzzy multi-criteria decision-making method to determine the importance weight of evaluation criteria and to synthesize the ratings of candidate disaster recovery system. Aggregated the evaluators' attitude toward preference, then TOPSIS is employed to obtain a crisp overall performance value for each alternative to make a final decision. This approach is demonstrated with a real case study involving 4 evaluation criteria(system dependence, RTO, loss, alternative business support), 7 information systems for port logistics assessed by 5 evaluators from Maritime Affairs and Port Office.

A Framework for Human Body Parts Detection in RGB-D Image (RGB-D 이미지에서 인체 영역 검출을 위한 프레임워크)

  • Hong, Sungjin;Kim, Myounggyu
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.12
    • /
    • pp.1927-1935
    • /
    • 2016
  • This paper propose a framework for human body parts in RGB-D image. We conduct tasks of obtaining person area, finding candidate areas and local detection in order to detect hand, foot and head which have features of long accumulative geodesic distance. A person area is obtained with background subtraction and noise removal by using depth image which is robust to illumination change. Finding candidate areas performs construction of graph model which allows us to measure accumulative geodesic distance for the candidates. Instead of raw depth map, our approach constructs graph model with segmented regions by quadtree structure to improve searching time for the candidates. Local detection uses HOG based SVM for each parts, and head is detected for the first time. To minimize false detections for hand and foot parts, the candidates are classified with upper or lower body using the head position and properties of geodesic distance. Then, detect hand and foot with the local detectors. We evaluate our algorithm with datasets collected Kinect v2 sensor, and our approach shows good performance for head, hand and foot detection.