Search

Ontology matching plays a pivotal role in aligning entities across diverse ontologies, enhancing interoperability and data exchange. Similarity features are the foundation of ontology matching, which assess entity similarities from multiple perspectives. Selecting relevant similarity features tailored to specific matching tasks is crucial due to the intricate heterogeneity of entities. However, traditional similarity feature selection methods face significant limitations, such as reliance on extensively curated datasets, the need for extensive human intervention, and inconsistencies in handling complex high-dimensional data structures. To address these challenges, we develop a novel transfer learning approach for automatic similarity feature selection. Our approach includes a new transfer learning framework to enhance similarity feature selection for ontology matching, a novel similarity feature alignment extraction method utilizing mutual information to align feature subsets using an entropy-based metric, and a real-value compact genetic algorithm to adjust the feature space and train an ordered weighting aggregation-based classifier. We compared our method with advanced techniques on OAEI’s Benchmark and Bio-ML datasets. Experimental results show that our method significantly outperforms the competitors across various tasks. By automating similarity feature selection and reducing dependency on manual interventions, our method addresses the complexities of traditional approaches, enhancing the practical utility of ontology matching.

Abstract Sustainable freight transportation is one of the essential concepts in the smart city. Under this concept, many people connected with mobile devices produce location data and potential opportunities for transporting small objects in a more environmentally friendly and sustainable way. Crowdshipping, which utilises public people as transportation, is one of the terminal solutions in the last mile delivery scenario. Nevertheless, precisely assigning the delivery to the right crowd willing to accept the job is challenging because the solution space is too large to perform a full search. This article proposes a trajectory feature extraction algorithm and a task‐to‐crowd matching (T2CM) algorithm for coping with the job‐to‐crowd assignment problem. A simulation based on the real‐world dataset is conducted on three different scenarios to justify the outcome from our proposed method to the job assignment results.

For any structures, Reinforced concrete (RC) columns are the utmost carping members. RC columns jacketed with CFRP membrane enhance resistance, deformation aptitude, and the auspicious confining impacts. Sundry scrutiny has been implemented about circular columns wrapping or veiled with CFRP layers. This scrutiny will manifest about Genetic Programming (GP) and Artificial Neural Networks (ANN) as soft computing models, mobbing exploited to ascertain the lateral confinement coefficient (Ks) valuate of RC circular columns jacketed with CFRP membrane. For the purpose to ascertain Ks value, manipulate the corresponding ambit such as the diameter of the column (b), column length (L), thickness layer of CFRP (tw), the elastic modulus of CFRP membrane (Ef) along with the compressive strength of unconfined concrete (fcc). Total collection of 142 datasets for the RC circular column was employed to decipher the prediction of Ks. Various statistical metrics (R2 = 0.933; RMSE = 0.054; NMBE = -0.001) compared with the ANN model and exhibits the superiority of GP in predicting the Ks. Taylor diagram and Rank analysis were also carried out in this article for justification. The lucidity of the GP machine enlightenment model overtures a greater sensible and exact prediction of Ks value for RC circular columns in accordance with versatile loading conditions.

Multicast communication technology is widely applied in wireless environments with a high device density. Traditional wireless network architectures have difficulty flexibly obtaining and maintaining global network state information and cannot quickly respond to network state changes, thus affecting the throughput, delay, and other QoS requirements of existing multicasting solutions. Therefore, this paper proposes a new multicast routing method based on multiagent deep reinforcement learning (MADRL-MR) in a software-defined wireless networking (SDWN) environment. First, SDWN technology is adopted to flexibly configure the network and obtain network state information in the form of traffic matrices representing global network links information, such as link bandwidth, delay, and packet loss rate. Second, the multicast routing problem is divided into multiple subproblems, which are solved through multiagent cooperation. To enable each agent to accurately understand the current network state and the status of multicast tree construction, the state space of each agent is designed based on the traffic and multicast tree status matrices, and the set of AP nodes in the network is used as the action space. A novel single-hop action strategy is designed, along with a reward function based on the four states that may occur during tree construction: progress, invalid, loop, and termination. Finally, a decentralized training approach is combined with transfer learning to enable each agent to quickly adapt to the dynamic changes of network link information and accelerate convergence. Simulation experiments show that MADRL-MR outperforms existing algorithms in terms of throughput, delay, packet loss rate, etc., and can establish more intelligent multicast routes. Code and model are available at https://github.com/GuetYe/MADRL-MR_code.

