Search

Over the decades, the immense growth has been reported in research publications due to continuous developments in science. To date, various approaches have been proposed that find similarity between research papers by applying different similarity measures collectively or individually based on the content of research papers. However, the contemporary schemes are not conceptualized enough to find related research papers in a coherent manner. This paper is aimed at finding related research papers by proposing a comprehensive and conceptualized model via building ontology named COReS: Content-based Ontology for Research Paper Similarity. The ontology is built by finding the explicit relationships (i.e., super-type sub-type, disjointedness, and overlapping) between state-of-the-art similarity techniques. This paper presents the applications of the COReS model in the form of a case study followed by an experiment. The case study uses InText citation-based and vector space-based similarity measures and relationships between these measures as defined in COReS. The experiment focuses on the computation of comprehensive similarity and other content-based similarity measures and rankings of research papers according to these measures. The obtained Spearman correlation coefficient results between ranks of research papers for different similarity measures and user study-based measure, justify the application of COReS for the computation of document similarity. The COReS is in the process of evaluation for ontological errors. In the future, COReS will be enriched to provide more knowledge to improve the process of comprehensive research paper similarity computation.

We present a novel implementation of a Rock-Paper-Scissors (RPS) game interaction with a social robot. The framework is tailored to be computationally lightweight, as well as entertaining and visually appealing through collaboration with designers and animators. The fundamental gesture recognition pipeline employs a Leap motion device and two separate machine learning architectures to evaluate kinematic hand data on-the-fly. The first architecture is used to recognize and segment human motion activity in order to initialize the RPS play, and the second architecture is used to classify hand gestures into rock, paper or scissors. The employed tabletop robot interacts in the RPS play through unique animated gestural movements and vocalizations designed by animators which communicate the robot's choices as well as cognitive reflection on winning, losing and draw states. Performance of both learning architectures is carefully evaluated with respect to accuracy, reliability and run time performance under different feature and classifier types. Moreover, we assess our system during an interactive RPS play between robot and human. Experimental results show that the proposed system is robust to user variations and play style in real environment conditions. As such, it offers a powerful application for the subsequent exploration of social human-machine interaction.

In this paper, we present a new scheme for implementing virtual keyboards, which uses only two to four motion-recognition rings per hand and a two-dimensional keyboard template (e.g., an A4 size paper with printed key positions). It has the benefit of portability, customizability, and low-cost when compared with existing approaches. Essentially, we have shown that wearing two wireless IoT rings on the middle phalanges of two fingers of each hand, users can input the alphabetic characters into a computing device by typing on a flat paper on a desk, and potentially in mid-air. We have demonstrated that two rings are sufficient in capturing the gestures and motions of all fingers in a typing hand for keystrokes recognition. A single wireless IoT ring, which weighs 7.8 grams, consists of a Bluetooth low energy (BLE) unit, a micro inertial measurement unit (mIMU), and a cell battery. The 3-axes attitude angles and the Z-axis acceleration of each ring are adopted as the features for keystroke recognition. The overall keystroke recognition accuracy rate can reach as high as 94.8% when two IoT rings are worn by a user on each hand; this accuracy rate increases to 98.6%, when four rings are worn on each typing hand.

Recently, it has been shown that channel feedback helps to enhance the physical layer security (PLS) of communication systems. The current use of feedback focuses on generating secret keys protecting the transmitted messages, and this feedback scheme is proved to be optimal for some physically degraded channel models. In this paper, we revisit the model of the state-dependent wiretap channel with the noncausal state at the transmitter, which plays an important role in the PLS of the wireless communication systems. We propose a new feedback scheme for this model and show that the proposed new scheme performs better than the already existing secret key-based feedback scheme. The results of this paper are further explained via a Gaussian example.

In general, considering standard production, as well as coconut oil production, in oil consumption industries is an important factor. Oil color is an important element, as it is an important factor for consumers or buyers in selecting coconut oil. In the process of producing coconut oil, the cold-pressed method has been chosen to maintain the essential quality of coconut oil. The quality of the coconut oil is inspected from the production process by means of light passing through the coconut oil. Then, the production staff compares the turbidity of coconut oil with the master sample. The turbidity of coconut oil in every production must be compared with a master sample to maintain standards control. According to previous studies, there are many methods for determining coconut oil turbidity. One method that has been utilized is determining turbidity from light passing through the medium in which the transmitted light can be absorbed through the turbidity of the variable medium. This process is applied together with image processing to determine the coconut oil turbidity. In this research, we propose a method for measuring coconut oil turbidity by the Moving Average Median of Hue (MAMoH), which is better in detecting the coconut oil turbidity than the Median of Gray Scale (MoGS) method, Median of Hue (MoH) method, and Random Position Median of Hue (RPMoH) method. In terms of the percentage accuracy of the efficiency test; the MAMoH method has 99 percent accuracy, while the MoGS method is not applicable, the MoH method has 88.04 percent accuracy, and the RPMoH method has 85.91 percent accuracy. Thus, the MAMoH method is considered an appropriate method for measuring coconut oil turbidity.

Power inversion algorithms (PI) are widely used by ant-jamming receivers in harsh environment, but it also induces pseudo-range measurement error which is fatal to high precision receivers. In this paper, it proposes a more accurate method based on the S Curve Bias(SCB) to evaluate the pseudo-range bias which can actually affect the positioning results, as it excludes a fixed time delay contained in the directly differing method. When using this method to assess the bias, it is found that pseudo-range errors can be influenced by many factors including the type of interference. Simulation as well as experiment based on a 4-element array antenna are designed and carried out. The simulation has shown that both SOP-PI and STAP-PI will bring bias to pseudo-range measurement. Specifically, the maximum bias caused by SOP-PI is 1m while the bias caused by STAP-PI is up to 10m. Moreover, comparing to the method which directly differs the pseudo-range of output signal and the reference signal,the method proposed in this paper has better performance. Furthermore, the experimental results verify the effectiveness of the proposed evaluating method.

Fifth-Generation (5G) mobile cellular networks provide a promising platform for new, innovative and diverse IoT applications, such as ultra-reliable and low latency communication, real-time and dynamic data processing, intensive computation, and massive device connectivity. End-to-End (E2E) network slicing candidates present a promising approach to resource allocation and distribution that permit operators to flexibly provide scalable virtualized and dedicated logical networks over common physical infrastructure. Though network slicing promises the provision of services on demand, many of its use cases, such as self-driving cars and Google's Stadia, would require the integration of a Multi-Access Edge Computing (MEC) platform in 5G networks. Edge Computing is envisioned as one of the key drivers for 5G and Sixth-Generation (6G) mobile cellular networks, but its role in network slicing remains to be fully explored. We investigate MEC and network slicing for the provision of 5G service focused use cases. Recently, changes to the cloud-native 5G core are a focus with MEC use cases providing network scalability, elasticity, flexibility, and automation. A cloud-native microservices architecture, along with its potential use cases for 5G network slicing, is envisioned. This paper also elaborates on the recent advances made in enabling E2E network slicing, its enabling technologies, solutions, and current standardization efforts. Finally, this paper identifies open research issues and challenges and provides possible solutions and recommendations.

