• Title/Summary/Keyword: Optimal candidate

Search Result 380, Processing Time 0.025 seconds

Location Selection of an LNG Bunkering Port in Korea

  • Lu, Wen;Seo, Jeong-Ho;Yeo, Gi-Tae
    • Journal of Korea Trade
    • /
    • v.23 no.2
    • /
    • pp.59-75
    • /
    • 2019
  • Purpose - The International Maritime Organization (IMO) has promulgated strict regulations on emissions in the maritime shipping industry. LNG (Liquefied Natural Gas) is, therefore, recognized as the optimal fuel alternative solution. The aim of this study is to select the most suitable location for an LNG bunkering port. This is formulated as a multiple-criteria ranking problem regarding four candidate ports in South Korea: the ports of Busan, Gwangyang, Incheon, and Ulsan. Design/Methodology/approach - An analysis employing the Consistent Fuzzy Preference Relation (CFPR) methodology is carried out, and the multiple-criteria evaluation of various factors influencing the location selection, such as the average loading speed of LNG, the number of total ships, the distance of the bunkering shuttle, and the degree of safety is performed. Then, based on the combination of both the collected real data and experts' preferences, the final ranking of the four ports is formulated. Findings - The port of Busan ranks first, followed by the ports of Gwangyang and Ulsan, with the port of Incheon last on the list. Originality/value - The Korean government could proceed with a clear vision of the candidate ports' ranking in terms of the LNG bunkering terminal selection problem.

Efficient DRG Fraud Candidate Detection Method Using Data Mining Techniques (데이터마이닝 기법을 이용한 효율적인 DRG 확인심사대상건 검색방법)

  • Lee, Jung-Kyu;Jo, Min-Woo;Park, Ki-Dong;Lee, Moo-Song;Lee, Sang-Il;Kim, Chang-Yup;Kim, Yong-Ik;Hong, Du-Ho
    • Journal of Preventive Medicine and Public Health
    • /
    • v.36 no.2
    • /
    • pp.147-152
    • /
    • 2003
  • Objectives : To develop a Diagnosis-Related Group (DRG) fraud candidate detection method, using data mining techniques, and to examine the efficiency of the developed method. Methods ; The Study included 79,790 DRGs and their related claims of 8 disease groups (Lens procedures, with or without, vitrectomy, tonsillectomy and/or adenoidectomy only, appendectomy, Cesarean section, vaginal delivery, anal and/or perianal procedures, inguinal and/or femoral hernia procedures, uterine and/or adnexa procedures for nonmalignancy), which were examined manually during a 32 months period. To construct an optimal prediction model, 38 variables were applied, and the correction rate and lift value of 3 models (decision tree, logistic regression, neural network) compared. The analyses were peformed separately by disease group. Results : The correction rates of the developed method, using data mining techniques, were 15.4 to 81.9%, according to disease groups, with an overall correction rate of 60.7%. The lift values were 1.9 to 7.3 according to disease groups, with an overall lift value of 4.1. Conclusions : The above findings suggested that the applying of data mining techniques is necessary to improve the efficiency of DRG fraud candidate detection.

A Vehicle License Plate Detection Scheme Using Spatial Attentions for Improving Detection Accuracy in Real-Road Situations

  • Lee, Sang-Won;Choi, Bumsuk;Kim, Yoo-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.93-101
    • /
    • 2021
  • In this paper, a vehicle license plate detection scheme is proposed that uses the spatial attention areas to detect accurately the license plates in various real-road situations. First, the previous WPOD-NET was analyzed, and its detection accuracy is evaluated as lower due to the unnecessary noises in the wide detection candidate areas. To resolve this problem, a vehicle license plate detection model is proposed that uses the candidate area of the license plate as a spatial attention areas. And we compared its performance to that of the WPOD-NET, together with the case of using the optimal spatial attention areas using the ground truth data. The experimental results show that the proposed model has about 20% higher detection accuracy than the original WPOD-NET since the proposed scheme uses tight detection candidate areas.

Optimization of Post-Processing for Subsequence Matching in Time-Series Databases (시계열 데이터베이스에서 서브시퀀스 매칭을 위한 후처리 과정의 최적화)

  • Kim, Sang-Uk
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.555-560
    • /
    • 2002
  • Subsequence matching, which consists of index searching and post-processing steps, is an operation that finds those subsequences whose changing patterns are similar to that of a given query sequence from a time-series database. This paper discusses optimization of post-processing for subsequence matching. The common problem occurred in post-processing of previous methods is to compare the candidate subsequence with the query sequence for discarding false alarms whenever each candidate subsequence appears during index searching. This makes a sequence containing candidate subsequences to be accessed multiple times from disk, and also have a candidate subsequence to be compared with the query sequence multiple times. These redundancies cause the performance of subsequence matching to degrade seriously. In this paper, we propose a new optimal method for resolving the problem. The proposed method stores ail the candidate subsequences returned by index searching into a binary search tree, and performs post-processing in a batch fashion after finishing the index searching. By this method, we are able to completely eliminate the redundancies mentioned above. For verifying the performance improvement effect of the proposed method, we perform extensive experiments using a real-life stock data set. The results reveal that the proposed method achieves 55 times to 156 times speedup over the previous methods.

Comparative evaluation to select optimal adjuvant of novel type Salmonella Typhimurium inactivated bacteria for protecting Salmonella infections in a murine model (마우스에서 살모넬라 감염증 예방을 위한 신개념 Salmonella Typhimurium 불활화 사균체에 최적 adjuvant 선택을 위한 효능 비교 시험)

  • Moon, Ja-Young;Ochirkhuyag, Enkhsaikhan;Kim, Won-Kyong;Lee, Jun-Woo;Jo, Young-Gyu;Kwak, Kil Han;Park, Byung Yong;Hur, Jin
    • Korean Journal of Veterinary Service
    • /
    • v.43 no.2
    • /
    • pp.89-97
    • /
    • 2020
  • This study was carried out to examine a novel inactivated Salmonella Typhimurium (S. Typhimurium) vaccine candidate for protection of mice against salmonellosis by immunization of BALB/c mice using various type adjuvant. The novel type-inactivated vaccine candidate was constructed by adding Chlorhexidine digluconate solution. BALB/c mice were divided into 6 groups of 15 mice apiece. The mice were intramuscularly (IM) primed at 6 weeks of age and were IM boosted 8 weeks of age. Groups A and B mice were injected with sterile phosphate-buffered saline as controls; group C mice were inoculated with 5×108 cells/100 µL of formalin-inactivated S. Typhimurium cells and adjuvant ISA70; groups D~F mice were immunized with 5×108 cells/100 µL of the inactivated vaccine candidate and adjuvant ISA70, adjuvant IMS1313 and adjuvant IMS1313 containing 30 ㎍/mL of GI24, respectively. All mice (except group A mice) were orally challenged with a virulent S. Typhimurium strain at 10 weeks of age. Mice from groups C-F had significantly increased IgG levels compared to control groups (A-B) mice. The levels of splenocyte IFN-γ and IL-4 in mice of all groups were measured by ELISA, resulting in increased immunity in group F mice compared to those of groups A-E mice. These data suggested that systemic and cell-mediated immune responses were highly induced by IM immunization with the vaccine candidate and adjuvant IMS1313 containing GI24. Furthermore, clinical signs such as death were observed in only 20% of group F mice after virulent Salmonella strain challenge, however, groups B and C (100%), and groups D and E (60%) mice died. This data suggested that mice immunized by intramuscular prime and booster with this vaccine candidate and adjuvant IMS1313 containing GI24 effectively protected mice from salmonellosis.

Energy-efficient Buffer-aided Optimal Relay Selection Scheme with Power Adaptation and Inter-relay Interference Cancellation

  • Xu, Xiaorong;Li, Liang;Yao, Yingbiao;Jiang, Xianyang;Hu, Sanqing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5343-5364
    • /
    • 2016
  • Considering the tradeoff between energy consumption and outage behavior in buffer-aided relay selection, a novel energy-efficient buffer-aided optimal relay selection scheme with power adaptation and Inter-Relay Interference (IRI) cancellation is proposed. In the proposed scheme, energy consumption minimization is the objective with the consideration of relay buffer state, outage probability and relay power control, in order to eliminate IRI. The proposed scheme selects a pair of optimal relays from multiple candidate relays, denoted as optimal receive relay and optimal transmit relay respectively. Source-relay and relay-destination communications can be performed within a time-slot, which performs as Full-Duplex (FD) relaying. Markov chain model is applied to analyze the evolution of relay buffer states. System steady state outage probability and achievable diversity order are derived respectively. In addition, packet transmission delay and power reduction performance are investigated with a specific analysis. Numerical results show that the proposed scheme outperforms other relay selection schemes in terms of outage behavior with power adaptation and IRI cancellation in the same relay number and buffer size scenario. Compared with Buffer State relay selection method, the proposed scheme reduces transmission delay significantly with the same amount of relays. Average transmit power reduction can be implemented to relays with the increasing of relay number and buffer size, which realizes the tradeoff between energy-efficiency, outage behavior and delay performance in green cooperative communications.