Ontology serves as a central technique in the semantic web to elucidate domain knowledge. The challenge of dealing with the heterogeneity introduced by diverse domain ontologies necessitates ontology matching, a process designed to identify semantically interconnected entities within these ontologies. This task is inherently complex due to the broad, diverse entities and the rich semantics inherent in vocabularies. To tackle this challenge, we bring forth a new interactive ontology matching method with local and global similarity deviations (IOM-LGSD) for ontology matching, which consists of three novel components. First, a local and global similarity deviation (LGSD) metrics are presented to measure the consistency of similarity measures (SMs) and single out the less consistent SMs for user validation. Second, we present a genetic algorithm (GA) based SM selector to evolve the SM subsets. Lastly, a problem-specific induced ordered weighting aggregating (IOWA) operator based SM aggregator is proposed to assess the quality of selected SMs. The experiment evaluates IOM-LGSD with the ontology alignment evaluation initiative (OAEI) Benchmark and three real-world sensor ontologies. The evaluation underscores the effectiveness of IOM-LGSD in efficiently identifying high-quality ontology alignments, which consistently outperforms comparative methods in terms of effectiveness and efficiency.

For Orthogonal Frequency Division Multiplexing (OFDM) systems, the most significant problem is the peak-to-average power ratio. The utilisation of partial transmission sequence, often known as PTS, is an efficient method for reducing PAPR. When it comes to minimizing the peak-to-average power ratio (PAPR) in Orthogonal Frequency Division Multiplexing (OFDM) Systems, PTS is one of the most effective approaches that may be used. Due to the substantial data load, using peak-to-average power ratio in OFDM is challenging. The most crucial problem with OFDM is achieving better results by lowering PAPR. Provide a PTS in this research that is based on the Chaotic Biogeography Based Optimization (CBBO) algorithm to effectively address the high PAPR issue that exists in Generalized Frequency Division Multiplexing (GFDM) waveforms using Hermitian Symmetry property is used. The Hermitian symmetry is utilised in order to acquire a real-valued time-domain signal. Phase rotation factor combinations are carried out in an effective and optimal manner through the utilisation of an innovative combination of optimization techniques. In comparison to conventional optimization techniques, a new hybrid optimization offers quick convergence quality and minimal complexity. When compared to traditional PTS methods such traditional GFDM and OFDM-PTS, experimental results demonstrate that the suggested CBBO-PTS technique significantly improves on minimizing PAPR.

In recent years, wirless Internet of Things (IoT) technology has developed rapidly, and the reuse of spectrum resources, network efficiency, and the diversity of multi-communication scenarios have brought great challenges to the existing Internet of Things. And Device to Device (D2D) communication technology in 5th Generation Mobile Communication Technology (5G) has good application prospects in these aspects. Therefore, the combination with D2D can well solve the needs in the wirless Internet of things. However, safe and effective communication has become an urgent problem to be solved. In this paper, this paper proposes a D2D group communication protocol for wireless IoT in 5G. In this protocol, the Chinese remainder theorem is introduced into the protocol design, and a secure and efficient group authentication scheme is constructed based on secret sharing and Chebyshev Polynomials. The formal security proof using Burrows Abadi Needham (BAN) logic and informal security analysis show that our proposed protocol meets the security requirements. Through performance analysis, compared with other related schemes, this scheme not only provides better security, but also has obvious advantages in computation and communication efficiency.

Cognitive green computing (CGC) dedicates to study the designing, manufacturing, using and disposing of computers, servers and associated subsystems with minimal environmental damage. These solutions should provide efficient mechanisms for maximizing the efficiency of use of computing resources. Evolutionary algorithm (EA) is a well-known global search algorithm, which has been successfully used to solve various complex optimization problems. However, a run of population-based EA often requires huge memory consumption, which limited their applications in the memory-limited hardware. To overcome this drawback, in this work, we propose a compact EA (CEA) for the sake of CGC, whose compact encoding and evolving mechanism is able to significantly reduce the memory consumption. After that, we use it to address the ternary compound ontology matching problem. Six testing cases that consist of nine ontologies are used to test CEA's performance, and the experimental results show its effectiveness.

In high-dimensional space, most multi-objective optimization algorithms encounter difficulties in solving many-objective optimization problems because they cannot balance convergence and diversity. As the number of objectives increases, the non-dominated solutions become difficult to distinguish while challenging the assessment of diversity in high-dimensional objective space. To reduce selection pressure and improve diversity, this article proposes a many-objective evolutionary algorithm based on dual selection strategy (MaOEA/DS). First, a new distance function is designed as an effective distance metric. Then, based distance function, a point crowding-degree (PC) strategy, is proposed to further enhance the algorithm’s ability to distinguish superior solutions in population. Finally, a dual selection strategy is proposed. In the first selection, the individuals with the best convergence are selected from the top few individuals with good diversity in the population, focusing on population convergence. In the second selection, the PC strategy is used to further select individuals with larger crowding distance values, emphasizing population diversity. To extensively evaluate the performance of the algorithm, this paper compares the proposed algorithm with several state-of-the-art algorithms. The experimental results show that MaOEA/DS outperforms other comparison algorithms in overall performance, indicating the effectiveness of the proposed algorithm.

