• Title/Summary/Keyword: Probability Search

Search Result 322, Processing Time 0.027 seconds

Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs

  • Hirakawa, Yasuhiro;Ishigaki, Aya
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.2
    • /
    • pp.134-139
    • /
    • 2011
  • The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems

  • Jang, Se-Hwan;Roh, Jae-Hyung;Kim, Wook;Sherpa, Tenzi;Kim, Jin-Ho;Park, Jong-Bae
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.2
    • /
    • pp.174-181
    • /
    • 2011
  • This paper proposes a novel binary ant colony optimization (NBACO) method. The proposed NBACO is based on the concept and principles of ant colony optimization (ACO), and developed to solve the binary and combinatorial optimization problems. The concept of conventional ACO is similar to Heuristic Dynamic Programming. Thereby ACO has the merit that it can consider all possible solution sets, but also has the demerit that it may need a big memory space and a long execution time to solve a large problem. To reduce this demerit, the NBACO adopts the state probability matrix and the pheromone intensity matrix. And the NBACO presents new updating rule for local and global search. The proposed NBACO is applied to test power systems of up to 100-unit along with 24-hour load demands.

Improving Phoneme Recognition based on Gaussian Model using Bhattacharyya Distance Measurement Method (바타챠랴 거리 측정 기법을 사용한 가우시안 모델 기반 음소 인식 향상)

  • Oh, Sang-Yeob
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.85-93
    • /
    • 2011
  • Previous existing vocabulary recognition programs calculate general vector values from a database, so they can not process phonemes that form during a search. And because they can not create a model for phoneme data, the accuracy of the Gaussian model can not secure. Therefore, in this paper, we recommend use of the Bhattacharyya distance measurement method based on the features of the phoneme-thus allowing us to improve the recognition rate by picking up accurate phonemes and minimizing recognition of similar and erroneous phonemes. We test the Gaussian model optimization through share continuous probability distribution, and we confirm the heighten recognition rate. The Bhattacharyya distance measurement method suggest in this paper reflect an average 1.9% improvement in performance compare to previous methods, and it has average 2.9% improvement based on reliability in recognition rate.

Characteristics of automatic positioning transmitter (APT)using satellite on life jacket to minimize casualties of fisherman (어선원 인명피해 최소화를 위한 구명동의용 위성자동위치발신기의 특성)

  • Kim, Seok-Jae;Kim, Wook-Sung;Lee, Yoo-Won
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.48 no.3
    • /
    • pp.235-241
    • /
    • 2012
  • The efficiency tests of automatic positioning transmitter (APT) using satellite on life jacket were carried out to minimize casualties of fishermen and to make system optimization for effective SAR (Search and Rescue) operation. As the result of the tests, average position was equaled on the comparison between SPOT using low earth orbit satellite and DGPS (Differential Global Positining System), but standard deviation of DGPS for latitude and longitude were 66.4% and 46.3% smaller than those of SPOT. The position precision of SPOT was almost two times lower than LGT using geostationary satellite to compare 95% circular error probability. However, the success rate of receiver for SPOT was revealed as 86.5~94.1% on the experiments in the South Sea and the West Sea and it was 4.5 times higher than LGT. Therefore, SPOT is expected to contribute greatly to the rapid rescue of victim.

GPU-based Stereo Matching Algorithm with the Strategy of Population-based Incremental Learning

  • Nie, Dong-Hu;Han, Kyu-Phil;Lee, Heng-Suk
    • Journal of Information Processing Systems
    • /
    • v.5 no.2
    • /
    • pp.105-116
    • /
    • 2009
  • To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.

IDENTIFICATION OF HUMAN-INDUCED INITIATING EVENTS IN THE LOW POWER AND SHUTDOWN OPERATION USING THE COMMISSION ERROR SEARCH AND ASSESSMENT METHOD

  • KIM, YONGCHAN;KIM, JONGHYUN
    • Nuclear Engineering and Technology
    • /
    • v.47 no.2
    • /
    • pp.187-195
    • /
    • 2015
  • Human-induced initiating events, also called Category B actions in human reliability analysis, are operator actions that may lead directly to initiating events. Most conventional probabilistic safety analyses typically assume that the frequency of initiating events also includes the probability of human-induced initiating events. However, some regulatory documents require Category B actions to be specifically analyzed and quantified in probabilistic safety analysis. An explicit modeling of Category B actions could also potentially lead to important insights into human performance in terms of safety. However, there is no standard procedure to identify Category B actions. This paper describes a systematic procedure to identify Category B actions for low power and shutdown conditions. The procedure includes several steps to determine operator actions that may lead to initiating events in the low power and shutdown stages. These steps are the selection of initiating events, the selection of systems or components, the screening of unlikely operating actions, and the quantification of initiating events. The procedure also provides the detailed instruction for each step, such as operator's action, information required, screening rules, and the outputs. Finally, the applicability of the suggested approach is also investigated by application to a plant example.

