• Title/Summary/Keyword: Selection theorem

Search Result 47, Processing Time 0.023 seconds

EXISTENCE OF EQUILIBRIA IN GENERALIZED FUZZY GAMES

  • Kim, Won Kyu;Lee, Kyoung Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.12 no.1
    • /
    • pp.53-61
    • /
    • 1999
  • The purpose of this paper is to give a new existence theorem of equilibrium in generalized fuzzy games with uncountable number of agents.

  • PDF

Co-Evolutionary Algorithm and Extended Schema Theorem

  • Sim, Kwee-Bo;Jun, Hyo-Byung
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.1
    • /
    • pp.95-110
    • /
    • 1998
  • Evolutionary Algorithms (EAs) are population-based optimization methods based on the principle of Darwinian natural selection. The representative methodology in EAs is genetic algorithm (GA) proposed by J. H. Holland, and the theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. In the meaning of these foundational concepts, simple genetic algorithm (SGA) allocate more trials to the schemata whose average fitness remains above average. Although SGA does well in many applications as an optimization method, still it does not guarantee the convergence of a global optimum in GA-hard problems and deceptive problems. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve in contrast with traditional single population evolutionary algorithm. In this paper we show why the co-evolutionary algorithm works better than SGA in terms of an extended schema theorem. And predator-prey co-evolution and symbiotic co-evolution, typical approaching methods to co-evolution, are reviewed, and dynamic fitness landscape associated with co-evolution is explained. And the experimental results show a co-evolutionary algorithm works well in optimization problems even though in deceptive functions.

  • PDF

Co-Evolutionary Algorithms for the Realization of the Intelligent Systems

  • Sim, Kwee-Bo;Jun, Hyo-Byung
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.1
    • /
    • pp.115-125
    • /
    • 1999
  • Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA does well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in some problems. In designing intelligent systems, specially, since there is no deterministic solution, a heuristic trial-and error procedure is usually used to determine the systems' parameters. As an alternative scheme, therefore, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we review the existing co-evolutionary algorithms and propose co-evolutionary schemes designing intelligent systems according to the relation between the system's components.

  • PDF

SOME GENERALIZATIONS OF SUGENOS FUZZY INTEGRAL TO SET-VALUED MAPPINGS

  • Cho, Sung-Jin;Lee, Byung-Soo;Lee, Gue-Myung;Kim, Do-Sang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.380-386
    • /
    • 1998
  • In this paper we introduce the concept of fuzzy integrals for set-valued mappings, which is an extension of fuzzy integrals for single-valued functions defined by Sugeno. And we give some properties including convergence theorems on fuzzy integrals for set-valued mappings.

  • PDF

FIXED POINT THEOREMS, SECTION PROPERTIES AND MINIMAX INEQUALITIES ON K-G-CONVEX SPACES

  • Balaj, Mircea
    • Journal of the Korean Mathematical Society
    • /
    • v.39 no.3
    • /
    • pp.387-395
    • /
    • 2002
  • In [11] Kim obtained fixed point theorems for maps defined on some “locally G-convex”subsets of a generalized convex space. Theorem 2 in Kim's article determines us to introduce, in this paper, the notion of K-G-convex space. In this framework we obtain fixed point theorems, section properties and minimax inequalities.

Identifying Copy Number Variants under Selection in Geographically Structured Populations Based on F-statistics

  • Song, Hae-Hiang;Hu, Hae-Jin;Seok, In-Hae;Chung, Yeun-Jun
    • Genomics & Informatics
    • /
    • v.10 no.2
    • /
    • pp.81-87
    • /
    • 2012
  • Large-scale copy number variants (CNVs) in the human provide the raw material for delineating population differences, as natural selection may have affected at least some of the CNVs thus far discovered. Although the examination of relatively large numbers of specific ethnic groups has recently started in regard to inter-ethnic group differences in CNVs, identifying and understanding particular instances of natural selection have not been performed. The traditional $F_{ST}$ measure, obtained from differences in allele frequencies between populations, has been used to identify CNVs loci subject to geographically varying selection. Here, we review advances and the application of multinomial-Dirichlet likelihood methods of inference for identifying genome regions that have been subject to natural selection with the $F_{ST}$ estimates. The contents of presentation are not new; however, this review clarifies how the application of the methods to CNV data, which remains largely unexplored, is possible. A hierarchical Bayesian method, which is implemented via Markov Chain Monte Carlo, estimates locus-specific $F_{ST}$ and can identify outlying CNVs loci with large values of FST. By applying this Bayesian method to the publicly available CNV data, we identified the CNV loci that show signals of natural selection, which may elucidate the genetic basis of human disease and diversity.