Restructuring Particle Swarm Optimization (RPSO) algorithm has been developed as an intelligent approach based on the linear system theory of particle swarm optimization (PSO). It streamlines the flow of the PSO algorithm, specifically targeting continuous optimization problems. In order to adapt RPSO for solving discrete optimization problems, this paper proposes the binary Restructuring Particle Swarm Optimization (BRPSO) algorithm. Unlike other binary metaheuristic algorithms, BRPSO does not utilize the transfer function. The particle updating process in BRPSO relies solely on comparison results between values derived from the position updating formula and a random number. Additionally, a novel perturbation term is incorporated into the position updating formula of BRPSO. Notably, BRPSO requires fewer parameters and exhibits high exploration capability during the early stages. To evaluate the efficacy of BRPSO, comprehensive experiments are conducted by comparing it against four peer algorithms in the context of feature selection problems. The experimental results highlight the competitive nature of BRPSO in terms of both classification accuracy and the number of selected features.

Identifying the right accessories for installing the dental implant is a vital element that impacts the sustainability and the reliability of the dental prosthesis when the medical case of a patient is not comprehensive. Dentists need to identify the implant manufacturer from the x-ray image to determine further treatment procedures. Identifying the manufacturer is a high-pressure task under the scaling volume of patients pending in the queue for treatment. To reduce the burden on the doctors, a dental implant identification system is built based on a new proposed thinner VGG model with an on-demand client-server structure. We propose a thinner version of VGG16 called TVGG by reducing the number of neurons in the dense layers to improve the system’s performance and gain advantages from the limited texture and patterns in the dental radiography images. The outcome of the proposed system is compared with the original pre-trained VGG16 to verify the usability of the proposed system.

The transmission security problem in the industrial Internet of Things is the focus of industrial manufacturing development. Blockchain technology can well solve this problem. The massive data generated in the Industrial Internet of Things will be transmitted to the blockchain system through the gateway, the throughput and deployment costs need to be considered. This paper proposes a pigeon flock algorithm based on decomposition to solve this problem. It uses the excellent navigation ability of carrier pigeons to improve search efficiency. At the same time, two independent archives are used to balance convergence and diversity. After the solution set in the convergence archives is classified, the solution set is evaluated by the Tchebycheff function, and some better solutions are retained. The diversity archive chooses some solutions that are quite different from other solutions to maintain diversity. This article uses this algorithm to obtain the solutions with low throughput and high deployment when the blockchain is implemented in the Industrial Internet of Things. Finally, 7 questions in the DTLZ test question are selected to prove the validity of the proposed algorithm. These questions have 5, 10, and 15 goals. In the experimental results, it can be seen that the proposed algorithm is better than NSGAIII, MOEADD and NSGAII on most of the test problems.

Smart Environment (SE) focuses on the initiatives for healthy living, where ecological issues and biodiversity play a vital role in the environment and sustainability. To manage the knowledge on ecology and biodiversity and preserve the ecosystem and biodiversity simultaneously, it is necessary to align the data entities in different ecology and biodiversity ontologies. Since the problem of Ecology and Biodiversity Ontology Alignment (EBOA) is a large-scale optimization problem with sparse solutions, finding high-quality EBOA is an open challenge. Evolutionary Algorithm (EA) is a state-of-the-art technique in the ontology aligning domain, and this study further proposes an Adaptive Compact EA (ACEA) to address the problem of EBOA, which uses semantic reasoning to reduce searching space and adaptively guides searching direction to improve the algorithm's performance. In addition, we formally model the problem of EBOA as a discrete optimization problem, which maximizes the alignment's completeness and correctness through determining an optimal entity corresponding set. After that, a hybrid entity similarity measure is presented to distinguish the heterogeneous data entities, and an ACEA-based aligning technique is proposed. The experiment uses the famous Biodiversity and Ecology track to test ACEA's performance, and the experimental results show that ACEA-based aligning technique statistically outperforms other EA-based and state-of-the-art aligning techniques.

Due to rapidly developing technology and new research innovations, privacy and data preservation are paramount, especially in the healthcare industry. At the same time, the storage of large volumes of data in medical records should be minimized. Recently, several types of research on lossless medically significant data compression and various steganography methods have been conducted. This research develops a hybrid approach with advanced steganography, wavelet transform (WT), and lossless compression to ensure privacy and storage. This research focuses on preserving patient data through enhanced security and optimized storage of large data images that allow a pharmacologist to store twice as much information in the same storage space in an extensive data repository. Safe storage, fast image service, and minimum computing power are the main objectives of this research. This work uses a fast and smooth knight tour (KT) algorithm to embed patient data into medical images and a discrete WT (DWT) to protect shield images. In addition, lossless packet compression is used to minimize memory footprints and maximize memory efficiency. JPEG formats’ compression ratio percentages are slightly higher than those of PNG formats. When image size increases, that is, for high-resolution images, the compression ratio lies between 7% and 7.5%, and the compression percentage lies between 30% and 37%. The proposed model increases the expected compression ratio and percentage compared to other models. The average compression ratio lies between 7.8% and 8.6%, and the expected compression ratio lies between 35% and 60%. Compared to state-of-the-art methods, this research results in greater data security without compromising image quality. Reducing images makes them easier to process and allows many images to be saved in archives.