Machine reading comprehension is a very challenging task, which aims to determine the answer span based on the given context and question. The newly developed pre-training language model has achieved a series of successes in various natural language understanding tasks with its powerful contextual representation ability. However, these pre-training language models generally lack the downstream processing structure for specific tasks, which limits further performance improvement. In order to solve this problem and deepen the model’s understanding of the question and context, this paper proposes S&I Reader. On the basis of the pre-training model, skimming, intensive reading, and gated mechanism modules are added to simulate the behavior of humans reading text and filtering information. Based on the idea of granular computing, a multi-granularity module for computing context granularity and sequence granularity is added to the model to simulate the behavior of human beings to understand the text from words to sentences, from parts to the whole. Compared with the previous machine reading comprehension model, our model structure is novel. The skimming module and multi-granularity module proposed in this paper are used to solve the problem that the previous model ignores the key information of the text and cannot understand the text with multi granularity. Experiments show that the model proposed in this paper is effective for both Chinese and English datasets. It can better understand the question and context and give a more accurate answer. The performance has made new progress on the basis of the baseline model.

Bike sharing is an important tool to reduce congestion and pollution in urban areas. Electrically Power Assisted Bicycles (EPAC’s) make cycling possible also for sedentary people. Standard EPAC’s are difficultly integrable into a free-floating sharing system because the battery pack requires frequent recharging. This paper studies the challenges, opportunities and solutions of implementing a free-floating bike sharing system based on electric bicycles. The analysis revolves around the charge sustaining paradigm. The idea of charge sustaining leverages the metabolic efficiency gaps to reduce the overall physical effort required without determining a net discharge of the battery. Already validated in private bicycles, the idea needs to be modified and adapted to the challenges of a shared fleet. The paper analyzes two approaches to the fleet level energy management and assistance control of a fleet of charge sustaining bicycles. Specifically, we compare a fixed price approach against a flexible pricing approach where the user can select the cost based on the pedaling effort they are willing to exercise. A simulation framework (calibrated on data collected during a large trial in Milan, Italy) assesses the operational costs and revenues of the two approaches quantifying how they depend on the design and environmental parameters. We provide and validate a lower bound in terms of usage rate that guarantees economic sustainability, additionally showing that a flexible pricing strategy can lower this bound and grant more degrees of freedom to the users.

Grain-128AEAD is a lightweight authenticated encryption stream cipher and one of the finalists in the National Institute of Standards and Technology (NIST) Lightweight Cryptography (LWC) project. This paper provides an independent third-party analysis of Grain-128AEAD against fault attacks. We investigate the application of three differential fault attack models on Grain-128AEAD. All these attacks can recover the initial state of Grain-128AEAD. First, we demonstrate an attack using a bit-flipping fault that requires access to 27.80 faulty outputs to recover the initial state. Then, we demonstrate an attack with a more relaxed assumption of a random fault with a probabilistic approach. Our probabilistic random fault attack requires access to 211.60 faulty outputs and 210.45 fault injections to recover the initial state with a success rate over 99%. Both of the above two attacks are based on precise control on the fault target. Finally, we apply a random fault attack with a deterministic approach (can conclusively determine the random fault value) and using different precision controls. For the precise control, we use existing approaches that have been applied to other ciphers, such as Tiaoxin-346. We also propose a technique for less stringent precision models, such as moderate control and no control, which are more practical than the precise control. Our result indicates that the deterministic random fault attack with a precise control requires an average of 27.64 fault injections and a data complexity of 28.80. The deterministic random fault attack with moderate control requires a weak assumption on the fault injection and hence, is the best attack presented in this paper; and is expected to require about 29.39 fault injections with a data complexity of about 212.98. All the attacks discussed in this paper are verified experimentally.

This paper aims to provide an in-depth study of the detection of historical alarm subsequences, which are frequently used as an initial step for alarm flood analysis methods. Therefore, state-of-the-art approaches are comprehensively examined, evaluated, and compared. To overcome the limitations of these methods, a novel approach is presented, which uses outlier detection in time distances between alarm events (activation and return to normal) and an alarm coactivation constraint. The effectiveness and performance of the examined methods are illustrated by means of an openly accessible dataset, which is introduced in this paper. It is based on the “Tennessee-Eastman-Process”, a benchmark in process automation. The intent is to provide a suitable dataset for the development and evaluation of alarm management methods in complex industrial processes using both quantitative and qualitative information from different sources. It is shown that the integration of supplementary information is beneficial for the overall performance and robustness of the detection method proposed here. This method allows for a more accurate detection of coherent historical abnormal situations, including phases with active root-cause disturbances and the normalization phases that follow their termination. Furthermore, the proposed method has the advantage that the detection results are less influenced by the alarm count, the propagation velocity, the duration of the situation, and the time distance between two causally independent situations in comparison to state-of-the-art approaches.

An intrusion detection system (IDS) is an important protection instrument for detecting complex network attacks. Various machine learning (ML) or deep learning (DL) algorithms have been proposed for implementing anomaly-based IDS (AIDS). Our review of the AIDS literature identifies some issues in related work, including the randomness of the selected algorithms, parameters, and testing criteria, the application of old datasets, or shallow analyses and validation of the results. This paper comprehensively reviews previous studies on AIDS by using a set of criteria with different datasets and types of attacks to set benchmarking outcomes that can reveal the suitable AIDS algorithms, parameters, and testing criteria. Specifically, this paper applies 10 popular supervised and unsupervised ML algorithms for identifying effective and efficient ML-AIDS of networks and computers. These supervised ML algorithms include the artificial neural network (ANN), decision tree (DT), k-nearest neighbor (k-NN), naive Bayes (NB), random forest (RF), support vector machine (SVM), and convolutional neural network (CNN) algorithms, whereas the unsupervised ML algorithms include the expectation-maximization (EM), k-means, and self-organizing maps (SOM) algorithms. Several models of these algorithms are introduced, and the turning and training parameters of each algorithm are examined to achieve an optimal classifier evaluation. Unlike previous studies, this study evaluates the performance of AIDS by measuring the true positive and negative rates, accuracy, precision, recall, and F-Score of 31 ML-AIDS models. The training and testing time for ML-AIDS models are also considered in measuring their performance efficiency given that time complexity is an important factor in AIDSs. The ML-AIDS models are tested by using a recent and highly unbalanced multiclass CICIDS2017 dataset that involves real-world network attacks. In general, the k-NN-AIDS, DT-AIDS, and NB-AIDS models obtain the best results and show a greater capability in detecting web attacks compared with other models that demonstrate irregular and inferior results.

In the past few years, game randomizers have become increasingly popular. In general, a game randomizer takes some aspect of a game that is usually static and shuffles it somehow. In particular, in this paper we will discuss the type of randomizer that shuffles the locations of items in a game where certain key items are needed to traverse the game world and access some of these locations. Examples of these types of games include series such as The Legend of Zelda and Metroid. In order to accomplish this shuffling in such a way that the player is able to reach the end of the game, some novel algorithms in graph theory must be utilized, where the game world and its item locations are represented as a graph and each edge on the graph has some rule for which items are required to traverse it. In this paper, we define these algorithms formally and evaluate them with different metrics that can guide a developer’s decision about which algorithm works best for their game.

