2023/12/26 更新

写真a

ケッペン マリオ
ケッペン マリオ
KOEPPEN Mario
Scopus 論文情報  
総論文数: 0  総Citation: 0  h-index: 11

Citation Countは当該年に発表した論文の被引用数

所属
大学院情報工学研究院 情報・通信工学研究系
職名
教授
メールアドレス
メールアドレス
研究室住所
福岡県飯塚市川津680-4
研究室電話
081 948 29 7945
研究室FAX
081 948 29 7946
外部リンク

研究キーワード

  • Pattern Recognition

  • Algorithm Theory

  • Image Processing

  • Soft Computing

  • Computational Intelligence

  • Security Technologies

  • (Multi-Objective) Optimization

出身大学院

  • 2005年03月   ベルリン工科大学   機械工学及び転送システム   コンピューター・サイエンス   博士課程・博士後期課程   修了   ドイツ連邦共和国

  • 1990年03月   ベルリン・フンボルト大学   物理研究科   物理   修士課程・博士前期課程   修了   ドイツ連邦共和国

取得学位

  • ベルリン工科大学  -  博士   2005年07月

学内職務経歴

  • 2019年04月 - 現在   九州工業大学   大学院情報工学研究院   情報・通信工学研究系     教授

  • 2013年04月 - 2019年03月   九州工業大学   大学院情報工学研究院   情報創成工学研究系     教授

  • 2008年06月 - 2013年03月   九州工業大学   ネットワークデザイン研究センター     教授

論文

  • A metaverse assessment model for sustainable transportation using ordinal priority approach and Aczel-Alsina norms 査読有り 国際誌

    Pamucar D., Deveci M., Gokasar I., Tavana M., Köppen M.

    Technological Forecasting and Social Change   182   2022年09月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    Metaverse comes from the meta-universe, and it is the integration of physical and digital space into a virtual universe. Metaverse technologies will change the transportation system as we know it. Preparations for the transition of the transportation systems into the world of metaverse are underway. This study considers four alternative metaverses: auto-driving algorithm testing for training autonomous driving artificial intelligence, public transportation operation and safety, traffic operation, and sharing economy applications to obtain sustainable transportation. These alternatives are evaluated on thirteen sub-criteria, grouped under four main aspects: efficiency, operation, social and health, and legislation and regulation. A novel Rough Aczel–Alsa (RAA) function and the Ordinal Priority Approach (OPA) method are used in the assessment model. We also present a case study to demonstrate the applicability and exhibit the efficacy of the assessment framework in prioritizing the metaverse implementation alternatives.

    DOI: 10.1016/j.techfore.2022.121778

    Scopus

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

  • Prioritizing transport planning strategies for freight companies towards zero carbon emission using ordinal priority approach 査読有り 国際誌

    Pamucar D., Deveci M., Gokasar I., Martínez L., Köppen M.

    Computers and Industrial Engineering   169   2022年07月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    Freight transportation counts for remarkable negative effects like emissions, noise, and congestion. This urges for a modal shift toward structuring a more efficient systematic network, facilitating full use of potentials among the transportation modes. Decision-makers face uncertainty and restricted information processing skills when assessing the alternatives for sustainable freight transportation. In this study, a novel extension of the Ordinal Priority Approach under picture fuzzy sets (OPA-P) is proposed to rank the alternatives. In the OPA-P algorithm, experts’ preferences are used to determine the weighting coefficients of criteria and rank the alternatives. A case study is employed to demonstrate the formulation and solution of the problem. The outcome of this study suggests the top-ranked and most important solution for the sustainable transport planning. In addition, to verify the stability of the proposed model, a validation analysis is carried out.

    DOI: 10.1016/j.cie.2022.108259

    Scopus

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

  • Implementing a Hand Gesture Recognition System Based on Range-Doppler Map 査読有り 国際誌

    Jhaung Y.C., Lin Y.M., Zha C., Leu J.S., Köppen M.

    Sensors   22 ( 11 )   2022年06月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    There have been several studies of hand gesture recognition for human–machine interfaces. In the early work, most solutions were vision-based and usually had privacy problems that make them unusable in some scenarios. To address the privacy issues, more and more research on non-vision-based hand gesture recognition techniques has been proposed. This paper proposes a dynamic hand gesture system based on 60 GHz FMCW radar that can be used for contactless device control. In this paper, we receive the radar signals of hand gestures and transform them into human-understandable domains such as range, velocity, and angle. With these signatures, we can customize our system to different scenarios. We proposed an end-to-end training deep learning model (neural network and long short-term memory), that extracts the transformed radar signals into features and classifies the extracted features into hand gesture labels. In our training data collecting effort, a camera is used only to support labeling hand gesture data. The accuracy of our model can reach 98%.

    DOI: 10.3390/s22114260

    Scopus

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

  • Supporting farming smart documentation system by modular blockchain solutions 査読有り 国際誌

    Arsyad, A. A., Widayat, I. W., & Köppen, M.

    Decision Making: Applications in Management and Engineering   5 ( 1 )   1 - 26   2022年03月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

  • A Genetic Algorithm for Parallel Unmanned Aerial Vehicle Scheduling: A Cost Minimization Approach 査読有り 国際誌

    Mantau A.J., Widayat I.W., Köppen M.

    Lecture Notes in Networks and Systems   312   125 - 135   2022年01月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    In recent years, there are many research achievements in the Unmanned Aerial Vehicle (UAV) fields. UAV can be used to deliver the logistics and do surveillance as well. Two main problems in this field are UAV-routing and UAV-scheduling. In this paper, we focus on the UAV scheduling problem, which is the problem to search for the scheduling order of the UAV using a fixed number of UAVs and a fixed number of targets. The objective of this paper is to minimize the total cost for efficient realization. A Genetic Algorithm (GA) method is used to solve the UAV-scheduling problem considering the time-varying cost or Time-of-Use tariff (ToU) constraints. The Job Delay Mechanism is also used to improve cost optimization, as a kind of post-processing for the fitness evaluation of an individual schedule, and show that GA alone can not find it. Finally, a numerical experiment is conducted to implement the idea in this paper. Experiment results showed that the proposed method is quite promising and effective in solving the related problem.

    DOI: 10.1007/978-3-030-84910-8_14

    Scopus

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

  • Blockchain Simulation Environment on Multi-image Encryption for Smart Farming Application 査読有り 国際誌

    Widi Widayat I., Köppen M.

    Lecture Notes in Networks and Systems   312   316 - 326   2022年01月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    The certainty of food provenance on the agriculture ecosystem brings one of the most popular research topics to smart farming. The global epidemic enforces consumers to be warned of the originality of food supply. Various technology unification is included to address this problem. Heterogeneous IoT sensors for sensing agricultural or plantation land provide system automation and monitoring for certain commodities. Sensor data and captured images of surveillance cameras are the results of IoT devices sensing capability. However, the originality of the data being stored is questioned; even worse, the data records are deleted. Such as problems occur due to several things: network congestion, device reliability, storage media, and operator. One of the findings proposed in this research is storing sensing results from each sensor and camera surveillance to a global database that is decentralized, immutable, and synchronized, known as the blockchain. All the parties involved in the smart farming system, such as farmers, food suppliers, and customers, are connected to a global blockchain network. Multi-Image Encryption (MIE) yields to secure the authenticity of captured images from multiple cameras. A specific MIE algorithm will compile and randomized the captured image from cameras to produce an encrypted image stored in the blockchain database with a unique identifier. This study provides a simulated model of blockchain technology that can be implemented in a smart farming environment using Ganache as the test net. In the smart contract, every entity connected to the blockchain network appears as a node account that is digitally assigned based on each role. Therefore, the transaction was successfully done from one node to the others. This research is the initial stages of implementing a smart farming system into the unification of various technology in the development of sustainable agriculture.

    DOI: 10.1007/978-3-030-84910-8_33

    Scopus

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

  • Calibration Cost Reduction of Indoor Localization Using Bluetooth Low Energy Beacon 査読有り 国際誌

    As M., Shimizu H., Benaissa B., Yoshida K., Koppen M.

    Journal of Advanced Computational Intelligence and Intelligent Informatics   26 ( 1 )   97 - 106   2022年01月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    Indoor localization based on Bluetooth low energy (BLE) beacons has been rapidly developed, and many approaches have been developed to achieve higher estimation accuracy. In these methods, the received signal strength (RSS) is the input. However, the measurement of indoor environments is affected easily; the signal may be reflected and attenuated by obstacles such as the human body, walls, and furniture, which creates a challenge for methods based on signal mapping. In this study, BLE signal characteristics are investigated in an indoor localization setting. An experiment is performed using one BLE beacon and multiple receivers installed at different wall and ceiling positions. The raw RSS is observed, and the relationship between the BLE beacon signal strength characteristics against the human body effect as well as the receiver's placement in the observation area are discussed. Signal mapping is performed, where the signal strength is measured from all receivers simultaneously. The position estimation accuracy is examined based on different data scenarios. The results show that the estimation position estimated by the BLE beacon based on extensive BLE beacon data does not affect the estimation accuracy.

    DOI: 10.20965/jaciii.2022.p0097

    Scopus

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

  • Personal Mobility in Metaverse With Autonomous Vehicles Using Q-Rung Orthopair Fuzzy Sets Based OPA-RAFSI Model 査読有り 国際誌

    Deveci M., Pamucar D., Gokasar I., Koppen M., Gupta B.B.

    IEEE Transactions on Intelligent Transportation Systems   2022年01月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    The term metaverse, which shows a 3D-designed virtual medium where people can connect through their avatars to spend time, telecommute, and socialize, has entered our lives fast. There are limitless implementations that can take place in the metaverse. Integration of another technological innovation, which is autonomous vehicles to the metaverse, is at hand. There are numerous alternative uses of autonomous vehicles in the metaverse. In this study, three alternative implementation options for autonomous vehicles in the metaverse are investigated. These alternatives are evaluated using the proposed multi-criteria decision-making (MCDM) method under twelve different criteria, which are grouped under four main aspects, namely technological, societal, legal and ethical, and transportation. A novel hybrid model based on q-rung orthopair fuzzy sets (q-ROFSs) which consists of three stages is presented to express the framework definition, calculate the weight coefficients of the criteria, and rank various alternatives. In the first stage, the structure of the problem is created. In the second stage, q-ROFSs based OPA algorithm is used to calculate the weights of the criteria. In the last stage, q-ROFSs based RAFSI (Ranking of Alternatives through Functional mapping of criterion sub-intervals into a Single Interval) is applied to choose the best alternative among the three alternatives. Finally, we present a case study to verify our proposed method. The results of this study have the potential to be used as a guide by decision-makers of the metaverse while integrating autonomous vehicles into the transportation system.

    DOI: 10.1109/TITS.2022.3186294

    Scopus

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

  • SUPPORTING FARMING SMART DOCUMENTATION SYSTEM by MODULAR BLOCKCHAIN SOLUTIONS 査読有り 国際誌

    Arsyad A.A., Widayat I.W., Köppen M.

    Decision Making: Applications in Management and Engineering   5 ( 1 )   1 - 26   2022年01月

     詳細を見る

    担当区分:最終著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    For more than a decade, various farm-specific models have been developed by collaborating and integrating sensing technologies as a step toward successful data-farm documentation and effective decision-making. However, the stored and gathered data continues to rely on cloud infrastructure or centralized platform control, which is particularly vulnerable to threats such as data tampering, data distortion, confidentiality, and manipulation, which caused the farm product data difficult to trace to its provenance. The objective study in this paper proposes a farm transaction model by demonstrating a flow of farm transaction simulation implicated by Modular Block Chain(MBC) sensing instrument with an array of sensors, controllers, networking hardware, computing equipment, and internal memory functions to enhance data integrity and security farm object. Based on the proposed model, a proof-of-concept experimental system called Encapsulating Block Mesh (EBM) integrates blockchain technology with the specific application case of cocoa production has been implemented. Results have shown that farm objects represented by MBC take turn recording information on the process of generating, transacting, and consuming a farm product and encrypting it into a block was validated and linked in the EBM with the hash of transaction data that connected to each cocoa farm object in a simulation environment. The findings from this study are twofold: the approach has been shown to be feasible and effective, but also capable to be expanded to other stages of the food supply chain, such as manufacturing, supermarkets, food consumption (consumers), and recycling in real-world environments.

    DOI: 10.31181/dmame0326022022a

    Scopus

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

  • Behavior selection metaheuristic search algorithm for the pollination optimization: A simulation case of cocoa flowers 査読有り

    Syafruddin W.A., Paweroi R.M., Köppen M.

    Algorithms   14 ( 8 )   2021年08月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    Since nature is an excellent source of inspiration for optimization methods, many optimization algorithms have been proposed, are inspired by nature, and are modified to solve various optimization problems. This paper uses metaheuristics in a new field inspired by nature; more precisely, we use pollination optimization in cocoa plants. The cocoa plant was chosen as the object since its flower type differs from other kinds of flowers, for example, by using cross-pollination. This complex relationship between plants and pollinators also renders pollination a real-world problem for chocolate production. Therefore, this study first identified the underlying optimization problem as a deferred fitness problem, where the quality of a potential solution cannot be immediately determined. Then, the study investigates how metaheuristic algorithms derived from three well-known techniques perform when applied to the flower pollination problem. The three techniques examined here are Swarm Intelligence Algorithms, Individual Random Search, and Multi-Agent Systems search. We then compare the behavior of these various search methods based on the results of pollination simulations. The criteria are the number of pollinated flowers for the trees and the amount and fairness of nectar pickup for the pollinator. Our results show that Multi-Agent System performs notably better than other methods. The result of this study are insights into the co-evolution of behaviors for the collaborative pollination task. We also foresee that this investigation can also help farmers increase chocolate production by developing methods to attract and promote pollinators.

    DOI: 10.3390/a14080230

    Scopus

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

  • Blockchain Simulation Environment on Multi-image Encryption for Smart Farming Application 査読有り 国際誌

    Widi Widayat, I., Köppen, M.

    Advances in Intelligent Networking and Collaborative Systems. INCoS 2021. Lecture Notes in Networks and Systems   312   2021年08月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

  • A Genetic Algorithm for Parallel Unmanned Aerial Vehicle Scheduling: A Cost Minimization Approach 査読有り

    Mantau, A.J., Widayat, I.W., Köppen, M.

    Advances in Intelligent Networking and Collaborative Systems. INCoS 2021. Lecture Notes in Networks and Systems   312   2021年08月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

  • Behavior Selection Metaheuristic Search Algorithm for the Pollination Optimization: A Simulation Case of Cocoa Flowers 査読有り 国際誌

    Syafruddin, Willa A., Rio M. Paweroi, and Mario Köppen

    Algorithms   14 ( 8 )   230   2021年07月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

  • An extended hesitant fuzzy set using SWARA-MULTIMOORA approach to adapt online education for the control of the pandemic spread of COVID-19 in higher education institutions 査読有り

    Saraji M.K., Mardani A., Köppen M., Mishra A.R., Rani P.

    Artificial Intelligence Review   2021年01月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    The world has been challenged since late 2019 by COVID-19. Higher education institutions have faced various challenges in adapting online education to control the pandemic spread of COVID-19. The present study aims to conduct a survey study through the interview and scrutinizing the literature to find the key challenges. Subsequently, an integrated MCDM framework, including Stepwise Weight Assessment Ratio Analysis (SWARA) and Multiple Objective Optimization based on Ratio Analysis plus Full Multiplicative Form (MULTIMOORA), is developed. The SWARA procedure is applied to the analysis and assesses the challenges to adapt the online education during the COVID-19 outbreak, and the MULTIMOORA approach is utilized to rank the higher education institutions on hesitant fuzzy sets. Further, an illustrative case study is considered to express the proposed idea's feasibility and efficacy in real-world decision-making. Finally, the obtained result is compared with other existing approaches, confirming the proposed framework's strength and steadiness. The identified challenges were systemic, pedagogical, and psychological challenges, while the analysis results found that the pedagogical challenges, including the lack of experience and student engagement, were the main essential challenges to adapting online education in higher education institutions during the COVID-19 outbreak.

    DOI: 10.1007/s10462-021-10029-9

    Scopus

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

  • Design and implementation of lora based iot scheme for Indonesian rural area 査読有り

    Prakosa S.W., Faisal M., Adhitya Y., Leu J.S., Köppen M., Avian C.

    Electronics (Switzerland)   10 ( 1 )   1 - 12   2021年01月

     詳細を見る

    記述言語:英語   掲載種別:記事・総説・解説・論説等(その他)

    The development of the Internet of Things (IoT) in electronics, computer, robotics, and internet technology is inevitable and has rapidly accelerated more than before as the IoT paradigm is a promising solution in terms of solving real world problems, especially for digitizing and monitoring in real time. Various IoT schemes have successfully been applied to some areas such as smart health and smart agriculture. Since the agriculture areas are getting narrow, the development of IoT in agriculture should be prioritized to enhance crop production. This paper proposes the IoT scheme for long range communication based on Long Range (LoRa) modules applied to smart agriculture. The scheme utilizes the low power modules and long-distance communication for monitoring temperature, humidity, soil moisture, and pH soil. Our IoT design has successfully been applied to agriculture areas which have unstable network connections. The design is analyzed to obtain the maximum coverage using different spreading factors and bandwidths. We show that as the spreading factor increases to 12, the maximum coverage can be transmitted to 1000 m. However, the large coverage also comes with the disadvantages of the increased delays.

    DOI: 10.3390/electronics10010077

    Scopus

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

  • An Empirical Investigation on Evolutionary Algorithm Evolving Developmental Timings 査読有り

    Kei Ohnishi, Kouta Hamano and Mario Köppen

    International Journal of Electronics ( MDPI )   9 ( 11 )   1 - 27   2020年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    Recently, evolutionary algorithms that can efficiently solve decomposable binary optimization problems have been developed. They are so-called model-based evolutionary algorithms, which build a model for generating solution candidates by applying a machine learning technique to a population. Their central procedure is linkage detection that reveals a problem structure, that is, how the entire problem consists of sub-problems. However, the model-based evolutionary algorithms have been shown to be ineffective for problems that do not have relevant structures or those whose structures are hard to identify. Therefore, evolutionary algorithms that can solve both types of problems quickly, reliably, and accurately are required. The objective of the paper is to investigate whether the evolutionary algorithm evolving developmental timings (EDT) that we previously proposed can be the desired one. The EDT makes some variables values more quickly converge than the remains for any problems, and then, decides values of the remains to obtain a higher fitness value under the fixation of the variables values. In addition, factors to decide which variable values converge more quickly, that is, developmental timings are evolution targets. Simulation results reveal that the EDT has worse performance than the linkage tree genetic algorithm (LTGA), which is one of the state-of-the-art model-based evolutionary algorithms, for decomposable problems and also that the difference in the performance between them becomes smaller for problems with overlaps among linkages and also that the EDT has better performance than the LTGA for problems whose structures are hard to identify. Those results suggest that an appropriate search strategy is different between decomposable problems and those hard to decompose.

    DOI: 10.3390/electronics9111866

  • Feature Extraction for Cocoa Bean Digital Image Classification Prediction for Smart Farming Application 査読有り 国際誌

    Yudhi Adhitya, Setya Widyawan Prakosa, Mario Köppen and Jenq-Shiou Leu

    International Journal of Agronomy, ( MDPI )   10(11) ( 1642 )   1 - 16   2020年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    The implementation of Industry 4.0 emphasizes the capability and competitiveness in agriculture application, which is the essential framework of a country’s economy that procures raw materials and resources. Human workers currently employ the traditional assessment method and classification of cocoa beans, which requires a significant amount of time. Advanced agricultural development and procedural operations differ significantly from those of several decades earlier, principally because of technological developments, including sensors, devices, appliances, and information technology. Artificial intelligence, as one of the foremost techniques that revitalized the implementation of Industry 4.0, has extraordinary potential and prospective applications. This study demonstrated a methodology for textural feature analysis on digital images of cocoa beans. The co-occurrence matrix features of the gray level co-occurrence matrix (GLCM) were compared with the convolutional neural network (CNN) method for the feature extraction method. In addition, we applied several classifiers for conclusive assessment and classification to obtain an accuracy performance analysis. Our results showed that using the GLCM texture feature extraction can contribute more reliable results than using CNN feature extraction from the final classification. Our method was implemented through on-site preprocessing within a low-performance computational device. It also helped to foster the use of modern Internet of Things (IoT) technologies among farmers and to increase the security of the food supply chain as a whole.

    DOI: 10.3390/agronomy10111642

  • Smart Watering System Based on Framework of Low-Bandwidth Distributed Applications (LBDA) in Cloud Computing 査読有り 国際誌

    Nurdiansyah Sirimorok, Mansur As, Kaori Yoshida and Mario Köppen

    In Proceedings of the 12th International Conference on Intelligent Networking and Collaborative Systems (INCoS-2020). ( Springer, Cham )   1263   447 - 459   2020年08月

     詳細を見る

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

    Victoria, Canada   2020年08月31日  -  2020年09月02日

    The estimation of soil moisture content is required for agriculture, mainly to build the irrigation scheduling model. In this study, we present a smart watering system to deal with various factors derived from the stochastic information in the agricultural operational, i.e., air temperature, air humidity, soil moisture, soil temperature, and light intensity. The methodology consists of exploiting the Internet of Things (IoT) using Low-Bandwidth Distributed Applications (LBDA) in cloud computing to integrate the real data sets collected by the several sensor technologies. We conducted experiments for the watering system used two types of soil and different plant. Here, the Long Short Term Memory Networks (LSTMs) approach in deep learning techniques used to build smart decisions concerning watering requirements and deal with heterogeneous information coming from agricultural environments. Results show that our models can effectively improve the prediction accuracy for the watering system over various soil and plants.

    DOI: 10.1007/978-3-030-57796-4_43

    その他リンク: https://link.springer.com/chapter/10.1007%2F978-3-030-57796-4_43

  • Identification and Classification of Sashimi Food Using Multispectral Technology 査読有り 国際誌

    Ismail Parewai, Mansur As, Tsunenori Mine and Mario Köppen

    Proceedings of the 2020 2nd Asia Pacific Information Technology Conference ( Association for Computing Machinery (ACM) New York, USA )   73 - 77   2020年01月

     詳細を見る

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

    Indonesia   2020年01月17日  -  2020年01月19日

    Food quality inspection is an essential factor in our daily lives. Food inspection is analyzing heterogeneous food data from different sources for perception, recognition, judgment, and monitoring. This study aims to provide an accurate system in image processing techniques for the inspection and classification of sashimi food damage based on detecting external data. The external texture was identified based on the visible and invisible system that was acquired using multispectral technology. We proposed the Grey Level Co-occurrence Matrix (GLCM) model for analysis of the texture features of images and the classification process was performed using Artificial Neural Network (ANN) method. This study showed that multispectral technology is a useful system for the assessment of sashimi food and the experimental also indicates that the invisible channels have the potential in the classification model, since the hidden texture features that are not clearly visible to the human eye

    DOI: 10.1145/3379310.3379317

  • Identification and Classification of Sashimi Food Using Multispectral Technology 査読有り 国際誌

    Ismail Parewai, Mansur As, Tsunenori Mine, and Mario Koeppen

    Proceedings of the 2020 2nd Asia Pacific Information Technology Conference (APIT 2020) ( Association for Computing Machinery )   66 - 72   2020年01月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

  • Blockchain Scheme Based on Evolutionary Proof of Work 査読有り

    Willa Ariela Syafruddin, Sajjad Dadkhah and Mario Köppen

    2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings   771 - 776   2019年06月

     詳細を見る

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

    © 2019 IEEE. In recent years, applications of the Blockchain concept, esp. as ledger for bitcoin transactions, has already resulted in huge amounts of wasted electrical energy for performing the Proof-of-Work tasks (cryptographic puzzles). Here, we consider an alternative concept to have this energy used at least for a useful purpose, the solution of real-world optimization problems. By means of the Traveling Salesperson Problem as model problem, we propose a concept to use optimization algorithms in an iterative manner to provide the Proof-of-Work needed to expand the Blockchain by a new block. The basic idea is to improve the tour cost for the best tour found for block n, extended by adding one more city, as a requirement for the inclusion of a new block in the Blockchain. This allows for the design of limited Blockchains, solving the underlying combinatorial optimization problems at the same time. Independently, it calls in for new efficient optimization algorithms and can serve as a real-world contest. It is discussed that metaheuristic algorithms perform an attractive class of optimization algorithms that can be used for the proposed approach. Numerical experiments also demonstrate the growth in problem complexity being handled by a binary PSO, which is a basic requirement for the full concept to work in practice.

    DOI: 10.1109/CEC.2019.8790128

    Scopus

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

  • Updatable indoor localization based on BLE signal fingerprint 査読有り

    Benaissa B., Yoshida K., Koppen M., Hendrichovsky F.

    Proceedings of the 2018 International Conference on Applied Smart Systems, ICASS 2018   2019年02月

     詳細を見る

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

    © 2018 IEEE. The need for a robust indoor localization solution is mounting in the recent few year, as the IoT technology is growing fast. In this paper, we discuss existing indoor localization approaches, focusing on the signal strength fingerprint approaches, to which belongs the presented study and based on Bluetooth Low Energy signal. The proposed approach employs the Radial Basis Functions (RBF) to create model that describe the real signal strength-position relationship. The present method is fully implemented on a smart phone, namely, offline data collection, model computation and online position estimation. This allow updating the model by collecting more signal data, therefore improving the localization accuracy with small efforts. The presented results shows that updating the model effectively improves the accuracy of estimation.

    DOI: 10.1109/ICASS.2018.8652035

    Scopus

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

  • Two-Factor Blockchain for Traceability Cacao Supply Chain 招待有り 査読有り

    Arsyad A.A., Dadkhah S., Köppen M.

    Lecture Notes on Data Engineering and Communications Technologies   23   332 - 339   2019年01月

     詳細を見る

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

    © 2019, Springer Nature Switzerland AG. The primary aim of food traceability is to increase food safety but traceability systems can also bring other benefits to production systems and supply chains. Technology has helped supply chain distribution to be successful and more competitive in the global market by improving their customers satisfaction level and providing more reasonable prices compared to their competitors. However, nowadays supply chains are long and complex and include many different actors, beginning with the farmers, followed by collectors, traders, manufacturers. At the end, the processed products are difficult to trace back to their origins in a trusted way. Best way so far is the continuous medial or legal documentation of the chain of transactions, available only to a limited circle of persons. The recent efforts toward blockchain-based trust management open a new perspective here. Here, we propose a solution to link legal documentation and blockchain technology within a traceability system, with the specific application case of cacao and chocolate production in mind. For improved data security, the common blockchain concept is extended to a two-factor blockchain, where both blockchains are connected via digital watermarking of the documentation media, one blockchain traces the documentation steps, the other the watermarking embedding. By a unique reading-verification approach, the integrity of their relatedness can be proven, thus improving also reliability of the whole product tracing.

    DOI: 10.1007/978-3-319-98557-2_30

    Scopus

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

  • Entropy Analysis of Questionable Text Sources by Example of the Voynich Manuscript 査読有り

    Natsuki Kouyama and Mario Köppen

    Communications in Computer and Information Science   1100   3 - 13   2019年01月

     詳細を見る

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

    © 2019, Springer Nature Singapore Pte Ltd. The Voynich Manuscript (referred to as ‘VMS’) can be considered as one of the oldest puzzles which remained unsolved until now. While some say VMS is genuine, others say that it is just a hoax. In this research, we propose three methods to analyze VMS and verify the effectiveness of them. The reason for using this manuscript is that no one on this planet knows the meaning of the text of VMS, so we can tackle research without being biased. We analyze from the viewpoint of character frequency and entropy of VMS. Statistical analysis of word frequency already exists, in contrast, we adopt analysis based on a character unit. In that respect, there is diversity from other research. We stated the following three hypotheses as H1 through H3. H1: VMS is a Ciphertext. H2: VMS is close to a programming language. H3: VMS is close to a natural language. The experimental results demonstrate that our methods are valid and efficient. The methods can be applied to all text sources and different classes of them can be distinguished. The possibility that VMS is likely a Ciphertext can be rejected. This mysterious manuscript can be concluded as a meaningful human art, not a hoax. Moreover, the VMS is not encrypted. (However, we are not able to exclude being encoded.)

    DOI: 10.1007/978-981-15-0399-3_1

    Scopus

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

  • Convolutional Neural Network Application in Smart Farming 査読有り

    Yudhi Adhitya, Setya Widyawan Prakosa, Mario Köppen and Jenq Shiou Leu

    Communications in Computer and Information Science   1100   287 - 297   2019年01月

     詳細を見る

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

    © 2019, Springer Nature Singapore Pte Ltd. The agricultural sector has a very pivotal role, furthermore very important in the global economy country in the world. The uses of machine learning become trending, and massive improvement technology has widely used in modern agricultural technology. Artificial Intelligent techniques are being used extensively in the agricultural sector as one purpose to increase the accuracy and to find solutions to the problems. As implementation of Artificial Intelligent (AI) based on Convolutional Neural Networks (CNN) application in several fields, indicates that CNN based machine learning scheme is adaptable and implemented on an agricultural area. In this contribution, we apply CNN based feature extraction on cocoa beans images. Cocoa beans images used in this study were cocoa beans (Theobroma Cacao L.) in various quality classes originating from districts in South Sulawesi, Indonesia, and we separate those images 30% for training and the remaining 70% for testing. From our assessment, the result shows that we can achieve 82.14% accuracy to classify seven classes of cocoa beans images using 5 CNN layers.

    DOI: 10.1007/978-981-15-0399-3_23

    Scopus

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

  • Crack identification using extended IsoGeometric analysis and particle swarm optimization 招待有り 査読有り

    Khatir S., Wahab M., Benaissa B., Köppen M.

    Lecture Notes in Mechanical Engineering   210 - 222   2019年01月

     詳細を見る

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

    © Springer Nature Singapore Pte Ltd. 2019. The eXtended isogeometric analysis (X-IGA) combined with Particle swarm optimization (PSO) is used for crack identification in twodimensional linear elastic problems based on inverse problem. The application of fracture mechanics test under mode II loading is performed. The X-IGA possesses the advantages of the combination between eXtended Finite Element Method (X-FEM) and the Isogeometric Analysis (IGA). The objective function minimizes the gap between the calculated and measured displacements. Convergence studies at various positions of crack on the plate are calculated and the results shows that the proposed technique can detect damage with minimum accuracy 95% for the position and maximum accuracy 98%.

    DOI: 10.1007/978-981-13-0411-8_21

    Scopus

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

  • An Efficient Replay Method to Prevent SURF-Based Face Detection 招待有り 査読有り

    Dadkhah S., Koppen M., Sadeghi S., Yoshida K.

    Proceedings - 2018 5th Asia-Pacific World Congress on Computer Science and Engineering, APWC on CSE 2018   18 - 25   2018年12月

     詳細を見る

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

    © 2018 IEEE. During the past couple of years, a considerable number of digital images are gathered by search engines, or uploaded by users in different social websites. These images could contain a variety of variables such as different faces, scenes, and unusual objects. The advancement of digital face recognition algorithms is sensational, recognition algorithms used by some of the social websites are even stronger than most secret service establishments. However, there is always a concern about how to protect the user's privacy when they do not want to be recognized automatically by these services. In this research, a SURF-based face recognition algorithm along with a featurebased attack to mislead this type of scheme is proposed. The recognition algorithm use different machine learning technique along with second layer descriptor counting function which makes it more powerful. However the primary focus of this research is to provide a method which can mislead this type of recognition systems with a smallest possible degradation to the image representation. The experimental results show that the proposed plan is successful to fool the SURF algorithm and its recognition system by 70%.

    DOI: 10.1109/APWConCSE.2018.00012

    Scopus

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

  • An efficient ward-based copy-move forgery detection method for digital image forensic 査読有り

    Dadkhah S., Koppen M., Sadeghi S., Yoshida K., Jalab H., Manaf A.

    International Conference Image and Vision Computing New Zealand   2017-December   1 - 6   2018年07月

     詳細を見る

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

    © 2017 IEEE. In recent years, with the improvement of digital manipulation tools, image forgeries have become a genuine social issue. Copy-move forgery is an important type of digital manipulation which is done by duplicating some parts of the image with the purpose of hiding specific information. Verifying the authenticity of the digital image can become vital for different forensic organizations. In this paper, an efficient copy-move detection algorithm with three level of Ward linkage based clustering is proposed. The proposed algorithm extracts the local image features with the help of Scale-invariant feature transform algorithm (SIFT). In the proposed method, a Ward-based clustering scheme followed by three levels of false-descriptor elimination is applied. The proposed elimination system utilizes Euclidean distance to improve the accuracy of the region detection scheme. The efficiency of the proposed algorithm is examined against several different post-processing attacks such as multilevel forgeries, noises, and JPEG compression. Experimental results illustrate that the proposed algorithm improves the detection accuracy by eliminating false descriptors.

    DOI: 10.1109/IVCNZ.2017.8402472

    Scopus

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

  • Bad Ai: Investigating the Effect of Half-Toning Techniques on Unwanted Face Detection Systems 査読有り

    Dadkhah S., Köeppen M., Sadeghi S., Yoshida K.

    2018 9th IFIP International Conference on New Technologies, Mobility and Security, NTMS 2018 - Proceedings   2018-January   1 - 5   2018年03月

     詳細を見る

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

    Currently, automatic face detection systems are widely used in various social media. The improvement of the automated intelligent face recognition can easily result in the invasion of the user 's privacy if the predefined functions for their so- called artificial intelligent systems are designed with no respect to the user privacy, this means that users do not get the right to prevent these types of automatic face detection. The problem does not stop here, and recently some organization attempted to use automated face recognition system as a digital personal judgment tools. For instance, judging if a person is criminal only based on the attributes of his/her face. In the present technology, spreading the personal information such as individual digital images are fast and inevitable. Thus, in this paper, some of the techniques to evade automatic face recognition is investigated. The focused of this article is to highlight the advantages of different Half-Toning algorithms concerning avoiding unwanted automated face detection/recognition. In the experimental phase, the result of varying filtering and modification algorithms compared to the proposed filtering technique.

    DOI: 10.1109/NTMS.2018.8328726

    Scopus

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

  • Phone Application for Indoor Localization Based on Ble Signal Fingerprint 査読有り

    Benaissa B., Hendrichovsky F., Yishida K., Köppen M., Sinčák P.

    2018 9th IFIP International Conference on New Technologies, Mobility and Security, NTMS 2018 - Proceedings   2018-January   1 - 5   2018年03月

     詳細を見る

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

    © 2018 IEEE. Indoor position of devices and persons is a very valuable information for context-aware devices and human activity recognition. The need of such information grows bigger by the advancement of IoT technologies. In this paper, we discuss existing indoor positioning approaches and their applications, give specific interest to the signal strength fingerprint approaches, to which belongs the presented paper. Bluetooth Low Energy Beacons are used as the source of the signal, and the Radial Basis Functions method is employed to create a model that relates to signal strength and position. The proposed approach allows the possibility of making all the computation on a smartphone application, namely, offline data collection and model computation, and online position estimation. Besides, it allows updating the model later.

    DOI: 10.1109/NTMS.2018.8328729

    Scopus

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

  • Fairness aspects of secondary radio spectrum access 査読有り

    Köppen M., Tsuru M.

    Lecture Notes on Data Engineering and Communications Technologies   8   445 - 455   2018年01月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:記事・総説・解説・論説等(学術雑誌)

    © Springer International Publishing AG 2018. We consider the allocation of secondary radio spectrum under fairness constraints. Two neutrality aspects apply here: the provider allocates independent of the packet utility of the secondary user, and: all secondary users are given the same unbiased opportunity to access the available spectrum. The first means that the standard fairness models do not apply directly, the second that we are more interested in the chance of a secondary user to place a number of packets together, i.e. a numerical value from (0, 1]. This leads us to a formulation of the underlying combinatorial optimization problem as an “multi-user knapsack proble” (MUK). For short, it means that several users put their items into the same knapsack and the fairness is related to the share of packed items for each user. We discuss how common ideas from other fairness models can be applied to this new problem, esp. the concept of fairness as convex mean maximization. A number of example cases are studied to demonstrate feasibility of the proposed approach.

    DOI: 10.1007/978-3-319-65636-6_40

    Scopus

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

  • Does the Jaya algorithm really need no parameters? 招待有り 査読有り

    Syafruddin W.A., Köppen M., Benaissa B.

    IJCCI 2018 - Proceedings of the 10th International Joint Conference on Computational Intelligence   264 - 268   2018年01月

     詳細を見る

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

    Copyright © 2018 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved. Jaya algorithm is a swarm optimization algorithm, formulated on the concept where the solution obtained for a given problem moves toward the best solution and away from the worst solution. Despite being a very simple algorithm, it has shown excellent performance for various application. It has been claimed that Jaya algorithm is parameter-free. Here, we want to investigate the question whether introducing parameters in Jaya might be of advantage. Results show the comparison of the results for different benchmark function, indicating that, apart from a few exceptions, generally no significant improvement of Jaya can be achieved this way. The conclusion is that we have to consider the operation of Jaya differently from a modified PSO and more in the sense of a stochastic gradient descent.

    DOI: 10.5220/0006960702640268

    Scopus

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

  • Activity and Emotion Recognition for Elderly Health Monitoring 査読有り

    Brahim Benaissa, Mario Köppen and Kaori Yoshida

    International Journal of Affective Engineering ( Japan Society of Kansei Engineering )   17(2)   81 - 88   2017年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    The problems facing elderly who are living independently, are considered to be one of the most important motivations of the activity recognition research. The advances in sensing technologies allow collecting several types of data and communicate it wirelessly. However, most existing activity recognition systems requires pre-calculated pattern recognition models. This paper lays the theoretical foundations of a real-time methodology for activity and emotional recognition based on body and environment sensors simultaneously, then tackles one aspect of the method which is the path estimation using chest-mounted IMU sensor, for which a zero velocity update criteria is proposed. Finally path estimation results for sitting down, laying down, falling down and standing up are discussed.

    DOI: 10.5057/ijae.IJAE-D-17-00020

  • Application of proper orthogonal decomposition and radial basis functions for crack size estimation using particle swarm optimization 査読有り

    Benaissa B., Köppen M., Abdel Wahab M., Khatir S.

    Journal of Physics: Conference Series   842 ( 1 )   2017年06月

     詳細を見る

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

    © Published under licence by IOP Publishing Ltd. Complex engineering problems require simulations, which are computationally expensive in cases of inverse identification tasks since they commonly requires hundreds of thousands of simulations. This paper propose a method based on model reduction for crack size estimation, combining the proper orthogonal decomposition method with radial basis functions. The reduced model is validated by comparing the obtained boundary displacements with the corresponding results from a finite element model. This inverse procedure is formulated as the minimization of the difference between the measured and computed values of displacement at selected boundary nodes, called sensor points, using particle swarm optimization algorithm. Convex and a non-convex specimens have been considered for investigations of crack presence, and identification of its size, different crack sizes have been tested to demonstrate the efficiency of the proposed approach.

    DOI: 10.1088/1742-6596/842/1/012014

    Scopus

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

  • Detecting malicious URLs using machine learning techniques 査読有り

    Vanhoenshoven F., Napoles G., Falcon R., Vanhoof K., Koppen M.

    2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016   2017年02月

     詳細を見る

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

    © 2016 IEEE. The World Wide Web supports a wide range of criminal activities such as spam-advertised e-commerce, financial fraud and malware dissemination. Although the precise motivations behind these schemes may differ, the common denominator lies in the fact that unsuspecting users visit their sites. These visits can be driven by email, web search results or links from other web pages. In all cases, however, the user is required to take some action, such as clicking on a desired Uniform Resource Locator (URL). In order to identify these malicious sites, the web security community has developed blacklisting services. These blacklists are in turn constructed by an array of techniques including manual reporting, honeypots, and web crawlers combined with site analysis heuristics. Inevitably, many malicious sites are not blacklisted either because they are too recent or were never or incorrectly evaluated. In this paper, we address the detection of malicious URLs as a binary classification problem and study the performance of several well-known classifiers, namely Naïve Bayes, Support Vector Machines, Multi-Layer Perceptron, Decision Trees, Random Forest and k-Nearest Neighbors. Furthermore, we adopted a public dataset comprising 2.4 million URLs (instances) and 3.2 million features. The numerical simulations have shown that most classification methods achieve acceptable prediction rates without requiring either advanced feature selection techniques or the involvement of a domain expert. In particular, Random Forest and Multi-Layer Perceptron attain the highest accuracy.

    DOI: 10.1109/SSCI.2016.7850079

    Scopus

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

  • Electromagnetismlike mechanism descriptor with fourier transform for a passive copy-move forgery detection in digital image forensics 査読有り

    Dadkhah S., Köppen M., Jalab H., Sadeghi S., Manaf A., Uliyan D.

    ICPRAM 2017 - Proceedings of the 6th International Conference on Pattern Recognition Applications and Methods   2017-January   612 - 619   2017年01月

     詳細を見る

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

    Copyright © 2017 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved. Copy-move forgery is a special type of forgery that involves duplicating one region of an image by covering it with a copy of another region from the same image. This study develops a simple and powerful descriptor called Electromagnetismlike mechanism descriptor (EMag), for locating tampered areas in copy-move forgery on the basis of Fourier transform within a reasonable amount of time. EMag is based on the collective attraction-repulsion mechanism, which considers each images pixel as an electrical charge. The main component of EMag is the degree of the attraction-repulsion force between the current pixel and its neighbours. In the proposed algorithm, the image is divided into similar non-overlapping blocks, and then the final force for each block is evaluated and used to construct the tampered image features vector. The experimental results demonstrate the efficiency of the proposed algorithm in terms of detection time and detection accuracy. The detection rate of the proposed algorithm is improved by reduction of false positive rate (FPR) and increment of true positive rate (TPR).

    Scopus

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

  • Non-swarm intelligence search algorithm based on the foraging behaviors of fruit flies 査読有り

    Ohnishi K., Fujiwara A., Koeppen M.

    2016 IEEE Congress on Evolutionary Computation, CEC 2016   1509 - 1516   2016年11月

     詳細を見る

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

    © 2016 IEEE. In the present study, we examine the foraging behavior of the fruit fly (Drosophila), which unlike social insects, independently and autonomously forages. Moreover, we propose a new population-based, non-swarm intelligence search algorithm that mimics the foraging behaviors of fruit flies. We find that the time that a fruit fly stays in a food source region follows a power-law. A power-law distribution satisfies the scale-free property, so the observed behaviors of fruit flies can be called scale-free behaviors, which are modeled by the proposed algorithm. We examine the effect of scale-free behaviors on search performance by applying the proposed algorithm to 28 test functions with two real parameters. The results reveal that the scale-free property is related to a balance between exploration and exploitation and affects the search performance. Moreover, particular parameter values for fixing the scale-free property yield a better search performance for most of the test functions considered herein. The present paper does not provide a competent search algorithm for solving static optimization problems, but rather introduces a novel temporal property of individual behaviors, i.e., a scale-free property, which is expected to provide a new way to think about search algorithms.

    DOI: 10.1109/CEC.2016.7743968

    Scopus

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

  • Applied Soft Computing: Preface 招待有り 査読有り

    Polat K., Asyali M., Muthusamy H., Rajendra Acharya U., Köppen M.

    Applied Soft Computing Journal   37   939 - 941   2015年12月

     詳細を見る

    記述言語:英語   掲載種別:記事・総説・解説・論説等(その他)

    DOI: 10.1016/j.asoc.2015.08.022

    Scopus

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

  • Neural Signature of Efficiency Relations 査読有り

    Basterrech, Sebastian and Ohnishi, Kei and Koppen, Mario

    Systems, Man, and Cybernetics (SMC), 2015 IEEE International Conference on   2090 - 2095   2015年10月

     詳細を見る

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

    Hong Kong   2015年10月09日  -  2015年10月12日

    DOI: 10.1109/SMC.2015.365

    Scopus

  • Message from the ADMNET 2015 Workshop Organizers 査読有り

    Nariyoshi Yamai, Mario Köppen and Youngseok Lee

    Published in: 2015 IEEE 39th Annual Computer Software and Applications Conference ( IEEE )   3   2015年09月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    Taichung, Taiwan   2015年07月01日  -  2015年07月05日

    The ADMNET workshop series is focusing on the discussion of the advance of the state-of-the-art, research and development in the area of architecture, design, deployment and management of networks and Internet-based applications. This workshop is also a forum for designers, developers and administrators of the networks and applications. ADMNET covers a wide field of topics such as Network Architecture and Design, QoS, Scalability Solutions, Fairness, Optimality, and other aspects of Network Resource Sharing, Network Deployment, Management and Operation, Network Security, Network Applications and their Operation, Meta-Heuristics and Soft Computing Approaches for Networking Technologies, Network Metrics, Network Growth and Percolation Models, Modeling of Users and Network-Based Services, Digital Convergence, ITIL, User Policy and Service Level Agreements, Computer Ethics and Education.

    DOI: 10.1109/COMPSAC.2015.294

    Scopus

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

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    France   Paris   2015年07月27日  -  2015年07月29日

    DOI: 10.1109/NTMS.2015.7266534

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    Japan   Okinawa   2014年11月27日  -  2014年11月29日

    DOI: 10.1109/ISDA.2014.7066256

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    DOI: 10.1155/2014/725974

    Scopus

    その他リンク: http://www.hindawi.com/journals/jam/

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    Malaysia   2013年12月05日  -  2013年12月08日

    DOI: 10.1109/ISDA.2013.6920744

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    China   2013年09月09日  -  2013年09月11日

    DOI: 10.1109/INCoS.2013.161

    Scopus

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

    Kei Ohnishi and Mario Köppen

    COMPSAC 2013   2013年07月

     詳細を見る

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

    Japan   Kyoto   2013年07月22日  -  2013年07月26日

    DOI: 10.1109/COMPSACW.2013.99

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    Kyoto  

    DOI: 10.1109/COMPSACW.2013.100

    Scopus

  • 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

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(学術雑誌)

    DOI: 10.1007/s12065-012-0084-5

    Scopus

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

    DOI: 10.1007/s12065-012-0085-4

    Scopus

  • 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月

     詳細を見る

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

    DOI: 10.1109/ICSMC.2012.6377759

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    DOI: 10.1109/iNCoS.2012.92

    Scopus

  • 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月

     詳細を見る

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

    DOI: 10.1109/iNCoS.2012.109

    Scopus

  • 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月

     詳細を見る

    担当区分:責任著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)

    DOI: 10.1109/ICGEC.2012.108

    Scopus

  • 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

  • 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

  • Fuzzification of Maxmin Fairness Relation based on Subvector Dominance Degree 査読有り

    Mario Koppen,Kaori Yoshida and Masato Tsuru

    Proc. of 2nd International Conference on Intelligent Networking and Collaborative Systems (INCoS2010)   2010年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    2010年11月  -  2010年11月

  • Comparison of Evolutionary Multi-Objective Optimization Algorithms for the Utilization of Fairness in Network Control 査読有り

    Mario Koppen,Rodrigo Verschae,Kaori Yoshida and Masato Tsuru

    2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2010)   2010年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    2010年10月  -  2010年10月

    DOI: 10.1109/ICSMC.2010.5641898

    Scopus

  • Partial user-supplied information and user modeling for improving QoS 査読有り

    Rodrigo Verschae,Mario Koppen and Kaori Yoshida

    Simulation Modelling Practice and Theory   19 ( 1 )   47 - 55   2010年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    DOI: 10.1016/j.simpat.2010.06.014

    Scopus

  • Gestalt Aspects of Security Pattern 査読有り

    ケッペン マリオ

    Computational Forensics: 4th International Workshop, IWCF 2010   2010年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    2010年04月  -  2010年04月

  • Differential Evolution with Polymorphic Schemes 査読有り

    Christian Veenhuis,Mario Koeppen

    Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics   1814 - 1819   2009年10月

     詳細を見る

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

    America   San Antonio, TX   2009年10月11日  -  2009年10月14日

  • Evolutionary Routing-Path Selection in Congested Communication Networks 査読有り

    Mario Koeppen,Kaori Yoshida,Masato Tsuru,Yuji Oie

    Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics   2224 - 2229   2009年10月

     詳細を見る

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

    America   San Antonio, TX   2009年10月11日  -  2009年10月14日

  • Fairness-based Global Optimization of User-Centric Networks 査読有り

    Mario Koeppen,Kaori Yoshida,Masato Tsuru,Yuji Oie

    2009 International Conference on Networked Computing   441 - 443   2009年08月

     詳細を見る

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

    South Korea   Seoul   2009年08月25日  -  2009年08月27日

  • Archiving Strategies for On-line Decision Making in Evolutionary Multi-Objective Optimization 査読有り

    Mario Koeppen,Kaori Yoshida,Masato Tsuru,Yuji Oie

    Hybrid Intelligent Systems, 8th International Conference   465 - 470   2008年09月

     詳細を見る

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

    Spain   Barcelona   2008年09月10日  -  2008年09月12日

  • Evolutionary Approach to Maxmin-Fair Network-Resource Allocation 査読有り

    Mario Koeppen,Masato Tsuru,Yuji Oie

    Applications and the Internet, IEEE/IPSJ International Symposium   253 - 256   2008年08月

     詳細を見る

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

    Finland   Turku   2008年07月28日  -  2008年08月01日

  • User Modeling by Confabulation Theory 査読有り

    Mario Koeppen and Kaori Yoshida

    2008 IEEE Conference on Soft Computing in Industrial Applications   55 - 59   2008年06月

     詳細を見る

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

    Muroran   2008年06月25日  -  2008年06月27日

  • Auxiliary Objectives for the Evolutionary Multi-Objective Principal Color Extraction from Logo Images 査読有り

    Mario Koeppen,Yutaka Kinoshita and Kaori Yoshida

    2008 IEEE Congress on Evolutionary Computation (CEC08)   3536 - 3542   2008年06月

     詳細を見る

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

    Hong Kong   Hong Kong   2008年06月01日  -  2008年06月06日

  • Pattern Formation in Networks Inspired by Biological Development 査読有り

    Ohnishi,Kei,Yoshida,Kaori and Koeppen,Mario

    Arts and Technology   64 - 71   2008年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    DOI: 10.1007/978-3-642-11577-6_9

    Scopus

  • Heuristic Maxmin Fairness for the Wireless Channel Allocation Problem 査読有り

    Mario Koppen,Rodrigo Verschae,Kaori Yoshida,Masato Tsuru

    International Conference on Broadband, Wireless Computing, Communication and Applications   606 - 611   2008年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    2008年04月  -  2008年04月

    DOI: 10.1109/BWCCA.2010.141

    Scopus

  • Interactive Genetic Algorithm for Font Generation System 査読有り

    Kaori Yoshida,Yuta Nakagawa and Mario Koppen

    Proc. World Automation Congress (WAC2010)   2008年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)

    2008年04月  -  2008年04月

  • Image Enhancement through Intelligent Localized Fusion Operators in the Automated Visual Inspection of Highly Reflective Surfaces 査読有り

    Aureli Soria-Frisch and Mario Koeppen

    Information Fusion   9 ( 2 )   142 - 155   2008年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

  • Evolutionary Multi-Objective Optimization of Particle Swarm Optimizers. 査読有り

    Christian Veenhuis,Mario Köppen and Raul Vicente Garcia

    2007 IEEE Congress on Evolutionary Computation   2273 - 2280   2007年09月

     詳細を見る

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

    Singapore   Singapore   2007年09月25日  -  2007年09月28日

  • Visualization of Pareto-Sets in Evolutionary Multi-Objective Optimization 査読有り

    Mario Koeppen and Kaori Yoshida

    Seventh International Conference on Hybrid Intelligent Systems (HIS'07)   156 - 161   2007年09月

     詳細を見る

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

    Germany   Kaiserslautern   2007年09月17日  -  2007年09月19日

  • Pareto-dominated Hypervolume Measure: An Alternative Approach to Color Morphology 査読有り

    Mario Koeppen and Katrin Franke

    Seventh International Conference on Hybrid Intelligent Systems (HIS'07)   234 - 239   2007年09月

     詳細を見る

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

    Germany   Kaiserslautern   2007年09月17日  -  2007年09月19日

  • Perception of image similarity considering Gestalt theory 査読有り

    Yutaka Kinoshita,Mario Koeppen,Kaori Yoshida

    International Conference of Soft Computing and Human Sciences 2007   2007年08月

     詳細を見る

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

    Kitakyushu   2007年08月02日  -  2007年08月05日

  • Gestalt Theory in Image Processing: A discussion paper 査読有り

    Mario Koeppen,Kaori Yoshida

    2007 IEEE Three-Rivers Workshop on Soft Computing in Industrial Applications (SMCia/07)   157 - 161   2007年08月

     詳細を見る

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

    Germany   Passau   2007年08月01日  -  2007年08月03日

  • Many-Objective Particle Swarm Optimization by Gradual Leader Selection 査読有り

    Mario Koeppen,Kaori Yoshida

    Proceedings of Intl. Conference on Adaptive and Natural Computing Algorithms (ICANNGA07)   323 - 331   2007年04月

     詳細を見る

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

    Poland   Warsaw   2007年04月11日  -  2007年04月14日

  • A framework for the adaptation of image operators 査読有り

    Mario Köppen and Raul Vicente-Garcia

    Genetic and Evolutionary Computation for Image Processing and Analysis   215 - 239   2007年04月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)

  • Substitute Distance Assignments in NSGA-II for Handling Many-Objective Optimization Problems 査読有り

    Mario Koeppen and Kaori Yoshida

    Evolutionary Multi-Criterion Optimization, 4th International Conference, EMO 2007   727 - 741   2007年03月

     詳細を見る

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

    Sendai   2007年03月05日  -  2007年03月08日

▼全件表示

著書

  • Soft Computing in Data Science: Conference proceedings SCDS 2019, Iizuka, Japan, August 28–29, 2019

    Michael W. Berry, Bee Wah Yap, Azlinah Mohamed and Mario Köppen(編集)

    Springer, Singapore  2019年08月  ( ISBN:978-981-15-0398-6

     詳細を見る

    記述言語:英語

    This book constitutes the refereed proceedings of the 5th International Conference on Soft Computing in Data Science, SCDS 2019, held in Iizuka, Japan, in August 2019.
    The 30 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers are organized in topical sections on ​information and customer analytics; visual data science; machine and deep learning; big data analytics; computational and artificial intelligence; social network and media analytics.

  • MEDES '18: Proceedings of the 10th International Conference on Management of Digital EcoSystems,Tokyo, Japan, September, 2018

    Richard Chbeir and Hiroshi Ishikawa and Kazutoshi Sumiya and Kenji Hatano and Mario Köppen(編集)

    Association for Computing Machinery (ACM), New York, NY, United States  2018年09月  ( ISBN:9781450356220

     詳細を見る

    記述言語:英語

    On behalf of the Organizing Committee, we welcome you to the 10th International Conference on Management of Emergent Digital EcoSystems (MEDES'18) hosted by the Tokyo Metropolitan University, Minami-Osawa campus, Tokyo/Japan. The 1st MEDES conference was organized in Lyon-France. Since then, it has always been technically supported by the ACM Special Group On Applied Computing (ACM SIGAPP and ACM SIGAPP.fr). After 10 years of continuous presence, this conference has become the premier forum for the dissemination of leading edge research in Digital Ecosystems. The MEDES conference series continues this tradition of bringing students, researchers and practitioners together to exchange and share their contributions related to various areas of the expanding universe of digital ecosystems. Previous events took place in Thailand (2017), France (2016), Brazil (2015), Saudi Arabia (2014), Luxembourg (2013), Ethiopia (2012), USA (2011), Thailand (2010), and France (2009).

  • Hybrid intelligence for social networks

    Banati H., Bhattacharyya S., Mani A., Köppen M.(単著)

    Hybrid Intelligence for Social Networks  2017年11月  ( ISBN:9783319651392

     詳細を見る

    記述言語:日本語

    © Springer International Publishing AG 2017. All rights reserved. This book explains aspects of social networks, varying from development and application of new artificial intelligence and computational intelligence techniques for social networks to understanding the impact of social networks. Chapters 1 and 2 deal with the basic strategies towards social networks such as mining text from such networks and applying social network metrics using a hybrid approach; Chaps. 3 to 8 focus on the prime research areas in social networks: community detection, influence maximization and opinion mining. Chapter 9 to 13 concentrate on studying the impact and use of social networks in society, primarily in education, commerce, and crowd sourcing. The contributions provide a multidimensional approach, and the book will serve graduate students and researchers as a reference in computer science, electronics engineering, communications, and information technology.

    Scopus

  • Computational Intelligence in Wireless Sensor Networks

    Ajith Abraham, Rafael Falcon, Mario Koeppen(編集)

    Springer, Cham  2017年01月 

     詳細を見る

    記述言語:英語

    This book emphasizes the increasingly important role that Computational Intelligence (CI) methods are playing in solving a myriad of entangled Wireless Sensor Networks (WSN) related problems. The book serves as a guide for surveying several state-of-the-art WSN scenarios in which CI approaches have been employed. The reader finds in this book how CI has contributed to solve a wide range of challenging problems, ranging from balancing the cost and accuracy of heterogeneous sensor deployments to recovering from real-time sensor failures to detecting attacks launched by malicious sensor nodes and enacting CI-based security schemes. Network managers, industry experts, academicians and practitioners alike (mostly in computer engineering, computer science or applied mathematics) benefit from the spectrum of successful applications reported in this book. Senior undergraduate or graduate students may discover in this book some problems well suited for their own research endeavors.

  • Soft Computing in Industrial Applications: Proceedings of the 17th Online World Conference on Soft Computing in Industrial Applications

    Snášel, Václav, Pavel Krömer, Mario Köppen, and Gerald Schaefer(共編者(共編著者))

    Springer  2014年07月  ( ISBN:978-3-319-00929-2

     詳細を見る

    記述言語:英語

  • Special Issue on Security-Aware and Data Intensive Low-Cost Mobile Systems, Mobile Networks and Applications

    Joanna Kolodziej, Martin Gilje Jaatun, Samee Ullah Khan, Mario Koeppen(共編者(共編著者))

    Springer  2013年10月 

     詳細を見る

    記述言語:英語

  • Soft Computing in Industrial Applications: Proceedings of the 17th Online World Conference on Soft Computing in Industrial Applications

    Vaclav Snasel, Pavel Kroemer, Mario Koeppen, Gerald Schaefer(共編者(共編著者))

    Springer  2013年08月  ( ISBN:978-3-319-00929-2

     詳細を見る

    記述言語:英語

  • Special Issue: Information Network Design, International Journal of Space-Based and Situated Computing

    Masaki Aida, Akira Arutaki, Mario Koeppen, Masato Tsuru(共編者(共編著者))

    Inderscience Publishers  2013年08月 

     詳細を見る

    記述言語:英語

  • Special Issue on Computational Intelligence in Computer Vision and Image Processing, IEEE Computational Intelligence Magazine (CIM)

    Mengjie Zhang, Mario Koeppen, Sergio Damas(共編者(共編著者))

    IEEE CIS  2013年08月 

     詳細を見る

    記述言語:英語

▼全件表示

口頭発表・ポスター発表等

  • Network Fairnessの評価に関する研究

    第12回日本知能情報ファジィ学会九州支部学術講演会 

     詳細を見る

    開催期間: 2010年12月   記述言語:日本語  

  • 自己組織化マップを用いたアンケート結果の可視化と分析

    第9回日本知能情報ファジィ学会九州支部学術講演会予稿集 

     詳細を見る

    開催期間: 2007年12月   記述言語:日本語   開催地:日本 熊本  

  • The Gestalt of Web-services

    Tutorial at 2007 International Conference on Next Generation Web Services Practices 

     詳細を見る

    開催期間: 2007年10月29日 - 2007年10月31日   記述言語:英語   開催地: Korea Seoul  

  • 視覚認知に基づくWebインタフェースデザインに関する考察

    情報処理学会研究報告. HCI, ヒューマンコンピュータインタラクション研究会報告 

     詳細を見る

    開催期間: 2007年10月   記述言語:日本語   開催地:日本  

科研費獲得実績

  • フェアネス理論に基づく高度中継ルータによるネットワーク資源制御

    研究課題番号:24650030  2012年04月 - 2013年03月   挑戦的萌芽研究

担当授業科目(学内)

  • 2022年度   Computational Security: Basic Topics

  • 2022年度   Computational Security: Advanced Topics

  • 2021年度   コンピュテーショナルセキュリティ

  • 2020年度   コンピュテーショナルセキュリティ

  • 2019年度   コンピュテーショナルセキュリティ

  • 2019年度   Computer Literacy

  • 2018年度   Computer Literacy

  • 2018年度   コンピュテーショナルセキュリティ

  • 2017年度   コンピュテーショナルセキュリティ

  • 2017年度   Computer Literacy

  • 2016年度   コンピュテーショナルセキュリティ

  • 2016年度   Computer Literacy

  • 2015年度   コンピュテーショナルセキュリティ

  • 2015年度   Computer Literacy

  • 2014年度   コンピュテーショナルセキュリティ

  • 2014年度   コンピュテーショナルセキュリティF

  • 2014年度   コンピュテーショナルセキュリティC

  • 2014年度   Computer Literacy

  • 2013年度   コンピュテーショナルセキュリティF

  • 2012年度   Computer Literacy

  • 2012年度   コンピュテーショナルセキュリティ

▼全件表示

その他教育活動

  • External Examiner, Master in Computer Science Course, Stellenbosch University, South Africa

    2020年11月

     詳細を見る

    Scalability of the Multi-Guide Particle Swarm Optimization Algorithm

  • Ph.D. Proposal reviewer, Edith Cowan University, Perth, Australia

    2020年08月
    -
    2020年10月

     詳細を見る

    Machine Learning Approaches for Anatomical Feature Measurement in Fetal Ultrasound Images

学会・委員会等活動

  • European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2021), as part of the EvoStar 2021   Program Committee Member  

    2021年04月

  • The 5th International Conference on Soft Computing in Data Science (SCDS2019), Iizuka, Fukuoka, Japan, August 28-29, 2019.   Conference Chair  

    2019年08月

  • 2019 International Conference on Platform Technology and Service (PlatCon-19), Jeju, Korea, January 28-30, 2019   General Chairs  

    2019年01月

国際会議開催(学会主催除く)

  • A Special Session on Evolutionary Computer Vision and Image Processing (ECVIP) at the 2021 IEEE Congress on Evolutionary Computation (CEC 2021)

    IEEE Congress on Evolutionary Computation  Poland  2021年06月01日 - 2021年07月01日

  • The 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications 2021 (VISAPP2021 is part of VISIGRAPP)

    Vienna University of Technology/Technische Universität (TU) Wien  Vianna, Austria  2021年02月08日 - 2021年02月10日

  • The 10th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2021)

    Vienna University of Technology/Technische Universität (TU) Wien  Vienna, Austria  2021年02月04日

  • The 16th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD 2020)

    Shaanxi University of Science and Technology and Lanzhou Jiaotong University  Xi'an, China  2020年12月12日 - 2020年12月21日

  • 2020 IEEE Symposium on Computational Intelligence for Multimedia Signal and Vision Processing (IEEE CIMSIVP) 2020.

    IEEE SSCI  Canberra, Australia  2020年12月01日 - 2020年12月04日

  • The 3rd Smart Cities Symposium - 2020 (SCS'20)

    University of Bahrain  Bahrain  2020年09月21日 - 2020年09月23日

  • 20th European Conference on Evolutionary Computations in Combinatorial Optimisation (EvoCOP 2020)

    EvoStar - SPECIES, the Society for the Promotion of Evolutionary Computation in Europe and its Surroundings  Seville, Spain  2020年04月15日 - 2020年04月17日

  • Image and Vision Computing New Zealand (IVCNZ 2019)

    IVCNZ New Zealand  New Zealand  2019年12月02日 - 2019年12月04日

  • The Genetic and Evolutionary Computation Conference (GECCO 2019)

    The Association for Computing Machinery (ACM) Special Interest Group on Genetic and Evolutionary Computation (SIGEVO)  Prague, Czech Republic  2019年07月13日 - 2019年07月17日

  • The 20th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL 2019)

    The University of Manchester  Manchester, United Kingdom  2019年05月20日 - 2019年05月21日

▼全件表示