• Title/Summary/Keyword: random tournament

Search Result 6, Processing Time 0.031 seconds

THE DOMINATION NUMBER OF A TOURNAMENT

  • Lee, Changwoo
    • Korean Journal of Mathematics
    • /
    • v.9 no.1
    • /
    • pp.21-28
    • /
    • 2001
  • We find bounds for the domination number of a tournament and investigate the sharpness of these bounds. We also find the domination number of a random tournament.

  • PDF

A study on a multi-stage random tournament competition system and its fairness (다단 랜덤화 토너먼트 경쟁방식 및 그의 공정성에 대한 연구)

  • Lee, Kee-Won;Lee, Jung Soon;Sim, Songyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.4
    • /
    • pp.923-930
    • /
    • 2015
  • There exist many competition systems to determine a winner. Many sports games use the 1-in-2 tournament or its modified version to determine a winner. In this paper, we propose a competition system that can be used when there are many candidates and many random referees to evaluate the candidates. These competitions can be found in the cyber space where many users score many competing apps. We study fairness of our proposed competing system called a multi-stage random tournament in terms of equal probabilities. We also formulate the influence factor of a specific referee under some specific conditions.

Feature Selection for Classification of Mass Spectrometric Proteomic Data Using Random Forest (단백체 스펙트럼 데이터의 분류를 위한 랜덤 포리스트 기반 특성 선택 알고리즘)

  • Ohn, Syng-Yup;Chi, Seung-Do;Han, Mi-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.139-147
    • /
    • 2013
  • This paper proposes a novel method for feature selection for mass spectrometric proteomic data based on Random Forest. The method includes an effective preprocessing step to filter a large amount of redundant features with high correlation and applies a tournament strategy to get an optimal feature subset. Experiments on three public datasets, Ovarian 4-3-02, Ovarian 7-8-02 and Prostate shows that the new method achieves high performance comparing with widely used methods and balanced rate of specificity and sensitivity.

An Algorithms for Tournament-based Big Data Analysis (토너먼트 기반의 빅데이터 분석 알고리즘)

  • Lee, Hyunjin
    • Journal of Digital Contents Society
    • /
    • v.16 no.4
    • /
    • pp.545-553
    • /
    • 2015
  • While all of the data has a value in itself, most of the data that is collected in the real world is a random and unstructured. In order to extract useful information from the data, it is need to use the data transform and analysis algorithms. Data mining is used for this purpose. Today, there is not only need for a variety of data mining techniques to analyze the data but also need for a computational requirements and rapid analysis time for huge volume of data. The method commonly used to store huge volume of data is to use the hadoop. A method for analyzing data in hadoop is to use the MapReduce framework. In this paper, we developed a tournament-based MapReduce method for high efficiency in developing an algorithm on a single machine to the MapReduce framework. This proposed method can apply many analysis algorithms and we showed the usefulness of proposed tournament based method to apply frequently used data mining algorithms k-means and k-nearest neighbor classification.

Stacking Sequence Design of Fiber-Metal Laminate Composites for Maximum Strength (강도를 고려한 섬유-금속 적층 복합재료의 최적설계)

  • 남현욱;박지훈;황운봉;김광수;한경섭
    • Composites Research
    • /
    • v.12 no.4
    • /
    • pp.42-54
    • /
    • 1999
  • FMLC(Fiber-Metal Laminate Composites) is a new structural material combining thin metal laminate with adhesive fiber prepreg, it nearly include all the advantage of metallic materials, for example: good plasticity, impact resistance, processibility, light weight and excellent fatigue properties. This research studied the optimum design of the FMLC subject to various loading conditions using genetic algorithm. The finite element method based on the shear deformation theory was used for the analysis of FMLC. Tasi-Hill failure criterion and Miser yield criterion were taken as fitness functions of the fiber prepreg and the metal laminate, respectively. The design variables were fiber orientation angles. In genetic algorithm, the tournament selection and the uniform crossover method were used. The elitist model was also used to be effective evolution strategy and the creeping random search method was adopted in order to approach a solution with high accuracy. Optimization results were given for various loading conditions and compared with CFRP(Carbon Fiber Reinforced Plastic). The results show that the FMLC is more excellent than the CFRP in point and uniform loading conditions and it is more stable to unexpected loading because the deviation of failure index is smaller than that of CFRP.

  • PDF

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF