研究者詳細 - ケッペン　マリオ

論文 - ケッペン　マリオ

分割表示83 件中 41 - 60 件目／全件表示 >>

Mutation-based receiver search in a network for temporary information sharing 査読有り

Ohnishi K., Tsukamoto K., Koppen M.

2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings 1535 - 1542 2015年09月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

© 2015 IEEE. This paper examines our previously proposed mutation-based search method for temporary information sharing in a wireless mesh network. The temporary information sharing indicates that for the case in which information senders and receivers freely appear in the network, information is forwarded from an information sender to a receiver. The mutation-based search method determines a unique route to find receivers who want the forwarded information by operations among numerical values assigned to each node and probabilistically changes the assigned numerical values according to the search results, which can be regarded as a sort of mutation in evolutionary computation. A variety of types of operations and numerical values can be used for this search method. In simulations, the method is evaluated in terms of search reliability under two appearance patterns of an information sender-receiver pair. One is the appearance pattern that locations of the receiver and the receiver are randomly determined. The other is that only a location of the receiver is fixed. Simulation results reveal that search reliability depends on the types of operations and numerical values and is related to how frequently a closed path is generated in the search. The results also suggest that the degree of randomness in search is important for reliable search and varies with the types of operations and numerical values.

DOI： 10.1109/CEC.2015.7257070

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84963600701&origin=inward

Zonal fairness in wireless infrastructure 査読有り

Köppen, Mario and Tsuru, Masato

New Technologies, Mobility and Security (NTMS), 2015 7th International Conference on 2015年07月

Morphogenetic and evolutionary approach to similar image creation 査読有り

Ohnishi K., Mario K.

Advances in Intelligent Systems and Computing 316 331 - 340 2015年01月

記述言語：英語掲載種別：研究論文（学術雑誌）

© Springer International Publishing Switzerland 2015. This study presents a method for creating various images similar to an input image. The method first generates a graph which node corresponds to a pixel of an input image and which edge is made between nodes if a given condition on similarity in brightness between the corresponding pixels is met. The generated graph structure is influenced by distribution of brightness in the input image. Then, the method executes an algorithm inspired by biological development which can form various structures by changing its parameters values on the generated graph to newly determine the brightness of each pixel corresponding to a node in the graph. Next, the method uses an evolutionary algorithm to optimize parameters of the algorithm inspired by biological development to make the newly created image close to the input image. Experimental results demonstrate that the presented method can create various images similar to an input image depending on how to form the graph and design a fitness function of evolutionary algorithm.

DOI： 10.1007/978-3-319-10783-7_36

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84921531603&origin=inward

Ensemble relations for resource allocation tasks 査読有り

Köppen, Mario and Ohnishi, Kei and Tsuru, Masato

Intelligent Systems Design and Applications (ISDA), 2014 14th International Conference on 129 - 133 2014年11月

A Fairness Relation Based on the Asymmetric Choquet Integral and Its Application in Network Resource Allocation Problems 査読有り

Aoi Honda and Mario Köppen

Journal of Applied Mathematics 2014年07月

Evolution Of Developmental Timing For Solving Hierarchically Dependent Deceptive Problems 査読有り

Hamano K., Ohnishi K., Köppen M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8886 58 - 69 2014年01月

記述言語：英語掲載種別：研究論文（学術雑誌）

© Springer International Publishing Switzerland 2014. Conventional evolutionary algorithms (EAs) cannot solve given optimization problems efficiently when their evolutionary operators do not accommodate to the structures of the problems. We previously proposed a mutation-based EA that does not use a recombination operator and does not have this problem of the conventional EAs. The mutation-based EA evolves timings at which probabilities for generating phenotypic values (developmental timings) change, and brings different evolution speed to each phenotypic variable, so that it can solve a given problem hierarchically. In this paper we first propose the evolutionary algorithm evolving developmental timing (EDT) by adding a crossover operator to the mutation-based EA and then devise a new test problem that conventional EAs are likely to fail in solving and for which the features of the proposed EA are well utilized. The test problem consists of multiple deceptive problems among which there is hierarchical dependency, and has the feature that the hierarchical dependency is represented by a graph structure. We apply the EDT and the conventional EAs, the PBIL and cGA, for comparison to the new test problem and show the usefulness of the evolution of developmental timing.

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84921388040&origin=inward