Recently, various methods have been developed to identify COVID-19 cases, such as PCR testing and non-contact procedures such as chest X-rays and computed tomography (CT) scans. Deep learning (DL) and artificial intelligence (AI) are critical tools for early and accurate detection of COVID-19. This research explores the different DL techniques for identifying COVID-19 and pneumonia on medical CT and radiography images using ResNet152, VGG16, ResNet50, and DenseNet121. The ResNet framework uses CT scan images with accuracy and precision. This research automates optimum model architecture and training parameters. Transfer learning approaches are also employed to solve content gaps and shorten training duration. An upgraded VGG16 deep transfer learning architecture is applied to perform multi-class classification for X-ray imaging tasks. Enhanced VGG16 has been proven to recognize three types of radiographic images with 99% accuracy, typical for COVID-19 and pneumonia. The validity and performance metrics of the proposed model were validated using publicly available X-ray and CT scan data sets. The suggested model outperforms competing approaches in diagnosing COVID-19 and pneumonia. The primary outcomes of this research result in an average F-score (95%, 97%). In the event of healthy viral infections, this research is more efficient than existing methodologies for coronavirus detection. The created model is appropriate for recognition and classification pre-training. The suggested model outperforms traditional strategies for multi-class categorization of various illnesses.

Ontology is the kernel technique of Semantic Web (SW), which enables the interaction and cooperation among different intelligent applications. However, with the rapid development of ontologies, their heterogeneity issue becomes more and more serious, which hampers communications among those intelligent systems built upon them. Finding the heterogeneous entities between two ontologies, i.e., ontology matching, is an effective method of solving ontology heterogeneity problems. When matching two ontologies, it is critical to construct the entity pair’s similarity feature by comprehensively taking into consideration various similarity features, so that the identical entities can be distinguished. Due to the ability of learning complex calculating model, recently, Artificial Neural Network (ANN) is a popular method of constructing similarity features for matching ontologies. The existing ANNs construct the similarity feature in a single perspective, which could not ensure its effectiveness under diverse heterogeneous contexts. To construct an accurate similarity feature for each entity pair, in this work, we propose an adaptive aggregating method of combining different ANNs. In particular, we first propose a context-based ANN and syntax-based ANN to respectively construct two similarity feature matrices, which are then adaptively integrated to obtain a final similarity feature matrix through the Ordered Weighted Averaging (OWA) and Analytic hierarchy process (AHP). Ontology Alignment Evaluation Initiative (OAEI)’s benchmark and anatomy track are used to verify the effectiveness of our method. The experimental results show that our approach’s results are better than single ANN-based ontology matching techniques and state-of-the-art ontology matching techniques.

Sensor ontologies formally model the core concepts in the sensor domain and their relationships, which facilitates the trusted communication and collaboration of Artificial Intelligence of Things (AIoT). However, due to the subjectivity of the ontology building process, sensor ontologies might be defined by different terms, leading to the problem of heterogeneity. In order to integrate the knowledge of two heterogeneous sensor ontologies, it is necessary to determine the correspondence between two heterogeneous concepts, which is the so-called ontology matching. Recently, more and more neural networks have been considered as an effective approach to address the ontology heterogeneity problem, but they require a large number of manually labelled training samples to train the network, which poses an open challenge. In order to improve the quality of the sensor ontology alignment, an unsupervised neural network model is proposed in this work. It first models the ontology matching problem as a binary classification problem, and then uses a competitive learning strategy to efficiently cluster the ontologies to be matched, which does not require the labelled training samples. The experiment utilizes the benchmark track provided by the Ontology Alignment Evaluation Initiative (OAEI) and multiple real sensor ontology alignment tasks to test our proposal’s performance. The experimental results show that the proposed approach is able to determine higher quality alignment results compared to other matching strategies under different domain knowledge such as bibliographic and real sensor ontologies.

An ontology can formally present the domain knowledge by specifying the domain concepts and their relationships, which is a kernel technique for addressing the data heterogeneity issue in the semantic web. However, since existing ontologies are developed and maintained independently by different communities, a concept and its relationship with the others could be described in different ways, yielding the ontology heterogeneity problem. To solve this problem, in this work, we formally construct an optimal model for it, and propose a similarity measure for distinguishing identical ontology entities. Since determining the high-quality ontology alignment is a complex process, we propose to utilize a Brain Storm Optimization algorithm (BSO) to optimize the alignment. BSO is a recently developed Swarm Intelligence algorithm (SI), which can effectively solve the complex optimization problem by imitating the human's idea generating process. However, classic BSO needs to cluster various ideas in each generation and carry out the evolving operators on all ideas, which increases the computational complexity. To improve the efficiency of BSO-based ontology matcher, a Compact BSO (CBSO) is further proposed, which can reduce the memory consumption by utilizing the probabilistic representation on the idea cluster, and improve the algorithm's speed through the compact crossover operator and perturbation operator. The experiment uses the benchmark track provided by the Ontology Alignment Evaluation Initiative (OAEI) to test our approach's performance. The comparisons among the state-of-the-art ontology matchers and our proposal show that CBSO-based ontology matcher can efficiently determine high-quality ontology alignments.