With the rapid development of remote-sensing imaging technology, remote-sensing images have become increasingly diverse, and people are paying more attention to ocean remote-sensing research. Because ocean remote-sensing data are complex, and the ocean environment is diverse, results will differ, even if the same target is detected at different times in the same scene. To obtain more semantic features and better pixel-level prediction capabilities, this paper proposes a pixel-level ocean remote-sensing image algorithm (GLPO-Net) that combines local and global features. First, texture features, color features, and spatial relationship features are extracted. Second, the algorithm constructs a multiscale local cross-attention mechanism strategy to obtain feature weight information in different directions to fully mine the local features of ocean remote-sensing images. Concurrently, an algorithm constructs a multiscale global cross-attention mechanism strategy to obtain global features. Then, the fusion of global features and local features is described in each submodule to obtain more representative deep features. Finally, small-sample ocean remote-sensing is described via image pixel-level prediction. The algorithm proposed in this paper has been tested with three public ocean remote-sensing datasets. The experimental results show that the proposed GLPO-Net algorithm can learn features from small samples of ocean remote-sensing images. Compared to the prediction results of other remote-sensing image algorithms, GLPO-Net exhibits better prediction capabilities.

The simple rules that govern the interactions between the different components of a complex system often lead to interesting behaviours that are unexpected. The experiments described in this paper involved creating a variation of a traditional Braitenberg Vehicle, by placing sensors on ten different possible locations on a simulated vehicle, and incorporating an obstacle avoidance behaviour using a subsumption-like architecture, which resulted in different unusual and unexpected behaviours being produced. The vehicle was allowed to explore a simulated environment which contained a single bright light in the centre with walls on the border. By using a novel combination of the Prediction by Partial Matching compression algorithm and ${k}$ -means clustering, interesting emergent behaviours were effectively discovered within a search space of over 10,000 simulations produced from a simple interaction of light and proximity sensors on a vehicle and a single light source. The clustering algorithm discovered five distinct behaviours: circling and spiralling behaviours; interesting behaviours creating intricate rose petal-like structures; behaviours that create simple rose petal-like structures; behaviours with large movements and low complexity; and behaviours with less movement. The novel algorithm demonstrated in this paper has useful potential in the science of complex systems and modelling to help expedite the systematic exploration of a substantial search space of simulations in order to discover interesting behaviours.

Handwritten mathematical expressions are an essential part of many domains, including education, engineering, and science. The pervasive availability of computationally powerful touch-screen devices, similar to the recent emergence of deep neural networks as high-quality sequence recognition models, result in the widespread adoption of online recognition of handwritten mathematical expressions. Also, a deeper study and improvement of such technologies is necessary to address the current challenges posed by the extensive usage of distance learning, and remote work due to the world pandemic. This paper delineates the state-of-the-art recognition methods along with the user's experience in pen-centric applications for operating with handwritten mathematical expressions. Recognition methods have been categorized into classes, with a description of their merits and limitations. Particular attention is paid to end-to-end approaches based on encoder-decoder architecture and multi-modal input. Evaluation protocols and open benchmark datasets are considered as well as the comparison of the recognition performance, based on open competition results. The use of handwritten math recognition is illustrated by examples of applications for various fields and platforms. A distinctive part of the survey is that we also considered how UI design relies on the use of different recognition approaches, which is aimed at helping potential researchers improve the performance of the introduced approaches toward the best responses in practical applications. Finally, this paper presents the prospective survey of future research directions in handwritten mathematical expression recognition and their applications.

In the past few decades, although people have conducted in-depth research on community detection in one-mode networks, community detection in bipartite networks has not been extensively researched. In this paper, we propose an improved artificial bee colony algorithm named IABC-BN, which is used to detect the communities in two-mode graphs (i.e. bipartite graphs) with two kinds of vertices in the cluster (i.e. community). Firstly, this paper proposed a novel population initialization process of artificial bee colony (ABC) method for two-mode graph cluster identification. This initialization method can improve the diversity of initial population of ABC and speed up its convergence rate. Secondly, in the employed bee search step of the algorithm, a new combinatorial search equation is proposed. This equation is guided by the global optimal solution and the better neighbour solution of the current solution. By using this combination equation and the increased parameter perturbation frequency, the exploitation ability of the algorithm is further enhanced. Thirdly, in the onlooker bees step, another new combination search equation is also proposed. This equation improves the exploitation level of the algorithm, and an opposition based studying method is employed to promote the exploitation ability of the algorithm. Lastly, in scout bee stage, a probability threshold $\beta $ is introduced to enhance the exploration ability of the algorithm and improve the population diversity of the algorithm. To our knowledge, the IABC-BN method presented in this paper is the first ABC method used to cluster identification in two-mode graphs with two kinds of vertices in the cluster. For verifying the accuracy of the results of the proposed method, a large number of experiments are carried out making use of synthetic bipartite graphs and real bipartite graphs. The test outcomes show that this algorithm is an excellent algorithm for cluster discovery in two-mode graph.

For the on-orbit service spacecraft attitude tracking task with external disturbances, considering the limited capacity of its actuators and high control performance required, an improved performance constraint control algorithm based on command filters is proposed in this paper. For the proposed control algorithm, before the theoretical control signal is transmitted to the actuator, it needs to be filtered by the command filter. This filter can constrain the rate, magnitude, and bandwidth of the signals, smooth the command signals and avoid peak interference. In terms of performance constraints, inspired by the performance constraint curve, this paper uses the determined points to re-design a new performance constraint function, which shows the maximum settling time parameters, allowing designers to pre-defined this limited time of the closed-loop system according to needs. Therefore, the maximum settling time of the actual closed-loop system will be less than the pre-defined maximum settling time. The controller based on the command filter is designed, and on this basis, the corresponding performance-constrained control algorithm with pre-defined maximum settling time guaranteed is proposed. Through the proof and simulation, the rationality and effectiveness of the proposed controller are further demonstrated.

This paper is concerned with the finite-time annular domain bounded control of Ito-type stochastic systems with Wiener and Poisson random disturbance. First, utilizing different quadratic function methods, some sufficient conditions for finite-time annular domain bounded-ness (FTADB) of the system are achieved. Second, two finite-time annular domain bounded controllers are skillfully developed to ensure the FTADB of the closed-loop system, of which one is state feedback controller and the other is dynamic output feedback controller. Furthermore, an algorithm is provided to deal with the obtained matrix inequalities. Finally, two examples are used to demonstrate the effectiveness of the theorems in this paper.