Significance Relations for the Benchmarking of Meta-Heuristic Algorithms 査読有り

Mario Koeppen, Kei Ohnishi

2013 Intl. Conference on Intelligent Systems Design and Applications (ISDA 2013) 2013年12月

Multi-Jain Fairness Index of Per-Entity Allocation Features for Fair and Efficient Allocation of Network Resources 査読有り

Mario Koeppen, Kei Ohnishi and Masato Tsuru

5th International Conference on Intelligent Networking and Collaborative Systems (INCoS 2013) 2013年09月

Parallel Evolutionary P2P Networking Technique Evaluating Network Topologies Sequentially 査読有り

Kei Ohnishi and Mario Köppen

COMPSAC 2013 2013年07月

Knaster Procedure for Proportional Fair Wireless Channel Allocation 査読有り

Mario Koeppn, Kei Ohnishi

2013 IEEE 37th Annual Computer Software and Applications Conference Workshops (COMPSAC 2013) 2013年07月

Relational optimization and its application: From bottleneck flow control to wireless channel allocation 査読有り

Köppen M.

Informatica (Netherlands) 24 ( 3 ) 413 - 433 2013年01月

記述言語：英語掲載種別：研究論文（学術雑誌）

Relational mathematics, as it is studied in fields like mathematical economics and social choice theory for some time, provides a rich and general framework and appears to be a natural and direct way to paraphrase optimization goals, to represent user preferences, to justify fairness criterions, to cope with QoS or to valuate utility. Here, we will focus on the specific application aspects of formal relations in network design and control problems and provide the general concept of relational optimization. In relational optimization, we represent the optimization problem by a formal relation, and the solution by the set of maximal (or non-dominated) elements of this relation. This appears to be a natural extension of standard optimization, and covers other notions of optimality as well. Along with this, we will provide a set of fairness relations that can serve as maximizing relations in relational optimization according to various application needs, and we specify a meta-heuristic approach derived from evolutionary multi-objective optimization algorithms to approximate their maximum sets.

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84898001905&origin=inward

Fairness-based parameter selection in multi-modal biometric authentication 査読有り

Köppen M., Soria-Frisch A., Acedo J.

International Conference on Intelligent Systems Design and Applications, ISDA 979 - 985 2012年12月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

A multi-modal biometric authentication system based on iterative fusion operator trees is considered, where the per-user performance is also depending on the order of biometric feature evaluations. Therefore, each user would have its own optimal choice of order parameters of the biometric system. However, for a system approach there should be only one general parametrization of the whole biometric system for all users, and the necessary consequence are performance wins and losses for each user. The common approach for this purpose is to use the parameter setting that maximizes the average performance over users. However, this does not necessarily reflect a good balance of performance wins and losses. In order to gain more insight into the corresponding trade-offs, and to facilitate an effective selection of an order parameter, the concept of fairness relations and their maximality, which has become a recent topic of many investigations in communication network resource sharing tasks, is applied to this problem of multi-modal biometric systems. The central idea of the paper is that by applying fairness relation to select the parameters, we obtain a system where subjects have a more fair chance of being right authenticated. A comparative study of an experimental test data set shows that maxmin fairness gives solutions with major drawbacks for the majority of users, while proportional fairness comes close to the maximum average. © 2012 IEEE.

DOI： 10.1109/ISDA.2012.6416672

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84874358094&origin=inward

Evolutionary linkage creation between information sources in P2P networks 査読有り

Ohnishi, Kei and Koeppen, Mario and Yoshida, Kaori