Optimization and Verification of Parameters Used in Successive Zooming Genetic Algorithm (순차적 주밍 유전자 알고리즘 기법에 사용되는 파라미터의 최적화 및 검증)

  • KWON YOUNG-DOO;KWON HYUN-WOOK;KIM JAE-YONG;JIN SEUNG-BO
    • Journal of Ocean Engineering and Technology
    • /
    • v.18 no.5
    • /
    • pp.29-35
    • /
    • 2004
  • A new approach, referred to as a successive zooming genetic algorithm (SZGA), is proposed for identifying a global solution, using continuous zooming factors for optimization problems. In order to improve the local fine-tuning of the GA, we introduced a new method whereby the search space is zoomed around the design variable with the best fitness per 100 generation, resulting in an improvement of the convergence. Furthermore, the reliability of the optimized solution is determined based on the theory of probability, and the parameter used for the successive zooming method is optimized. With parameter optimization, we can eliminate the time allocated for deciding parameters used in SZGA. To demonstrate the superiority of the proposed theory, we tested for the minimization of a multiple function, as well as simple functions. After testing, we applied the parameter optimization to a truss problem and wicket gate servomotor optimization. Then, the proposed algorithm identifies a more exact optimum value than the standard genetic algorithm.

Image Tracking Algorithm using Template Matching and PSNF-m

  • Bae, Jong-Sue;Song, Taek-Lyul
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.3
    • /
    • pp.413-423
    • /
    • 2008
  • The template matching method is used as a simple method to track objects or patterns that we want to search for in the input image data from image sensors. It recognizes a segment with the highest correlation as a target. The concept of this method is similar to that of SNF (Strongest Neighbor Filter) that regards the measurement with the highest signal intensity as target-originated among other measurements. The SNF assumes that the strongest neighbor (SN) measurement in the validation gate originates from the target of interest and the SNF utilizes the SN in the update step of a standard Kalman filter (SKF). The SNF is widely used along with the nearest neighbor filter (NNF), due to computational simplicity in spite of its inconsistency of handling the SN as if it is the true target. Probabilistic Strongest Neighbor Filter for m validated measurements (PSNF-m) accounts for the probability that the SN in the validation gate originates from the target while the SNF assumes at any time that the SN measurement is target-originated. It is known that the PSNF-m is superior to the SNF in performance at a cost of increased computational load. In this paper, we suggest an image tracking algorithm that combines the template matching and the PSNF-m to estimate the states of a tracked target. Computer simulation results are included to demonstrate the performance of the proposed algorithm in comparison with other algorithms.

In Search for a Common Pathway for Health Issues in Men - the Sign of a Holmesian Deduction

  • Aoun, Fouad;Chemaly, Anthony Kallas;Albisinni, Simone;Zanaty, Marc;Roumeguere, Thierry
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.1
    • /
    • pp.1-13
    • /
    • 2016
  • The evidence for the existence of a common pathway for health issues in men is presented in this review. Several epidemiological studies have shown that conditions like cardiovascular diseases (CVD), metabolic syndrome, diabetes, lower urinary tract symptom (LUTS), erectile dysfunction (ED), prostate cancer, hypogonadism, depression and suicide can be associated as risk factors for each other. Thus, the risk of CVD is significantly increased in men with metabolic syndrome, ED, hypogonadism, prostate cancer and/or LUTS. In addition, the above mentioned conditions are more prevalent in atherosclerotic patients. In addition, growing evidence indicates that low androgen levels can cause metabolic syndrome. In addition, obesity, dyslipidaemia and diabetes can further reduce androgen levels potentiating their adverse effect. Low testosterone levels are also associated with a higher incidence of aggressive prostate cancer on biopsy and on definitive pathology, and lower probability of abiraterone response in the metastatic setting. Several recent studies point towards diffuse endothelial dysfunction and dysregulated pro-inflammatory state as the biological link between all these disorders. Our current hypothesis is that oxidative stress caused by these dysfunctions explains the pathogenesis of each of these conditions.

A Design of an SARPE System considering the moving speed and direction of a vehicle (차량의 이동속도와 이동방향을 고려한 SARPE 시스템 설계)

  • Lee, ByungKwan;Jeong, Eun Hee;Jung, INa
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.6
    • /
    • pp.61-70
    • /
    • 2013
  • This paper proposes a design of SARPE(Speed and Azimuth based Routing Protocol for Emergency) system which transfers an emergency message rapidly and accurately by minimizing path disconnection with a vehicle's speed and azimuth in case of accidents. The SARPE system accomplishes the path search based on an azimuth in order to minimize unnecessary messages and workload. It also selects the paths with the lowest probability that the path disconnection will happen by using the difference between the speed(maximum, minimum) of intermediate nodes and the average speed of a source node and destination node. Therefore, this paper minimizes the path resetting work happening due to path disconnection and transfers an emergency message rapidly and accurately.