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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

記述言語：英語   掲載種別：記事・総説・解説・論説等（その他）

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

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

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

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

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

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

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

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

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

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

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

© 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

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

© 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

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

© 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

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

© 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

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

© 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

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

© 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

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

© 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

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

© 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

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

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

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

© 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

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

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

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

© 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

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

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

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

© 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

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

© 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

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

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

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

© 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

記述言語：英語   掲載種別：記事・総説・解説・論説等（その他）

DOI： 10.1016/j.asoc.2015.08.022

Scopus

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

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

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

DOI： 10.1109/SMC.2015.365

Scopus

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

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

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

© 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

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

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

DOI： 10.1109/NTMS.2015.7266534

Scopus

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

© 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

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

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

DOI： 10.1109/ISDA.2014.7066256

Scopus

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

DOI： 10.1155/2014/725974

Scopus

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

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

© 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

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

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

DOI： 10.1109/ISDA.2013.6920744

Scopus

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

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

DOI： 10.1109/INCoS.2013.161

Scopus

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

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

DOI： 10.1109/COMPSACW.2013.99

Scopus

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

Kyoto  

DOI： 10.1109/COMPSACW.2013.100

Scopus

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

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

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

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

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

DOI： 10.1007/s12065-012-0084-5

Scopus

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

DOI： 10.1007/s12065-012-0085-4

Scopus

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

DOI： 10.1109/ICSMC.2012.6377759

Scopus

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

DOI： 10.1109/iNCoS.2012.92

Scopus

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

DOI： 10.1109/iNCoS.2012.109

Scopus

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

DOI： 10.1109/ICGEC.2012.108

Scopus

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

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

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

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

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

2010年11月  -  2010年11月

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

2010年10月  -  2010年10月

DOI： 10.1109/ICSMC.2010.5641898

Scopus

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

DOI： 10.1016/j.simpat.2010.06.014

Scopus

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

2010年04月  -  2010年04月

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

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

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

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

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

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

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

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

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

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

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

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

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

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

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

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

Scopus

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

2008年04月  -  2008年04月

DOI： 10.1109/BWCCA.2010.141

Scopus

記述言語：英語   掲載種別：研究論文（その他学術会議資料等）

2008年04月  -  2008年04月

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

記述言語：英語

記述言語：英語

記述言語：英語

記述言語：英語