Although biomedical ontologies have been widely used in the life science domain, the heterogeneous problem among biomedical ontologies hampers their inter-operability. Thus, the establishment of meaningful links between heterogeneous biomedical ontologies, so-called biomedical ontology matching, is critical to the success of biomedical ontology engineering. To determine the biomedical ontology alignment with high quality, in this work, a Hybrid Compact Differential Evolution (HCDE) algorithm-based biomedical ontology matching technique is proposed. In particular, we propose a similarity metric on biomedical concepts, construct an optimal model for the biomedical ontology matching problem, and introduce a binomial crossover into CDE's evolving the process to enhance its performance. The experiments are carried out on the Disease and Phenotype track and Biodiversity and Ecology track from the Ontology Alignment Evaluation Initiative (OAEI 2018). The experimental results show that HCDE can significantly improve the CDE in terms of the alignment's quality, and the alignments obtained by HCDE are also better than OAEI 2018's participants.

Decomposition-based evolutionary algorithms are popular with solving multi-objective optimization problems. It uses weight vectors and aggregate functions to keep the convergence and diversity. However, it is hard to balance diversity and convergence in high-dimensional objective space. In order to discriminate solutions and equilibrate the convergence and diversity in high-dimensional objective space, a two-archive many-objective optimization algorithm based on D-dominance and decomposition (Two Arch-D) is proposed. In Two Arch-D, the method of D-dominance and adaptive strategy adjusting parameter are used to apply selection pressure on the population to identify better solutions. Then, it uses the two archives’ strategy to equilibrate convergence and diversity, and after classifying solutions in convergence archive, the improved Tchebycheff function is used to evaluate the solution set and retain the better solutions. For the diversity archive, the diversity is maintained by making any two solutions as far apart and different as possible. Finally, the Two Arch-D is compared with other four multi-objective evolutionary algorithms on 45 many-objective test problems (including 5, 10 and 15 objectives). Good performance of the algorithm is verified by the description and analysis of the experimental results.

Ontology is the kernel technique of the Semantic Web (SW), which models the domain knowledge in a formal and machine-understandable way. To ensure different ontologies’ communications, the cutting-edge technology is to determine the heterogeneous entity mappings through the ontology matching process. During this procedure, it is of utmost importance to integrate different similarity measures to distinguish heterogeneous entity correspondence. The way to find the most appropriate aggregating weights to enhance the ontology alignment’s quality is called ontology meta-matching problem, and recently, Evolutionary Algorithm (EA) has become a great methodology of addressing it. Classic EA-based meta-matching technique evaluates each individual through traversing the reference alignment, which increases the computational complexity and the algorithm’s running time. For overcoming this drawback, an Interpolation Model assisted EA (EA-IM) is proposed, which introduces the IM to predict the fitness value of each newly generated individual. In particular, we first divide the feasible region into several uniform sub-regions using lattice design method, and then precisely evaluate the Interpolating Individuals (INIDs). On this basis, an IM is constructed for each new individual to forecast its fitness value, with the help of its neighborhood. For testing EA-IM’s performance, we use the Ontology Alignment Evaluation Initiative (OAEI) Benchmark in the experiment and the final results show that EA-IM is capable of improving EA’s searching efficiency without sacrificing the solution’s quality, and the alignment’s f-measure values of EA-IM are better than OAEI’s participants.

Sensors have been growingly used in a variety of applications. The lack of semantic information of obtained sensor data will bring about the heterogeneity problem of sensor data in semantic, schema, and syntax levels. To solve the heterogeneity problem of sensor data, it is necessary to carry out the sensor ontology matching process to determine correspondences among heterogeneous sensor concepts. In this paper, we propose a Siamese Neural Network based Ontology Matching technique (SNN-OM) to align the sensor ontologies, which does not require the utilization of reference alignment to train the network model. In particular, a representative concepts extraction method is presented to enhance the model’s performance and reduce the time of the training process, and an alignment refining method is proposed to enhance the alignments’ quality by removing the logically conflict correspondences. The experimental results show that SNN-OM is capable of efficiently determining high-quality sensor ontology alignments.

The ultimate goal of semantic web (SW) is to implement mutual collaborations among ontology-based intelligent systems. To this end, it is necessary to integrate those domain-independent and cross-domain ontologies by finding the correspondences between their entities, which is the so-called ontology matching. To improve the quality of ontology alignment, in this work, the ontology matching problem is first defined as a sparse multi-objective optimization problem (SMOOP), and then, a multi-objective evolutionary algorithm with a relevance matrix (MOEA-RM) is proposed to address it. In particular, a relevance matrix (RM) is presented to adaptively measure the relevance of each individual’s genes to the objectives, which is applied in MOEA’s initialization, crossover and mutation to ensure the population’s sparsity and to speed up the the algorithm’s convergence. The experiment verifies the performance of MOEA-RM by comparing it with the state-of-the-art ontology matching techniques, and the experimental results show that MOEA-RM is able to effectively address the ontology matching problem with different heterogeneity characteristics.