Evaluation of the Geometric Accuracy of Anatomic Landmarks as Surrogates for Intrapulmonary Tumors in Image-guided Radiotherapy

  • Li, Hong-Sheng;Kong, Ling-Ling;Zhang, Jian;Li, Bao-Sheng;Chen, Jin-Hu;Zhu, Jian;Liu, Tong-Hai;Yin, Yong
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.5
    • /
    • pp.2393-2398
    • /
    • 2012
  • Objectives: The purpose of this study was to evaluate the geometric accuracy of thoracic anatomic landmarks as target surrogates of intrapulmonary tumors for manual rigid registration during image-guided radiotherapy (IGRT). Methods: Kilovolt cone-beam computed tomography (CBCT) images acquired during IGRT for 29 lung cancer patients with 33 tumors, including 16 central and 17 peripheral lesions, were analyzed. We selected the "vertebrae", "carina", and "large bronchi" as the candidate surrogates for central targets, and the "vertebrae", "carina", and "ribs" as the candidate surrogates for peripheral lesions. Three to six pairs of small identifiable markers were noted in the tumors for the planning CT and Day 1 CBCT. The accuracy of the candidate surrogates was evaluated by comparing the distances of the corresponding markers after manual rigid matching based on the "tumor" and a particular surrogate. Differences between the surrogates were assessed using 1-way analysis of variance and post hoc least-significant-difference tests. Results: For central targets, the residual errors increased in the following ascending order: "tumor", "bronchi", "carina", and "vertebrae"; there was a significant difference between "tumor" and "vertebrae" (p = 0.010). For peripheral diseases, the residual errors increased in the following ascending order: "tumor", "rib", "vertebrae", and "carina"; There was a significant difference between "tumor" and "carina" (p = 0.005). Conclusions: The "bronchi" and "carina" are the optimal surrogates for central lung targets, while "rib" and "vertebrae" are the optimal surrogates for peripheral lung targets for manual matching of online and planned tumors.

A Two-tier Optimization Approach for Decision Making in Many-objective Problems (고도 다목적 문제에서의 의사 결정을 위한 이중 최적화 접근법)

  • Lee, Ki-Baek
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.7
    • /
    • pp.21-29
    • /
    • 2015
  • This paper proposes a novel two-tier optimization approach for decision making in many-objective problems. Because the Pareto-optimal solution ratio increases exponentially with an increasing number of objectives, simply finding the Pareto-optimal solutions is not sufficient for decision making in many-objective problems. In other words, it is necessary to discriminate the more preferable solutions from the other solutions. In the proposed approach, user preference-oriented as well as diverse Pareto-optimal solutions can be obtained as candidate solutions by introducing an additional tier of optimization. The second tier of optimization employs the corresponding secondary objectives, global evaluation and crowding distance, which were proposed in previous works, to represent the users preference to a solution and the crowdedness around a solution, respectively. To demonstrate the effectiveness of the proposed approach, decision making for some benchmark functions is conducted, and the outcomes with and without the proposed approach are compared. The experimental results demonstrate that the decisions are successfully made with consideration of the users preference through the proposed approach.

Fast Motion Estimation Algorithm using Selection of Candidates and Stability of Optimal Candidates (후보 선별과 최적후보 안정성을 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong Nam
    • Journal of Broadcast Engineering
    • /
    • v.23 no.5
    • /
    • pp.628-635
    • /
    • 2018
  • In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

Analysis on Optimal Threshold Value for Infrared Video Flame Detection (적외선 영상의 화염 검출을 위한 최적 문턱치 분석)

  • Jeong, Soo-Young;Kim, Won-Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.8 no.4
    • /
    • pp.100-104
    • /
    • 2013
  • In this paper, we present an optimal threshold setting method for flame detection of infrared thermal image. Conventional infrared flame detection methods used fixed intensity threshold to segment candidate flame regions and further processing is performed to decide correct flame detection. So flame region segmentation step using the threshold is important processing for fire detection algorithm. The threshold should be change in input image depends on camera types and operation conditions. We have analyzed the conventional thresholds composed of fixed-intensity, average, standard deviation, maximum value. Finally, we extracted that the optimal threshold value is more than summation of average and standard deviation, and less than maximum value. it will be enhance flame detection rate than conventional fixed-threshold method.