A Study on the on-line fast Automatic Contingency Selection (온라인 고속 상정사고 선택에 관한 연구)

  • 송길영;김영한;노대석
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.5
    • /
    • pp.309-318
    • /
    • 1987
  • In the on-line security analysis of power system, Automatic Contingency Selection (ACS) is commonly used to reduce the number of contingency cases which will be evaluated in detail. This paper describes a fast and reliable ACS method which adopts DC load flow in conjunction with compensation theorem to improve execution time, and applies severity performance index, divided on each limit level for considering overload rate, to make reliable contingency ranking. The method has been tested in IEEE 25 bus system and KEPCO 130 bus actual power system. The results of these tests verify its superiority to both the execution time and reliability, and illustrate its effectiveness for the practical use.

  • PDF

A RULE-BASED APPROACH for AUTOMATIC CONTINGENCY SELECTION in POWER SYSTEMS (자동 상정사고 선택에 관한 룰-베이스적 접근)

  • Park, Young-Moon;Shin, Joong-Rin;Jo, Gang-Wook
    • Proceedings of the KIEE Conference
    • /
    • 1987.11a
    • /
    • pp.118-121
    • /
    • 1987
  • This paper presents a rule-based approach for automatically selecting critical contingencies in electric power systems. The rules required to perform the task are derived from inspection about results of simulation and expertise of operators. And inherent information of system, for example, topology of system configuration, and flow direction in a line by compensation theorem. etc., which are independent of operating point of system, is stored in the database using the off-line calculation. The approach was investigated using the study of a sample test system. Since it is based on the knowledge engineering technique, efficiency of selection can be improved by updating and adding the rules.

  • PDF

Task Scheduling and Resource Management Strategy for Edge Cloud Computing Using Improved Genetic Algorithm

  • Xiuye Yin;Liyong Chen
    • Journal of Information Processing Systems
    • /
    • v.19 no.4
    • /
    • pp.450-464
    • /
    • 2023
  • To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

The ensemble approach in comparison with the diverse feature selection techniques for estimating NPPs parameters using the different learning algorithms of the feed-forward neural network

  • Moshkbar-Bakhshayesh, Khalil
    • Nuclear Engineering and Technology
    • /
    • v.53 no.12
    • /
    • pp.3944-3951
    • /
    • 2021
  • Several reasons such as no free lunch theorem indicate that there is not a universal Feature selection (FS) technique that outperforms other ones. Moreover, some approaches such as using synthetic dataset, in presence of large number of FS techniques, are very tedious and time consuming task. In this study to tackle the issue of dependency of estimation accuracy on the selected FS technique, a methodology based on the heterogeneous ensemble is proposed. The performance of the major learning algorithms of neural network (i.e. the FFNN-BR, the FFNN-LM) in combination with the diverse FS techniques (i.e. the NCA, the F-test, the Kendall's tau, the Pearson, the Spearman, and the Relief) and different combination techniques of the heterogeneous ensemble (i.e. the Min, the Median, the Arithmetic mean, and the Geometric mean) are considered. The target parameters/transients of Bushehr nuclear power plant (BNPP) are examined as the case study. The results show that the Min combination technique gives the more accurate estimation. Therefore, if the number of FS techniques is m and the number of learning algorithms is n, by the heterogeneous ensemble, the search space for acceptable estimation of the target parameters may be reduced from n × m to n × 1. The proposed methodology gives a simple and practical approach for more reliable and more accurate estimation of the target parameters compared to the methods such as the use of synthetic dataset or trial and error methods.