Data heterogeneity is the obstacle for the resource sharing on Semantic Web (SW), and ontology is regarded as a solution to this problem. However, since different ontologies are constructed and maintained independently, there also exists the heterogeneity problem between ontologies. Ontology matching is able to identify the semantic correspondences of entities in different ontologies, which is an effective method to address the ontology heterogeneity problem. Due to huge memory consumption and long runtime, the performance of the existing ontology matching techniques requires further improvement. In this work, an extended compact genetic algorithm-based ontology entity matching technique (ECGA-OEM) is proposed, which uses both the compact encoding mechanism and linkage learning approach to match the ontologies efficiently. Compact encoding mechanism does not need to store and maintain the whole population in the memory during the evolving process, and the utilization of linkage learning protects the chromosome’s building blocks, which is able to reduce the algorithm’s running time and ensure the alignment’s quality. In the experiment, ECGA-OEM is compared with the participants of ontology alignment evaluation initiative (OAEI) and the state-of-the-art ontology matching techniques, and the experimental results show that ECGA-OEM is both effective and efficient.

The development of intelligent transportation systems (ITSs) faces the challenge of integrating data from multiple unrelated sources. As one of the core technologies of knowledge integration in ITS, an ontology typically provides a normative definition of transportation domain that can be used as a reference for information integration. However, due to the subjectivity of domain experts, a concept may be expressed in multiple ways, yielding the ontology heterogeneity problem. Ontology matching (OM) is an effective method of addressing it, which is of help to further realize the mutual communication between the ontology-based ITSs. In this work, we first propose to use Word2Vec to model the entities in vector space and calculate their similarity values. Then, a stable marriage-based alignment extraction algorithm is presented to determine high-quality alignment. In the experiment, the performance of the proposal is tested by using the benchmark track of OAEI and real transportation ontologies. The experimental results show that our approach is able to obtain higher quality alignment results than OAEI’s participants and other state-of-the-art ontology matching techniques.

A simple broadband circularly polarised (CP) crossed‐dipole antenna is proposed. The antenna is composed of two crossed‐strip dipoles with two stepped sections, which are connected by vacant‐quarter rings to realise CP radiation, and a parasitic cross‐slotted square patch (CSSP) consisting of a modified square‐ring patch and a cross‐slot, which surrounds the crossed dipoles. By controlling the width ratio of the two strip sections, the stepped dipole can provide proper amplitude between two orthogonal modes to achieve wide axial ratio (AR) bandwidth. The CSSP can generate two minimum AR points simultaneously: one point is from the ring‐patch mode, while the other is generated based on the mode from the combination of the crossed dipole and the cross‐slot, which can be equivalent to a magneto‐electric dipole. An antenna prototype is fabricated and measured for design verification. The experimental results show that the proposed antenna with its simple structure has a wide −10 dB impedance bandwidth of more than 80% (3.38–7.97 GHz) and a 3 dB AR bandwidth of 59.1% (4.17–7.67 GHz). The proposed antenna also demonstrates excellent features including high gain, good stability, and symmetrical radiation pattern.

Recently, with the growing number of ontologies defined in different languages, to bridge the semantic gaps between them, it is necessary to identify the correspondences between their heterogeneous entities, so-called cross-lingual ontology matching. Due to the complexity and the intricacy of the cross-lingual ontology matching, it is essential to get an expert involved in the matching process to guarantee the alignment's quality. In this paper, we propose an interactive cross-lingual ontology matching technique that makes the user and automatic matcher work together to create high-quality alignments in a reasonable amount of time. In particular, we present a cross-lingual similarity metric to calculate the similarity value of two cross-lingual entities, construct an optimal model for the cross-lingual ontology matching problem, and propose an interactive compact differential evolution (ICDE) algorithm to effectively match the cross-lingual ontologies. The experiment exploits the ontology alignment evaluation initiative (OAEI) multifarm track to test our proposal's performance. The experimental results show that the ICDE significantly outperforms other EA-based matchers and OAEI's participants, and the interacting mechanism can significantly improve the alignment's quality.

Metaheuristic algorithms are widely employed in modern engineering applications because they do not need to have the ability to study the objective function’s features. However, these algorithms may spend minutes to hours or even days to acquire one solution. This paper presents a novel efficient Mahalanobis sampling surrogate model assisting Ant Lion optimization algorithm to address this problem. For expensive calculation problems, the optimization effect goes even further by using MSAALO. This model includes three surrogate models: the global model, Mahalanobis sampling surrogate model, and local surrogate model. Mahalanobis distance can also exclude the interference correlations of variables. In the Mahalanobis distance sampling model, the distance between each ant and the others could be calculated. Additionally, the algorithm sorts the average length of all ants. Then, the algorithm selects some samples to train the model from these Mahalanobis distance samples. Seven benchmark functions with various characteristics are chosen to testify to the effectiveness of this algorithm. The validation results of seven benchmark functions demonstrate that the algorithm is more competitive than other algorithms. The simulation results based on different radii and nodes show that MSAALO improves the average coverage by 2.122% and 1.718%, respectively.