Evolutionary Intelligence 5 ( 4 ) 245 - 259 2012年11月

Meta-heuristic approach to proportional fairness 査読有り

Koeppen, Mario and Yoshida, Kaori and Ohnishi, Kei and Tsuru, Masato

Evolutionary Intelligence 5 ( 4 ) 231 - 244 2012年11月

A Relational Approach to Collaborative Fairness 査読有り

Mario Köppen, Rodrigo Verschae and Masato Tsuru

INCoS 2012 - Fourth International Conference on Intelligent Networking and Collaborative Systems, Proc. 2012年09月

Genetic Clustering Based on Segregation Distortion Caused by Selfish Genes 査読有り

Kei Ohnishi, Mario Köppen, Chang Wook Ahn and Kaori Yoshida

Systems, Man, and Cybernetics, 2012 IEEE International Conference on , Proc. 2012年09月

A Benchmark for Evaluating Approximated Algorithms for Fair Wireless Channel Allocation 査読有り

Rodrigo Verschae, Mario Köppen and Masato Tsuru

INCoS 2012 - Fourth International Conference on Intelligent Networking and Collaborative Systems, Proc. 2012年09月

MASP - A Multi-Attribute Secretary Problem Approach to Multi-Objective Optimization with Fair Decision Maker 査読有り

Mario Köppen, Rodrigo Verschae and Masato Tsuru

ICGEC 2012 - Sixth International Conference on Genetic and Evolutionary Computing, Proc. 2012年08月

Fuzzification of maxmin fairness relation based on subvector dominance degree 査読有り

Köppen M., Yoshida K., Tsuru M.

Proceedings - 2nd International Conference on Intelligent Networking and Collaborative Systems, INCOS 2010 344 - 349 2010年12月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Maxmin fairness can be characterized as a state obtained from the application of the bottleneck flow control algorithm, allowing for a formally efficient definition of a fairness concept. But a number of problems with the related maxmin fairness vector relation, esp. non-uniqueness of the maximum, preference for improving least components, artefacts appearing in the discrete domain, and lack of numerical representation have already been noted. For this reason, we propose a fuzzy fairness, based on subvector dominance. The fuzzy fairness, here called subvector maxmin dominance degree, is based on the ratio of the number of all maxmin fair dominating subvectors to the number of all possible subvectors. It is shown how this definition extends the maxmin fairness relation, how it helps to solve the problems with maxmin fairness, and how it numerically emphasises fairness states against other states. © 2010 IEEE.

DOI： 10.1109/INCOS.2010.45

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79952091732&origin=inward

Interactive genetic algorithm for font generation system 査読有り

Yoshida K., Nakagawa Y., Köppen M.

2010 World Automation Congress, WAC 2010 2010年12月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

We suggest the font generation system consists of font definition phase and font creation phase. For font definition phase, the tool to export font element parameters represented by XML format has implemented. For font creation phase, the font creation application PALETTE (Personal Adapted LETTEr) has designed to emerge various fonts based on user's Kansei without hand drawing and developed as Adobe AIR application. It enables to generate a new font by selecting user's favorite fonts from displayed candidates, save font as an image according to users input text, and reuse stored font to the next font creation. To design PALETTE, we focused on Interactive Genetic Algorithm (IGA) technique to take user's subjective desire on font shape into the system. IGA is well known as a method to use user's subjective evaluation interactively. PALETTE has the following modules; (i) create new font candidates base on general font, or stored font characteristics with Kansei label, (ii) generate new fonts using genetic algorithm which can modify each element of the selected candidates, and (iii) export font image and save font characteristics. In this paper, we explain the font generation system and show the experimental results. © 2010 TSI Press.

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78651447534&origin=inward

　前のページ - 次のページ　

<ケッペン マリオ>

論文 - ケッペン マリオ

<ケッペン　マリオ>

論文 - ケッペン　マリオ