The selection of the system-architecture is critical step in software-engineering lifecycle. Unfortunately, the selecting a suitable architecture is a hard mission. The difficulty of the adopting architecture increases in inconsistence case as in SOA and MSA. The paper answers “when architecture transform”, “to which architecture migrate” and “how”. The paper addresses the lack of evaluation ERPs in post-implementation phase. The paper provides static and dynamic analysis for monolith, SOA and MSA by numerical-comparison and Benchmark. This paper proposes a roadmap for migration-architecture. The roadmap consists of flowchart of migration and migration-decision model that is supported with criteria of evaluation form for assessing system’s baseline and making a consistence decision by Neutrosophic-ANP. Because of the dependency between factors of information system evolution, ANP is used. Furthermore, Neutrosophic set is selected because its accuracy in inconsistence. Benchmark assesses OpenBravoERP, Odoo12 and Metasfresh5.144 to represent monolith, SOA and MSA respectively. Benchmark assesses performance, time to the market, stability, future proof, network issue and cost. They are tested based on scenario tests which grantee that transactions are executed within more than one module of ERPS, simulates real business’s procedures, huge number of records and concurrent load by virtual users. The proposed model and benchmark help “Hitac’ enterprise in two decisions for its expansion-plan in COVID-19 crisis. The numerical steps of this case-study are provided. Most published papers and literatures about Microservices are not empirical. The main paper’s result is filling this gap by a one of the empirical aspects with an academic study support.

PnP problem is well researched in many fields, such as computer vision. It is considered the fundamental method to solve the key problems of robot SLAM. However, in pedestrian visual localization, uncalibrated PnP (UPnP), specifically PnP with unknown focal length (PnPf) is more suitable for solving the problem. Recently, a few researchers proposed some methods to alleviate this problem. However, the localization accuracy of the existing methods is not satisfied when image pixel noise is larger. In other words, RANSAC should be running before solving the PnPf problem to get less noisy input, which means the localization delay increases inevitably. In this paper, we propose a more robust method for solving the PnPf problem without the help of RANSAC based on Gröbner basis and convex optimization. We build a Gröbner basis solver on the offline stage with one instance in the prime field. Then, we substitute the coefficients with real value and find multiple solutions on the online stage. Finally, we construct a convex optimization program to seek the final robust solution to PnPf problem. The other purpose of this paper is to provide a second-level localization experience for the end-user. The simulation result shows that our method can give a localization solution, which is more reliable than benchmark methods by both synthetic and real data verified.

To fully mine the relationship between temporal features in load data, improve the accuracy and efficiency of short-term load forecasting and overcome the difficulties caused by load nonlinearity and volatility in accurate load forecasting. In this paper, a hybrid neural network short-term load forecasting model based on temporal convolutional network (TCN) and gated recurrent unit (GRU) is proposed. Firstly, the correlation between meteorological features and load is measured with the distance correlation coefficient, and the fixed-length sliding time window method is used to reconstruct the features. Next, temporal convolutional network is adopted to extract the hidden historical information and time relationship including meteorological features, electricity price, etc., and a better-performing gated recurrent unit is utilized for perdition. Furthermore, the state-of-the-art AdaBelief optimizer and Attention mechanism are utilized to enhance the prediction accuracy and efficiency. The effectiveness and superiority of the proposed model are verified by load and weather data from Spain and PJM power system data. Short-term load forecasting results in different periods and comprehensive comparisons with the performance of different models show that the proposed model can provide accurate load forecasting results rather quickly. The highlights of this paper are that temporal convolutional network and gated recurrent unit are combined for load forecasting for the first time, and the forecasting performance is improved by the novel optimizer AdaBelief and feature selection based on distance correlation coefficient.

Autonomous driving (AD) provides a reliable solution for safe driving by replacing human drivers responsible for the majority of accidents. The emergence of Machine Learning, specifically Deep Reinforcement Learning (DRL), and its ability to solve complex games proved its potential to address AD challenges. However, model-free methods still suffer from safety-related issues that can be resolved using safe-DRL approaches. The addition of model-based safety filters to the learning-based algorithms provides safety bounds on their performance and constraint satisfaction. In this paper, we investigate the addition of a safety filter based on Model Predictive Control and show an increase in mean testing episode reward by 110% from −75 mean episode reward during testing for 50 episodes for Deep Deterministic Policy Gradient ( $DDPG$ ) to 7.758. We study the impacts of safety filters (7.758 mean reward), heuristic rules, bounded additive noises (0.49% performance increase comparing to noise-free case), and exploration (3.425 mean reward) on the learning algorithm. We compare the effects of filters in the context of simulated exploration and bounded exploration and prove that bounded exploration results in 9.86% increase in mean reward and 12.95% decrease in std comparing to the other method. Additionally, inspired by Deep Internal Learning and biological mechanisms like brain plasticity, we investigate the idea of using each sample for training only once instead of utilizing stochastic batches which increases the mean testing accumulated reward by 1.87% and leads to the best performance (7.942 mean reward and 0.048 std). Finally, the results demonstrate better automotive results for our proposed method than DDPG. Our proposed method, DDPG with safety filter in bounded exploration and adaptive learning under noisy input conditions, has a success rate of 100% under different traffic densities for the simulation environment used in this paper and our assumptions. The proposed method’s automotive results are shown for a braking scenario to avoid collision with other road users.

This paper initially proposes an optimization problem and after presents its optimal solution. Then, this result is applied to obtain relaxed conditions to design controllers for nonlinear plants described by Takagi-Sugeno (TS) models, based on fuzzy Lyapunov function (FLF) and Linear Matrix Inequalities (LMI). The FLF is given by $V(x(t)) = x(t)^{T}P(\alpha (x(t)))x(t)$ , where $x(t)$ is the plant state vector, $P(\alpha (x(t))) = \alpha _{1}(x(t))P_{1} + \alpha _{2}(x(t))P_{2} + \cdots + \alpha _{r}(x(t))P_{r}$ , $P_{i}=P_{i}^{T} > 0$ and $\alpha _{i}(x(t))$ is the weight related to the local model $i$ in the representation of the plant by TS fuzzy models, for $i=1,2,\cdots,r$ . When one calculates the time derivative of this $V(x(t))$ , it appears the term $x(t)^{T}\dot {P}(\alpha (x(t)))x(t)$ , that is usually handled using conservative upper bounds, supposing that the bounds of the time derivative of $\alpha _{i}(x(t))$ , $i=1,2,\cdots,r$ , are available. The main result of this paper is a procedure to obtain optimal upper bounds for the term $x(t)^{T}\dot {P}(\alpha (x(t)))x(t)$ , such that they contemplate the maximum value and are always smaller than or equal to the maximum value. It is a relevant result on this subject, because these optimal upper bounds do not add any constraint. With these optimal upper bounds, a relaxed design method for stabilization of TS fuzzy models is proposed. Two numerical examples illustrate the effectiveness of this procedure.