To integrate massive amounts of heterogeneous biomedical data in biomedical ontologies and to provide more options for clinical diagnosis, this work proposes an adaptive Multi-modal Multi-Objective Evolutionary Algorithm (aMMOEA) to match two heterogeneous biomedical ontologies by finding the semantically identical concepts. In particular, we first propose two evaluation metrics on the alignment’s quality, which calculate the alignment’s statistical and its logical features, i.e., its f-measure and its conservativity. On this basis, we build a novel multi-objective optimization model for the biomedical ontology matching problem. By analyzing the essence of this problem, we point out that it is a large-scale Multi-modal Multi-objective Optimization Problem (MMOP) with sparse Pareto optimal solutions. Then, we propose a problem-specific aMMOEA to solve this problem, which uses the Guiding Matrix (GM) to adaptively guide the algorithm’s convergence and diversity in both objective and decision spaces. The experiment uses Ontology Alignment Evaluation Initiative (OAEI)’s biomedical tracks to test aMMOEA’s performance, and comparisons with two state-of-the-art MOEA-based matching techniques and OAEI’s participants show that aMMOEA is able to effectively determine diverse solutions for decision makers.

Abstract This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation ⪯ m w $\preceq_{mw}$ . Furthermore, the concept of a preference δ-optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.

The fundamental utility of the Large-Scale Visual Sensor Networks (LVSNs) is to monitor specified events and to transmit the detected information back to the sink for achieving the data aggregation purpose. However, the events of interest are usually not uniformly distributed but frequently detected in certain regions in real-world applications. It implies that when the events frequently picked up by the sensors in the same region, the transmission load of LVSNs is unbalanced and potentially cause the energy hole problem. To overcome this kind of problem for network lifetime, a Comprehensive Visual Data Gathering Network Architecture (CDNA), which is the first comparatively integrated architecture for LVSNs is designed in this paper. In CDNA, a novel α-hull based event location algorithm, which is oriented from the geometric model of α-hull, is designed for accurately and efficiently detect the location of the event. In addition, the Chi-Square distribution event-driven gradient deployment method is proposed to reduce the unbalanced energy consumption for alleviating energy hole problem. Moreover, an energy hole repairing method containing an efficient data gathering tree and a movement algorithm is proposed to ensure the efficiency of transmitting and solving the energy hole problem. Simulations are made for examining the performance of the proposed architecture. The simulation results indicate that the performance of CDNA is better than the previous algorithms in the realistic LVSN environment, such as the significant improvement of the network lifetime.

Over the past decades, a large number of complex optimization problems have been widely addressed through multiobjective evolutionary algorithms (MOEAs), and the knee solutions of the Pareto front (PF) are most likely to be fitting for the decision maker (DM) without any user preferences. This work investigates the ontology matching problem, which is a challenge in the semantic web (SW) domain. Due to the complex heterogeneity between two different ontologies, it is arduous to get an excellent alignment that meets all DMs’ demands. To this end, a popular MOEA, i.e., nondominated sorting genetic algorithm (NSGA-II), is investigated to address the ontology matching problem, which outputs the knee solutions in the PF to meet diverse DMs’ requirements. In this study, for further enhancing the performance of NSGA-II, we propose to incorporate into NSGA-II’s evolutionary process the monkey king evolution algorithm (MKE) as the local search algorithm. The improved NSGA-II (iNSGA-II) is able to better converge to the real Pareto optimum region and ameliorate the quality of the solution. The experiment uses the famous benchmark given by the ontology alignment evaluation initiative (OAEI) to assess the performance of iNSGA-II, and the experiment results present that iNSGA-II is able to seek out preferable alignments than OAEI’s participators and NSGA-II-based ontology matching technique.

Nowadays, most real-world decision problems consist of two or more incommensurable or conflicting objectives to be optimized simultaneously, so-called multiobjective optimization problems (MOPs). Usually, a decision maker (DM) prefers only a single optimum solution in the Pareto front (PF), and the PF’s knee solution is logically the one if there are no user-specific or problem-specific preferences. In this context, the biomedical ontology matching problem in the Semantic Web (SW) domain is investigated, which can be of help to integrate the biomedical knowledge and facilitate the translational discoveries. Since biomedical ontologies often own large-scale concepts with rich semantic meanings, it is difficult to find a perfect alignment that could meet all DM’s requirements, and usually, the matching process needs to trade-off two conflict objectives, i.e., the alignment’s recall and precision. To this end, in this work, the biomedical ontology matching problem is first defined as a MOP, and then a compact multiobjective particle swarm optimization algorithm driven by knee solution (CMPSO-K) is proposed to address it. In particular, a compact evolutionary mechanism is proposed to efficiently optimize the alignment’s quality, and a max-min approach is used to determine the PF’s knee solution. In the experiment, three biomedical tracks provided by Ontology Alignment Evaluation Initiative (OAEI) are used to test CMPSO-K’s performance. The comparisons with OAEI’s participants and PSO-based matching technique show that CMPSO-K is both effective and efficient.

To support semantic inter-operability between the biomedical information systems, it is necessary to determine the correspondences between the heterogeneous biomedical concepts, which is commonly known as biomedical ontology matching. Biomedical concepts are usually complex and ambiguous, which makes matching biomedical ontologies a challenge. Since none of the similarity measures can distinguish the heterogeneous biomedical concepts in any context independently, usually several similarity measures are applied together to determine the biomedical concepts mappings. However, the ignorance of the effects brought about by different biomedical concept mapping's preference on the similarity measures significantly reduces the alignment's quality. In this study, a non-dominated sorting genetic algorithm (NSGA)-III-based biomedical ontology matching technique is proposed to effectively match the biomedical ontologies, which first utilises an ontology partitioning technique to transform the large-scale biomedical ontology matching problem into several ontology segment-matching problems, and then uses NSGA-III to determine the optimal alignment without tuning the aggregating weights. The experiment is conducted on the anatomy track and large biomedic ontologies track which are provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of the authors' approach.

Due to continuous evolution of biomedical data, biomedical ontologies are becoming larger and more complex, which leads to the existence of many overlapping information. To support semantic inter-operability between ontology-based biomedical systems, it is necessary to identify the correspondences between these information, which is commonly known as biomedical ontology matching. However, it is a challenge to match biomedical ontologies, which dues to: (1) biomedical ontologies often possess tens of thousands of entities, (2) biomedical terminologies are complex and ambiguous. To efficiently match biomedical ontologies, in this paper, an interactive biomedical ontology matching approach is proposed, which utilizes the Evolutionary Algorithm (EA) to implement the automatic matching process, and gets a user involved in the evolving process to improve the matching efficiency. In particular, we propose an Evolutionary Tabu Search (ETS) algorithm, which can improve EA's performance by introducing the tabu search algorithm as a local search strategy into the evolving process. On this basis, we further make the ETS-based ontology matching technique cooperate with the user in a reasonable amount of time to efficiently create high quality alignments, and make use of EA's survival of the fittest to eliminate the wrong correspondences brought by erroneous user validations. The experiment is conducted on the Anatomy track and Large Biomedic track that are provided by the Ontology Alignment Evaluation Initiative (OAEI), and the experimental results show that our approach is able to efficiently exploit the user intervention to improve its non-interactive version, and the performance of our approach outperforms the state-of-the-art semi-automatic ontology matching systems.

In this study, we developed a model re-sample Recurrent Neural Network (RRNN) to forecast passenger traffic on Mass Rapid Transit Systems (MRT). The Recurrent Neural Network was applied to build a model to perform passenger traffic prediction, where the forecast task was transformed into a classification task. However, in this process, the training dataset usually ended up being imbalanced. To address this dataset imbalance, our research proposes re-sample Recurrent Neural Network. A case study of the California Mass Rapid Transit System revealed that the model introduced in this work could timely and effectively predict passenger traffic of MRT. The measurements of passenger traffic themselves were also studied and showed that the new method provided a good understanding of the level of passenger traffic and was able to achieve prediction accuracy upwards of 90% higher than standard tests. The development of this model adds value to the methodology of traffic applications by employing these Recurrent Neural Networks.

Semantic Sensor Web (SSW) links the semantic web technique with the sensor network, which utilizes sensor ontology to describe sensor information. Annotating sensor data with different sensor ontologies can be of help to implement different sensor systems’ inter-operability, which requires that the sensor ontologies themselves are inter-operable. Therefore, it is necessary to match the sensor ontologies by establishing the meaningful links between semantically related sensor information. Since the Swarm Intelligent Algorithm (SIA) represents a good methodology for addressing the ontology matching problem, we investigate a popular SIA, that is, the Firefly Algorithm (FA), to optimize the ontology alignment. To save the memory consumption and better trade off the algorithm’s exploitation and exploration, in this work, we propose a general-purpose ontology matching technique based on Compact co-Firefly Algorithm (CcFA), which combines the compact encoding mechanism with the co-Evolutionary mechanism. Our proposal utilizes the Gray code to encode the solutions, two compact operators to respectively implement the exploiting strategy and exploring strategy, and two Probability Vectors (PVs) to represent the swarms that respectively focuses on the exploitation and exploration. Through the communications between two swarms in each generation, CcFA is able to efficiently improve the searching efficiency when addressing the sensor ontology matching problem. The experiment utilizes the Conference track and three pairs of real sensor ontologies to test our proposal’s performance. The statistical results show that CcFA based ontology matching technique can effectively match the sensor ontologies and other general ontologies in the domain of organizing conferences.