This paper discusses impact of recovering missing Electroencephalography (EEG) data on classification accuracy of hand movements using tensor-based methods. Improvement in classification accuracy is important for efficient performance of prosthesis. Classification accuracy relies on quality of the observed data. In practice, observed data is usually incomplete because of disconnection of electrodes and other artefacts, which negatively affect the classification accuracy. In this paper, we employ tensor-based imputation methods (canonical/polyadiac decomposition (CPD), weighted optimization version of CPD (CP-WOPT and Nonnegative Matrix Factorization (NMF)) to recover missing data in EEG signals and apply various classifiers to classify hand movements on recovered data. In particular, structured missing data was considered because that is how data gets missed in real-life data acquisition. Percentage of missing data was changed from 10% to 50%. Classifiers are applied on complete, missing and recovered data explicitly to test the performance of our framework. Results show that mean classification accuracy on complete data, missing data and recovered data was 71%, 53% and 64% respectively which shows applicability of our framework.

This paper provides an extensive review of the popular multi-objective optimization algorithm NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem. It is identified that based on the manner in which NSGA-II has been implemented for solving the aforementioned group of problems, there can be three categories: Conventional NSGA-II, where the authors have implemented the basic version of NSGA-II, without making any changes in the operators; the second one is Modified NSGA-II, where the researchers have implemented NSGA-II after making some changes into it and finally, Hybrid NSGA-II variants, where the researchers have hybridized the conventional and modified NSGA-II with some other technique. The article analyses the modifications in NSGA-II and also discusses the various performance assessment techniques used by the researchers, i.e., test instances, performance metrics, statistical tests, case studies, benchmarking with other state-of-the-art algorithms. Additionally, the paper also provides a brief bibliometric analysis based on the work done in this study. Web of Science 9 57791 57757

A railway running near power lines is subjected to electromagnetic interference from power lines, which can adversely affect normal operation of the railway’s communication and signaling system, resulting in safety hazard on the railway equipment and personnel. Therefore, it is very important to assess such electromagnetic interference issues to ensure the railway system’s reliability and the public safety. In this paper, a literature review is conducted on electromagnetic interference between railways and nearby power lines, which has not been widely researched in the past. Although IEEE Standard 2746–2020 has raised the importance of such electromagnetic interference, but it only offers very basic information without an in-depth coverage. This paper provides a review, where critical aspects of electromagnetic interference between railways and power lines are summarized and the future research direction in this area is recommended.

Due to it is difficulty to segment the steel bar image in a complex background and with external interference. In this paper, we propose a multi-attention U-Net to segment the steel bar image. First of all, in order to accurately find the steel bar region and filter the noise in the background part, we add the row mean attention module in the decoding path of the U-shaped network by using the characteristic of the constant diameter of the steel bar, which reduces the background to be segmented into steel bar. In addition, an attention branch optimization strategy based on mask attention module is designed, which uses the output of high-level semantics to filter the features of adjacent low-level semantics, which can maintain the continuity of the segmented steel bar region. Secondly, we design an improved loss function for training, which can improve the accuracy of fitting of steel bar width and better optimize the effect of steel bar segmentation. Finally, in order to improve the generalization ability of the multi-attention U-Net method and avoid over fitting, we propose a data augmentation method based on correction deformation to expand the sample database. Compared with standard U-Net, attention U-Net, R2U-Net and DUNet, the experimental results show that the multi-attention U-Net proposed in this paper has higher IoU accuracy in steel bar image segmentation, and this method has real-time performance.

To reduce waste and cost as well as to promote the efficient and sustainable use of resources in supply chains, a common focus of practice and research is to integrate decisions of various operational processes such as production, inventory, distribution, and routing. The question of which is more representative of the production routing problem (PRP) then arises. In this paper, the focus is on uncertainty in the PRP, and demand and cost uncertainty are considered simultaneously. According to different decision criteria, three uncertain programming models are correspondingly formulated. Then, through researching the crisp equivalence and conversion of the proposed uncertain models, a series of crisp equivalent models are proposed under the assumptions of particular uncertainty distributions, such as linear, zigzag, and normal distributions. To verify the accuracy and usefulness of the proposed models put forward in this paper, a series of experiments are conducted. Finally, several interesting managerial aspects with respect to the relationship between the confidence level and variance of uncertain variables that are gained from the numerical experiments are highlighted. First, the overall cost of PRP grows as the confidence level increases under uncertain environment. Second, the probability that the optimal total cost of the PRP is less than or equal to a given threshold strictly increases as the threshold increases under uncertain environment. Third, in circumstances such as higher confidence level that decision makers generally pay more attention to, the growth of the variance of uncertain variables may lead to the increase of the total cost.

The design fabrication and development of a 67.5 kHz capacitive micromachined ultrasonic transducer (CMUT) suited for Martian anemometry is presented in this paper. To have low signal attenuation under Martian conditions, the device operating frequency is limited to 100 kHz. This is due to the low-density carbon dioxide (CO2) atmosphere and acoustic impedance mismatch transduction losses. CMUTs capable of generating frequencies less than 100 kHz need either large Silicon area or higher operating voltages. This is a problem for the battery operation and portability of devices. The devices presented in this paper are designed and fabricated using low cost commercially available surface micromachining technique. COMSOL Multiphysics and MATLAB simulations were used to analyze the device critical design parameters and investigate the operability of devices. Simulation results show that the designed single cell 170- $\mu \text{m}$ radius membrane has a resonant frequency ~65 kHz. The device exhibits a static displacement of 105nm under 20 V DC bias. Using the developed single cell model, a $3\times 10$ array CMUT anemometer was fabricated and evaluated that generates a ~65 kHz acoustic signal in lab environment. This proposed CMUT anemometer can operate for a supply < 38 V. The device performance was evaluated using a commercial air-coupled capacitive microphone named CAP1. Successful transmit-receive of ultrasound from the developed 2D array to CAP1 for separation in the range of 1–15 cm was performed. The experiment results performed in lab environment show the speed of sound and the atmospheric attenuation can be accurately measured using this developed technology with a ±5% accuracy.

Grasshopper Optimization Algorithm (GOA) is a recent swarm intelligence algorithm inspired by the foraging and swarming behavior of grasshoppers in nature. The GOA algorithm has been successfully applied to solve various optimization problems in several domains and demonstrated its merits in the literature. This paper proposes a comprehensive review of GOA based on more than 120 scientific articles published by leading publishers: IEEE, Springer, Elsevier, IET, Hindawi, and others. It provides the GOA variants, including multi-objective and hybrid variants. It also discusses the main applications of GOA in various fields such as scheduling, economic dispatch, feature selection, load frequency control, distributed generation, wind energy system, and other engineering problems. Finally, the paper provides some possible future research directions in this area.

Hyperspectral and multispectral information processing systems and technologies have demonstrated its usefulness for the improvement of agricultural productivity and practices by providing useful information to farmers and crop managers on the factors affecting crop status and growth. These technologies are widely used in a range of agriculture applications such as crop management, crop yield forecasting, crop disease detection, and the monitoring of agriculture land usage, water, and soil conditions. Hyperspectral information sensing can acquire several hundred spectral bands that cover the electromagnetic spectrum of an observational scene in a single acquisition. The resulting hyperspectral data cube contains a large volume of spatial and spectral information. The hyperspectral sequence of images or video further increases the data generation velocity and volume which lead to the Big data challenges particularly in agricultural remote sensing applications. This paper is structured to first give a comprehensive review of representative studies to provide insights into significant research efforts in agriculture using Big data, machine learning and deep learning with the focus on frameworks or architectures, information processing and analytics with hyperspectral and multispectral data. The potential for utilizing Big data, machine learning and deep learning for hyperspectral and multispectral data in agriculture is very promising. The paper then further explores the potential of using ensemble machine learning and scalable parallel discriminant analysis which takes into consideration the spatial and spectral components for Big data in agriculture. To the best of our knowledge, no similar review study on agriculture with Big data, machine learning and deep learning for hyperspectral and multispectral information processing has been reported. Furthermore, the potential of ensemble machine learning and scalable parallel discriminant analysis has not been explored in agriculture information processing. Experiments and data analytics have been performed on hyperspectral data from agriculture for validation. The results have shown the good performance of our approach.

To solve abruptly occurrence of parameters jumping and directed communication topologies changing in the control process of networked manipulators, in this paper, distributed switched consensus control algorithms are formulated for a group of robot manipulators in realizing cooperative consensus performance. In fact, networked Lagrange systems are modeled as switched systems regarding the different parameters and topologies. Namely, the dynamic models switch when the system parameters or the topology structures change. The consensus control strategy is constructed by resorting to (improved) average dwell time (ADT) method and sliding-mode control technique, and a unified analysis methodology is developed to perform the convergence analysis for the closed-loop system by Lyapunov stable theory. The main contribution of this paper is the development of a systematically adaptive consensus algorithm by simultaneously considering shifting parameters and switching communication network (as two unavoidable key factors) in the process of communication interaction among robots. A distinctive feature of the developed consensus protocol is to introduce the directed network topology characterizing the local communication interaction among robots, which is especially suitable for representing the the structures and features of the realistic cooperative multi-robotic systems. Accordingly, the developed consensus tracking strategy for manipulators possess prominent advantages including robustness,stability and effectiveness over the existing concentrated on single robot counterparts. Finally, numerical simulations of two-link manipulators are performed to illustrate the effectiveness of the obtained control algorithm.

Dyslexia is a neurological disorder that is characterized by imprecise comprehension of words and generally poor reading performance. It affects a significant population of school-age children, with more occurrences in males, thus, putting them at risk of poor academic performance and low self-esteem for a lifetime. The long-term hope is to have a dyslexia diagnostic method that is informed by neural-biomarkers. In this regard, large numbers of machine learning methods and, more recently, deep learning methods have been implemented across various types of dataset with the above-chance classification accuracy. However, attainment of clinical acceptability of these state-of-the-art methods is bedeviled by certain challenges including lack of biologically-interpretable biomarkers, privacy of dataset and classifiers, hyper-parameter selection/optimization, and overfitting problem among others. This review paper critically analyzes recent machine learning methods for detecting dyslexia and its biomarkers and discusses challenges that require proper attentions from the users of deep learning methods in order to enable them to attain clinically relevance and acceptable level. The review is conducted within the premise of implementation and experimental outcomes for each of the 22 selected articles using the Preferred Reporting Items for Systematic review and Meta-Analyses (PRISMA) protocol, with a view to outlining some critical challenges for achieving high accuracy and reliability of the state-of-the-art machine learning methods. As an evidence-based protocol for reporting in systematic reviews and meta-analyses, PRISMA helps to ensure clarity and transparency of this paper by showing a four-phase flow diagram of the selection process for articles used in this review. It is therefore, envisaged that higher classification performance of clinical relevance can be achieved using deep learning models for dyslexia and its biomarkers by addressing identified potential challenges.

In this paper, a new application of Equilibrium Optimizer (EO) is proposed for design hybrid microgrid to feed the electricity to Dakhla, Morocco, as an isolated area. EO is selected to design the microgrid system due to its high effectiveness in determining the optimal solution in very short time. EO is presented for selecting the optimal system design which can minimize the cost, improve the system stability, and cover the load at different climate conditions. Microgrid system consists of photovoltaic (PV), wind turbine (WT), battery, and diesel generator. The objective function treated in this paper is to minimize the net present cost (NPC), respecting several constraints such as the reliability, availability, and renewable fraction. The sensitivity analysis is conducted in two stages: Firstly, the impact of wind speed, solar radiation, interest rate, and diesel fuel on the NPC, and levelized cost of energy (LCOE) is analyzed. Secondly, the influence of size variation on loss of power supply probability (LPSP) is investigated. The results obtained by EO are compared with those obtained by recent metaheuristics optimization algorithms, namely, Harris Hawks Optimizer (HHO), Artificial Electric Field Algorithm (AEFA), Grey Wolf Optimizer (GWO), and Sooty Tern Optimization Algorithm (STOA). The results show that the optimal system design is achieved by the proposed EO, where renewable energy sources (PV and WT) represent 97% of the annual contribution and fast convergence characteristics are obtained by EO. The best NPC, LCOE, and LPSP are obtained via EO achieving 74327 $, 0.0917 $/kWh, and 0.0489, respectively.

The sixth generation (6G) wireless communication network presents itself as a promising technique that can be utilized to provide a fully data-driven network evaluating and optimizing the end-to-end behavior and big volumes of a real-time network within a data rate of Tb/s. In addition, 6G adopts an average of 1000+ massive number of connections per person in one decade (2030 virtually instantaneously). The data-driven network is a novel service paradigm that offers a new application for the future of 6G wireless communication and network architecture. It enables ultra-reliable and low latency communication (URLLC) enhancing information transmission up to around 1 Tb/s data rate while achieving a 0.1 millisecond transmission latency. The main limitation of this technique is the computational power available for distributing with big data and greatly designed artificial neural networks. The work carried out in this paper aims to highlight improvements to the multi-level architecture by enabling artificial intelligence (AI) in URLLC providing a new technique in designing wireless networks. This is done through the application of learning, predicting, and decision-making to manage the stream of individuals trained by big data. The secondary aim of this research paper is to improve a multi-level architecture. This enables user level for device intelligence, cell level for edge intelligence, and cloud intelligence for URLLC. The improvement mainly depends on using the training process in unsupervised learning by developing data-driven resource management. In addition, improving a multi-level architecture for URLLC through deep learning (DL) would facilitate the creation of a data-driven AI system, 6G networks for intelligent devices, and technologies based on an effective learning capability. These investigational problems are essential in addressing the requirements in the creation of future smart networks. Moreover, this work provides further ideas on several research gaps between DL and 6G that are up-to-date unknown.

Clustering algorithms have become one of the most critical research areas in multiple domains, especially data mining. However, with the massive growth of big data applications in the cloud world, these applications face many challenges and difficulties. Since Big Data refers to an enormous amount of data, most traditional clustering algorithms come with high computational costs. Hence, the research question is how to handle this volume of data and get accurate results at a critical time. Despite ongoing research work to develop different algorithms to facilitate complex clustering processes, there are still many difficulties that arise while dealing with a large volume of data. In this paper, we review the most relevant clustering algorithms in a categorized manner, provide a comparison of clustering methods for large-scale data and explain the overall challenges based on clustering type. The key idea of the paper is to highlight the main advantages and disadvantages of clustering algorithms for dealing with big data in a scalable approach behind the different other features.

© Copyright 2021, A. O. Nyanteh et al. Software-Defined Networking (SDN) is an innovative technology which provides a programmable network control which is decoupled from the physical infrastructure. Network Virtualization (NV) is the phenomenon where a given physical network infrastructure and its resources are abstracted to create multiple logical virtual network slices of the underlying substrate. NV enables independent virtual networks to co-exist on one or more shared physical network infrastructure. Edge computing makes use of the edge resources in close proximity to end-users to reduce service delay and the network traffic volume in the end-to-end networks. Similarly, network slicing which is a key enabling technology for 5G networks is designed to support different services from different platforms at different scales enables sharing of physical network infrastructure on many different virtual network layers. These innovative technologies and strategies have gained significant attention from both academia and industry as they have the potential to maximize network resource utilization and optimize end–to–end network service delivery in 5G solutions deployment. To enable continuous simulation and development of applicable 5G networking concepts using these technologies, there is a need for an accessible and easy-to-learn testbed which is able to efficiently measure the performance of physical and virtual network capacities, provisioning approaches and management of multiple architectural models using large-scale network slicing configurations in a repeatable and controllable manner. These tools and toolkits provide scalable, lightweight and controlled cloud simulation environments necessary to analyse network traffic flows, allocation capacities and policies and the behaviour of multiple heterogeneous networks at an extremely low cost as compared to the huge financial commitments involved in conducting similar experiments in a real-life event. Existing solutions do not support Network Slicing and end- to -end heterogenous network automation which are key enablers of 5G network implementation. Hence in this paper, the CloudSimHypervisor framework is developed in this based on CloudSimSDN-NFV. The complete architecture and features of the CloudSimHypervisor framework and some used cases are presented in this paper. We validate the CloudSimHypervisor framework with two use case experiments in the cloud computing environment: Joint compute and network resource utilization and network traffic prioritization. Results from these experiments display the efficiency of the CloudSimHypervisor in estimating and measuring processing speed, transmission speed, compute and network usage efficiency and energy consumption.

DNA microarray data analysis is infamous due to a massive number of features, imbalanced class distribution, and limited available samples. In this paper, we focus on high-dimensional multi-class imbalanced problems. The high dimensional and multi-class imbalanced problem has posed acute challenges for the conventional classifiers to effectively perform classification tasks on both the minority and majority classes. Numerous efforts have been devoted to addressing either high dimensionality dataset or class imbalance problems. Nonetheless, few methods have been proposed to address the intersection of multi-class imbalanced and high-dimensional problems concurrently due to their intricate interactions. This paper presents novel hybrid algorithms for feature selection with the high dimensional multi-class imbalanced problem using multiple filter-based rankers (MFR) and hybrid Grasshopper optimization algorithm (GOA). The Simulated Annealing (SA) algorithm is incorporated into GOA. SA is used to enhance the best solution found by the GOA algorithm. The aim of using the SA here is to tackle the slow convergence and improve the exploitation by searching the high-quality regions found by the GOA. The experimental results confirm the effectiveness of the proposed methods in improving the classification performance in terms of area under the curve (AUC) compared to other well-known methods, which guarantees the ability of the proposed methods in searching the feature space and identifying very robust and discriminative features that best predict the minority class.

In stochastic computing (SC) systems numbers are represented with mean values of random binary sequences. This paper introduces a novel fuzzy inference architecture, in which the computational mechanism is based on stochastic logic (SL). First, the basic concept of SL is described, then the architecture of the SL-based fuzzy logic controller (SFLC) is built up systematically using the derived stochastic elements. The second part of the paper demonstrates the application of the proposed techniques, where the SFLC-based control performance is evaluated on a real mechatronic system. The results show that the SL-based approach provides effective and robust control performance, simple architecture and high noise tolerance. The proposed method is also benchmarked against conventional FLCs indicating that the robustness of the stochastic architecture allowed to outperform the benchmark controllers in noisy environments.

In a smart urban environment, providing accurate information about human activities is an important task. It is a trend to implement human activity recognition (HAR) algorithms and applications on smart phones, including health monitoring, self-management system, health tracking and so on. However, human activity recognition(HAR) is very complex, and it is important to use the best technology and machine learning to understand human activities. One of the main problems of the existing HAR strategies is that the classification accuracy is relatively low, and in order to improve the accuracy, it needs high computational overhead. The purpose of this paper is to use an exploratory data analysis method to deal with HAR, after the implementation of different data mining techniques, the results of dimensionality reduction and visualization are obtained. The HAR method based on smart phone and EDA proposed in this paper is a high precision method. Compared with other classifiers, its accuracy is 96.56%. This article will discuss computational prediction activities and the computational limitations of using exploratory data to analyze (EDA) on 564 feature data frames. The experimental results show that HAR-based exploratory data analysis is a common sensory signal processing technology. The GridSearchCV and LinearSVC algorithm can provide accurate automatic human activity recognition (HAR), for elderly and disabled patients in need of continuous care, and it is a decision-making tool to support sports coaches to make plans.

This paper presents the novel work of digitally linking the crime theories being worked for many years by sociologists to the data record of criminals. The proposed methodology ensures that societal theories can be unequally characterized based on a set of features. These features can be extracted from the criminal record of convicts. The paper presents the methodology and demonstrates its applicability by digitally mapping several records of convicted criminals in Pakistan on societal theories. The accuracy of the results is verified by presenting them to a panel of experts in criminology and sociology. This novel work can lead societies to cluster crimes being committed in their respective communities to one or more of social theories and then take the help of the rich work that has already been done by sociologists in curbing crimes in communities by the right intervention of policies, incentives, and enforcement.

Nowadays, under the pressure of numerous research publications, researchers increasingly pay attention to writing survey papers to track and understand one research topic they are interested in, and then begin to conduct more in-depth research. Until this moment, there are two types of survey papers: traditional review analysis and bibliometric statistical analysis. Compared with traditional review analysis, due to the analysis of various bibliometric information that can be quickly summarized to assess and predict one research field’s development, the bibliometric statistical analysis is progressively proposed. However, no research relied on the bibliometric approach to explore fuzzy inference system (FIS) -based classifiers. More importantly, since the current open-ended bibliometric analysis approaches have different assessment focuses, choosing a suitable approach is problematic. Therefore, based on the extraction, integration, and expansion of previous bibliometric analysis theories, this research proposes a new systematic and time-saving bibliometric statistical analysis approach. It is worth noting that the proposed approach eliminates the need to read the internal content of all publications. Two core parts (Publication Information and TOP 20 SETs) are generated by the proposed analysis approach. Among them, analyzing Author Keywords and TOP 20 SETs are unprecedented guiding features to assist researchers in exploring research topic. Significantly, this research relies on the proposed approach to explore FIS-based classifiers. Various assessments cover the bibliometric information of the entire related publications. In addition, these results may need to be considered to increase the citation rate of future publications.

The problem of finding the route with maximum end-to-end spectral efficiency in a multihop wireless network has been subject to considerable interest in the recent literature. It has been established that the problem is polynomially solvable in networks that employ time division multiple access (TDMA) or frequency division multiple access (FDMA). The main characteristic of TDMA and FDMA is being interference-free. Motivated by the advances in full-duplex (FD) communications and self-interference (SI) cancelation, this paper considers the problem for interference-limited wireless networks, in which nodes can send and receive at the same time and using the same frequency, but all links may interfere with each other. The contribution of this paper is three-fold. We formulate the problem as a mixed integer non-linear programming problem, and provide two equivalent re-formulations that provide more insight into the problem structure. Moreover, to the best of our knowledge for the first time, we provide a formal proof that the problem is NP-complete in the interference-limited case. Our proof uses reduction from a more general link scheduling problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints. Finally, using an algorithm based on searching over paths while pruning the allowed number of hops, we provide a detailed numerical study that illustrates the tradeoffs between interference-limited FD relaying and TDMA half-duplex (HD) relaying. Our results indicate that sub-optimal interference-limited FD relaying leads to up to 2.69 times higher spectral efficiencies as compared to optimal TDMA HD relaying. Moreover, the lower the signal-to-noise ratio (SNR) regime, the larger the network size and/or the higher the SI capabilities, the higher the spectral efficiency gain due to FD (over HD) relaying.

This paper presents an averaged real-time model of an arbitrary size MVDC railway system. In contrast to references already available in the literature, focusing mainly on specific parts of such a railway network (e.g. power converter installed in a locomotive), this paper offers a thorough insight into the modeling of every part belonging to it. Through a set of reasonable assumptions, the concept of a sector is presented allowing for a straightforward synthesis of any MVDC railway network. Thereafter, real-time models of catenaries, rails, trains, as well as power converters supplying the system are presented in a comprehensive manner. Without loss of generality, the system analyzed hereafter represents a 200 km section of a double-track EuroCity line powered by an actively fed electrification system with three transformer-rectifier groups and two modular multilevel converters. The proposed modeling approach was verified on a large-scale hardware-in-the-loop system comprising one RT Box 3, hosting the model of the exemplary railway network, and two modular multilevel converter digital twins relying on the use of industrial ABB PEC800 controllers.

In this paper, a novel reversible data hiding method for encrypted images (RDHEI) is proposed. An efficient coding scheme based on cyclic binary Golay (23, 12) code is designed to embed additional data into the least significant bits (LSBs) of the encrypted image. The most significant bits (MSBs) are used to ensure the reversibility of the embedding process. The proposed scheme is lossless, and based on the receiver’s privileges, allows recovery of marked data, original data and embedded data. Furthermore, the scheme can be used with any type of data, however it is best suited to 16-bit DICOM images of monochrome photometric interpretation. A modification to the standard DICOM network model was also introduced, to point out an example application of the proposed RDHEI method, i.e. an anonymized data storage outsourcing. A computer-based analysis has been carried out and simulation results are shown at the end of this paper.

Solid-state power controllers (SSPCs) have been received increasing attention as they can configure the electrical system and protect the system by fast tripping mechanism at the same time. Although the high-voltage direct current (HVDC) electrical system can bring sustainable savings on the cables’ weight and losses, the protection can be considerably challenging. SSPCs have been successfully utilized for 28V DC aircraft onboard network. However, high-voltage ones are impeded by the vast over-voltage and the excessive losses generated from SSPC switching. This paper tries to fill this gap and presents the development of high-power SSPCs for a ±270VDC network of a future turboprop aircraft. Comprehensive designs of proper over-voltage suppression along with SSPC thermal management are presented in this paper. Besides, a comparative study on the SSPC device is carried out. Two prototypes, including a single MOSFET module and paralleling several discrete MOSFET devices, are built and then tested in the experiment. It has been validated that the proposed voltage clamping design cannot only effectively suppress the over-voltage, but also limit the SSPC temperature increase during switching for both candidates. After comparing the conduction losses, maximum junction temperature, power density, weight and volume, the single device solution is recommended as a preferable SSPC option for future aircraft.

Because the existing finger vein segmentation networks are too large and not suitable for implementation in mobile terminals, the reduction of the parameters of the lightweight network leads to the reduction of the segmentation index, and the long-running time of deep network on hardware platforms; this paper proposes a lightweight real-time segmentation method for finger veins based on embedded terminal technique. In the preprocessing stage of the algorithm, the data is greatly expanded by randomly selecting the center to obtain sub-blocks on each image of the training set. The network first uses deep separable convolution to greatly reduce the U-Net parameters of a basic network and introduces an attention module to reorder the features to improve network performance, followed by a preliminary lightweight network Dinty-NetV1. Second, the Ghost module is added to the deep separable convolution, and the feature map of the network part is obtained through a cheap operation so that the network is further compressed to obtain Dinty-NetV2. After adding channel shuffle, all the characteristic channels are evenly shuffled and reorganized to obtain Dinty-NetV3. Finally, a study of the filter norm yields the distribution characteristics of the finger vein picture features. By using the geometric median pruning method, the network models for each stage of the algorithm proposed in this paper achieved better segmentation performance and shorter split time after pruning. The overall Dinty-NetV3 model size is only less than 9% of the U-Net and Mult-Adds is less than 2% of the U-Net with the same structure. After testing on two-finger vein datasets SDU-FV and MMCUBV-6000, we confirm that the performance of Dinty-NetV3 surpasses all previously proposed classic compression model algorithms and it is not inferior to more complex and huge networks such as U-Net, DU-Net, and R2U-Net. The proposed algorithm has advantages in terms of time needed to train the network, and we verify its universality using NVIDIA's full range of embedded terminals.

To solve the problem that the trajectory tracking control system of the unmanned helicopter is limited by the accuracy of the physical model (parameters and dynamic characteristics) and external disturbance of the unmanned helicopter, this paper designs a trajectory tracking control system of the unmanned helicopter based on the linear/nonlinear hybrid Active Disturbance Rejection Control (ADRC). At the same time, this paper proposes a method for tuning the controller parameters based on the Bacterial Foraging Optimization-Flower Pollination Algorithm (BFO-FPA). Finally, the simulation test of spiral climb and “8”-figure climb is applied to verify the controller’s performance. The results show that the controller proposed in this paper can effectively overcome the influence of the unmanned helicopter’s internal and external disturbance, and the controller has the advantages of strong anti- disturbance ability and strong robustness. Simultaneously, the optimization algorithm can obtain the optimal global solution, and can improve the controller’s performance.

The textual data of a document is supplemented by the graphical information in it. To make communication easier, they contain tables, charts and images. However, it excludes a section of our population - the visually impaired. With technological advancements, the blind can access the documents through text to speech software solutions. In this method, even images can be conveyed by reading out the figure captions. However, charts and other statistical comparisons which involve critical information are difficult to be “read” out this way. Aim of this paper is to analyse various methods available to solve this vexatious issue. We survey the state-of-the-art works that do the exact opposite of graphing tools. In this paper, we explore the existing literature in understanding the graphs and extracting the visual encoding from them. We classify these approaches into modality-based approaches, conventional and deep-learning based methods. The survey also contains comparisons and analyses relevant study datasets. As an outcome of this survey, we observe that: (i) All existing works under each category need decoding in a variety of graphs. (ii) Among the approaches, deep learning performs remarkably well in localisation and classification. However, it needs further improvements in reasoning from chart images. (iii) Research works are still in progress to access data from vector images. Recreating data from the raster images has unresolved issues. Based on this study, the various applications of decoding the graphs, challenges and future possibilities are also discussed. This paper explores current works in the extraction of chart data, which seek to enable researchers in Human Computer Interaction to achieve human-level perception of visual data by machines. In this era of visual summarisation of data, the AI approaches can automate the underlying data extraction and hence provide the natural language descriptions to support visually disabled users.