Search

Researchers from academia and the corporate-sector rely on scholarly digital libraries to access articles. Attackers take advantage of innocent users who consider the articles' files safe and thus open PDF-files with little concern. In addition, researchers consider scholarly libraries a reliable, trusted, and untainted corpus of papers. For these reasons, scholarly digital libraries are an attractive-target and inadvertently support the proliferation of cyber-attacks launched via malicious PDF-files. In this study, we present related vulnerabilities and malware distribution approaches that exploit the vulnerabilities of scholarly digital libraries. We evaluated over two-million scholarly papers in the CiteSeerX library and found the library to be contaminated with a surprisingly large number (0.3-2%) of malicious PDF documents (over 55% were crawled from the IPs of US-universities). We developed a two layered detection framework aimed at enhancing the detection of malicious PDF documents, Sec-Lib, which offers a security solution for large digital libraries. Sec-Lib includes a deterministic layer for detecting known malware, and a machine learning based layer for detecting unknown malware. Our evaluation showed that scholarly digital libraries can detect 96.9% of malware with Sec-Lib, while minimizing the number of PDF-files requiring labeling, and thus reducing the manual inspection efforts of security-experts by 98%.

The aging of the transformer oil-paper insulation distributes spatially, which results in changes in paper resistivity in different regions. This paper establishes an iterative inversion algorithm using the finite element method to calculate the oil-immersed paper resistivity in different regions of a transformer. This algorithm sets the transformer dielectric loss factor tan δ at low frequency, the dielectric parameters of the transformer oil as inputs and the oil-immersed paper resistivity as output. The resistivity obtained from inversion can be used as a reference to access the insulation state of the oil-paper insulation. This paper aims at achieving the nondestructive detection of the partial state of the oil-paper insulation.

© 2013 IEEE. With the rapid growth of scientific publications, it is hard for researchers to acquire appropriate papers that meet their expectations. Recommendation system for scientific articles is an essential technology to overcome this problem. In this paper, we propose a novel low-rank and sparse matrix factorization-based paper recommendation (LSMFPRec) method for authors. The proposed method seamlessly combines low-rank and sparse matrix factorization method with fine-grained paper and author affinity matrixes that are extracted from heterogeneous scientific network. Thus, it can effectively alleviate the sparsity and cold start problems that exist in traditional matrix factorization based collaborative filtering methods. Moreover, LSMFPRec can significantly reduce the error propagated from intermediate outputs. In addition, the proposed method essentially captures the low-rank and sparse characteristics that exist in scientific rating activities; therefore, it can generate more reasonable predicted ratings for influential and uninfluential papers. The effectiveness of the proposed LSMFPRec is demonstrated by the recommendation evaluation conducted on the AAN and CiteULike data sets.

With the rapid growth of scientific publications, research paper recommendation which suggests relevant research papers to users can bring great benefits to researchers. In this paper, we focus on the problem of recommending conference papers to the conference attendees. While most of the related existing methods depend on the content-based filtering, we propose a unified conference paper recommendation method named $CPRec$ , which exploits both the contents and the authorship information of the papers. In particular, besides the contents, we exploit the relationships between a user and the authors of a paper for recommendation. In our method, we extract several features for a user-paper pair from the citation network, the coauthor network, and the contents, respectively. In addition, we derive a user’s pairwise preference towards the conference papers from the user’s bookmarked papers in each conference. Furthermore, we employ a pairwise learning to rank model which exploits the pairwise user preference to learn a function that predicts a user’s preference towards a paper based on the extracted features. We conduct a recommendation performance evaluation using real-world data and the experimental results demonstrate the effectiveness of our proposed method.

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.

Tight assembly of stator windings with no insulation paper damage is a manufacturing challenge. We evaluate different sets of parts according to the following parameters: magnet wire thickness, stator slot smoothness, length of the straight magnet wire after the slot end, and type and amount of insulation cap at the end of the slot. These parameters have discrete values with small differences between them. The damage criterion is the decrease of the insulation paper breakdown voltage after assembly/disassembly of parts, assembled in a small set of designed experiments. Parameter values, i.e., levels at individual experiments are set by an orthogonal experiment matrix. Repetition of each experiment provides statistical significance. Data analysis shows that the additive model alone is not sufficient due to the high correlation of the parameters’ influences. We extend the model to include interparameter influences, which we model by adding a virtual parameter. The extended additive model generates parameter values that do not degrade the insulation paper breakdown voltage within the manufacturing process. These values are verified by repetitions of the control experiment.

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.

Most existing studies and public datasets for handwritten Chinese text recognition are based on the regular documents with clean and blank background, lacking research reports for handwritten text recognition on challenging areas such as educational documents and financial bills. In this paper, we focus on examination paper text recognition and construct a challenging dataset named examination paper text (SCUT-EPT) dataset, which contains 50 000 text line images (40 000 for training and 10 000 for testing) selected from the examination papers of 2 986 volunteers. The proposed SCUT-EPT dataset presents numerous novel challenges, including character erasure, text line supplement, character/phrase switching, noised background, nonuniform word size, and unbalanced text length. In our experiments, the current advanced text recognition methods, such as convolutional recurrent neural network (CRNN) exhibits poor performance on the proposed SCUT-EPT dataset, proving the challenge and significance of the dataset. Nevertheless, through visualizing and error analysis, we observe that humans can avoid vast majority of the error predictions, which reveal the limitations and drawbacks of the current methods for handwritten Chinese text recognition (HCTR). Finally, three popular sequence transcription methods, connectionist temporal classification (CTC), attention mechanism, and cascaded attention-CTC are investigated for HCTR problem. It is interesting to observe that although the attention mechanism has been proved to be very effective in English scene text recognition, its performance is far inferior to the CTC method in the case of HCTR with large-scale character set.

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.

Citations play an important role in ranking of authors, journals, institutions, and organizations. Sometimes, citing documents cite a reference many times in their full-text, which is further used in many application scenarios, such as: 1) finding relationship between cited and citing papers; 2) identifying influential cited paper from set of references in citing paper; 3) identification of suitable citation functions; and 4) study of in-text citations in different logical sections of papers to conclude different findings. The accurate identification of in-text citations remained an open area of research. Recently, the complexities involving automatic identification of in-text citations have been reported with an accuracy rate of 58%. This is due to many issues as highlighted by the state-of-the-art research. This paper investigates such issues in further details: 1) by taking benefits from the previous research; 2) by analyzing different referencing formats; and 3) by experimenting on a comprehensive data set. Based on the investigation, this paper proposes a taxonomy and workable system, which utilizes a set of heuristics build from detailed study. The proposed model is then applied on unseen diversified data set taken from the Journal of Universal Computer Science and CiteSeer. The proposed model was able to achieve an average F-score of 0.97 as compared with the baseline 0.58.

A human-centric emotion estimation method based on correlation maximization with consideration of changes with time in visual attention and brain activity when viewing images is proposed in this paper. Owing to the recent developments of many kinds of biological sensors, many researchers have focused on multimodal emotion estimation using both eye gaze data and brain activity data for improving the quality of emotion estimation. In this paper, a novel method that focuses on the following two points is introduced. First, in order to reduce the burden on users, we obtain brain activity data from users only in the training phase by using a projection matrix calculated by canonical correlation analysis (CCA) between gaze-based visual features and brain activity-based features. Next, for considering the changes with time in both visual attention and brain activity, we obtain novel features based on CCA-based projection in each time unit. In order to include these two points, the proposed method analyzes a fourth-order gaze and image tensor for which modes are pixel location, color channel and the changes with time in visual attention. Moreover, in each time unit, the proposed method performs CCA between gaze-based visual features and brain activity-based features to realize human-centric emotion estimation with a high level of accuracy. Experimental results show that accurate human emotion estimation is achieved by using our new human-centric image representation.

In the process of power transmission and distribution, non-technical losses are usually caused by users’ abnormal power consumption behavior. It will not only affect the dispatch and operation of the distribution network, bring hidden dangers to the security of the power grid, but also damage the operating costs of power companies and disrupt the operation of the power market. Aiming at users’ abnormal electricity consumption behavior, this paper proposes a model based on particle swarm optimization and long-short term memory with the attention mechanism (PSO-Attention-LSTM). Firstly, according to the actual electricity theft behavior, six typical electricity theft modes are summarized, and 4 composite modes are obtained by combining them, so as to comprehensively test the detection performance of the model for various electricity theft behaviors. Secondly, a detection model based on PSO-Attention-LSTM is proposed, and the model is built using the TensorFlow framework. The model uses the attention mechanism to give different weights to the hidden state of LSTM, which reduces the loss of historical information, strengthens important information and suppresses useless information. Use PSO to solve the difficult problem of model parameter selection, and optimize the hyperparameters to improve the model performance. Finally, the data set of the University of Massachusetts was used for simulation and compared with convolutional neural network-long short term memory (CNN-LSTM), attention mechanism-based long short term memory (Attention-LSTM), LSTM, gated recurrent unit (GRU), support vector regression (SVR), random forest (RF) and linear regression (LR) to verify the effectiveness and accuracy of the method used in this article. In this paper, Matlab software is used to analyze and visualize the detection result data.

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.

Parafoil systems are strongly nonlinear due to the flexibility of the canopy and suspension lines, and this characteristic cannot be simulated accurately by existing dynamic models. Hence, model-independent control methods are necessary for parafoil systems. This paper introduces a model-free adaptive control method based on the iterative feedback tuning (IFT-MFAC) method for parafoil systems that is a data-driven control method in which only input/output (I/O) data are needed during construction. In this paper, the MFAC construction process and stability analysis are explained, and then the IFT method is used to tune the two stepping factors of the MFAC method. A six-degree-of-freedom (DOF) dynamic parafoil system model is built to assess the performance of the method in a simulation with disturbances added to imitate real flights. A series of simulations and hardware-in-loop (HIL) tests are designed to verify the performance of the IFT-MFAC controller, and it is compared with the PID control method, the active disturbance rejection control (ADRC) method, and the MFAC method.

Deep convolutional neural networks (DCNNs) have attracted extensive attention in synthetic aperture radar (SAR) image target detection. However, there is usually a lack of labeled data in SAR images which results in difficulties to improve the detection performance with DCNN based methods. Transfer learning borrows generic knowledge from other tasks for the target task and can be an effective solution to the small sample problem, but the features’ generality and specificity across various models are not discussed in target detection. In addition, conventional DCNN based models have too many parameters related to the prior information of the targets which increase the difficulty of transfer learning between different tasks. In this paper, we mainly conduct research in three folds to address these mentioned issues. First, the generality and specificity of features in different network models are analyzed in the field of SAR target detection. Second, a transitive transfer framework is developed for detection under small sample condition. Third, an anchor free rotatable detector with flexible structure is designed for SAR images detection to suit the transfer detection framework proposed in this paper and a reasonable explanation is given for its upper hand with small samples. Experimental results demonstrate that: 1) transitive transfer framework is valid in SAR target detection; 2) the anchor free detector in this framework is superior to the anchor based one; 3) the proposed detector achieves better performance under small sample condition by comparison with state-of-the-art methods.

In this paper, a novel Takagi-Sugeno (T-S) fuzzy controller based on eigenstructure assignment (EA) and optimized by differential evolution algorithm (DE) is proposed, and the application of this control strategy in the hydro-turbine governing system (HTGS) is studied. Based on the non-linear model of HTGS, the corresponding state-space equations (SSE) are obtained by linearization through multiple equilibrium points. Combining with the principle of T-S fuzzy control, a T-S fuzzy model of HTGS integrating multiple SSE with generator power angle as a prerequisite is established. This paper adopts the EA method to design the fitness function in the optimization process and uses DE to complete the optimization operation to improve the performance of T-S fuzzy control in HTGS. Which makes each Linear-Quadratic-Regulator (LQR) controller gain in the fuzzy control reach the optimal under the constraint conditions. The simulation results show that compared with the standard fitness functions IAE (integral absolute error), ITAE (integral time absolute error) and ISE (integral square error), the fitness function designed using the EA method can expand the angle between the left and right eigenvectors of the T-S closed-loop system, and push the closed-loop pole from the imaginary axis to the left. That will make the adjustment time of the system shorter and the robustness against external interferences enhanced. The results also show that the proposed control strategy has better dynamic performance during the non-linear motion of HTGS and is superior to the existing control strategy.

With the rapid development of hardware and software technology, modern industry has produced a large amount of high-dimensional unlabeled data, such as pictures and videos. As clusters of these data sets may exist in some subspaces, traditional algorithms are no longer applicable. The related algorithms based on sparse subspace can find clusters in the subspace, which solves the problem of high data dimension. However, their clustering process based on only one single feature, which results in their performance being particularly sensitive to this single view. Affected by the integrated algorithm, a large number of multi-view methods began to emerge. These methods improve the clustering performance by integrating the subspace expressions of multiple views, but the problem is that the complementary information of multiple views cannot be fully considered. In addition, the problem of non-uniform distribution in clusters also exists in high-dimensional data sets. In this paper, based on the multi-view subspace clustering method, a clustering algorithm based on tensor low rank expression is proposed to solve the clustering problem of high-dimensional datasets. On the one hand, this paper solves the problem of noise and data corruption by combining the method of $\ell _{2,1} $ norms, which transform the optimization problem of solving multi-view subspace expression into a low-rank expression problem of tensor to fully consider the complementarities between views. On the other hand, the proposed scheme solves the problem of non- uniform distribution in clusters in high-dimensional data by combining with the density peak algorithm based on hierarchical strategy. Experiment results show the effectiveness of the algorithm.

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.

The working life evaluation of metal oxide varistor (MOV) is always expected by MOV manufacturers and users. In Oct. 2019, the International Electrotechnical Commission (IEC) SC37B established a project team PT 61643–333 led by the author of this paper to draft a technical report about MOV life assessment. As an early researching achievement of PT 61643-333, this paper provides an evaluation method for the impulse life of MOV with the median rank regression (MRR) method based on the Weibull distribution, which provides an effective means for evaluating the impulse life of MOV. Firstly, the theory of Weibull distribution and impulse life characteristics of MOV are introduced. Then the evaluation method and procedure of MOV impulse life is derived from the combination of the MRR method and the impulse characteristics of MOV. Finally, an application example of the proposed evaluation method is given with the test results from real MOV samples. By establishing three basic impulse life characteristics equations, the life evaluation of MOV under arbitrary impulse current can be achieved. In addition, the fitting validity of six groups of samples is checked to prove the effectiveness of the proposed parameter model. And further sensitivity analysis of the variables has been done to examine the effect of changes in the values of the parameters on the propose model.

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.

This paper presents a lightweight Multi-task Semantic Attention Network (MTSAN) to collectively deal with object detection as well as semantic segmentation aiding real-time applications of the Advanced Driver Assistance Systems (ADAS). This paper proposes a Semantic Attention Module (SAM) that introduces the semantic contextual clues from a segmentation subnet to guide a detection subnet. The SAM significantly boosts up the detection performance and computational cost by considerably decreasing the false alarm rate and it is completely independent of any other parameters. The experimental results show the effectiveness of each component of the network and demonstrate that the proposed MTSAN yields a better balance between accuracy and speed. Following the post-processing methods, the proposed module is tested and proved for its accuracy in the Lane Departure Warning System (LDWS) and Forward Collision Warning System (FCWS). In addition, the proposed lightweight network is deployable on low-power embedded devices to meet the requirements of the real-time applications yielding 10FPS @ 512 X 256 on NVIDIA Jetson Xavier and 15FPS @ 512 X 256 on Texas Instrument’s TDA2x.

This paper is concerned with the optimal state estimation problem for linear discrete-time systems with both multiplicative and cross-correlated noises. The measurement outputs for state estimation are collected from multiple sensors whose sampling rates are different that provide asynchronous data. In addition, the noises that affect the measurement information are correlated among different sensors and also coupled with the process noises as well. The aim of the addressed problem is to propose an optimal state estimation algorithm such that the estimation error is minimized in the mean-square sense with the existence of asynchronous data, possible sensor faults and correlated noises. In order to mitigate the impact of measurement missing, this paper utilizes neural networks to compensate the state estimation when measurement packets are dropping. Then, a fault detection mechanism that utilizes normalized innovation test is adopted to ensure that the abnormal data would be detected and removed. By resorting to the projection theorem and mathematical induction approach, sufficient conditions are derived for the existence of the desired optimal state estimator where the optimized estimation gains are formulated and can be computed iteratively at each time step. The proposed theoretical results are demonstrated via an illustrative numerical example.

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.

This paper presents the application of different approaches of intelligent controllers based on LAMDA (Learning Algorithm for Multivariate Data Analysis) to perform the trajectory tracking task of a mobile robot Pioneer 3-DX simulated in the Virtual Robot Experimentation Platform V-REP environment. The paper proposes the design of a cascade control strategy composed of two controllers, the external controller based on a feedback linearization for the robot kinematics and the internal controller applied to the robot dynamics where the LAMDA approaches are applied. In this work, it is considered an uncertain dynamic model. Thus, its identification and control are based on a reduced-order model for designing purposes. Finally, the dynamic controller is designed using different controllers based on LAMDA, such as LAMDA-PID, LAMDA-Sliding Mode Control, and Adaptive LAMDA. To perform a comparative analysis between them that includes a conventional PID, SMC, and Fuzzy-PID, different trajectories are examined to evaluate the methods. The obtained results are compared qualitatively and quantitatively to determine which proposal performs the most accurate control and presents the best results in terms of performance.

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.

With the commercialization of 5G, in order to recognize QAM signals, one of the main modulation modes in 5G communication systems, this paper put forward the BP-BSA network model based on bird swarm algorithm (BSA) and BP neural network. Firstly, the instantaneous features and high-order cumulants were selected as the appropriate feature statistics by analyzing the characteristics of MQAM signals. After that, the structure of the BP neural network model was determined, and the initial parameters of the BP neural network were optimized using BSA to accelerate the convergence speed of the network. Finally, the features processed with signal to noise ratio (SNR) disorder were used to train and test the BP neural network model. The BP-BSA network model proposed in this paper applies the bird swarm algorithm to the field of modulation recognition for the first time. And the simulation results show that the recognition accuracies of 16, 32, 64, 128, 256QAM signals in the SNR range of −5 dB to 20 dB all reach above 98%. Compared with the same type algorithms, the algorithm proposed in this paper has good recognition performance.

As is the case in many big data mining scenarios with a large scale of samples, the heavy computation cost hinders the application of machine learning, which has to iteratively compute by passing over the whole dataset without considering the roles of different samples in training computation. However, we argue that most of the samples dominating computation resources contribute little to the gradient-based model update, particularly when the model is close to convergence. We define this observation as the Sample Contribution Pattern (SCP) in machine learning. This paper proposes two approaches to exploit SCP by detecting gradient characteristics and triggering the reuse of outdated gradients. In particular, this paper reports research results in (1) the definition and description of SCP to reveal an intrinsic gradient contribution pattern of different samples; (2) a novel SCP-based optimizing algorithm (SCPOA) that outperforms alternative tested algorithms in terms of computation overhead; (3) a variant of SCPOA that incorporates discarding-recovering mechanisms to carefully tradeoff between model accuracy and computation cost; (4) the implementation and evaluation of two algorithms based on popular distributed big data mining platforms running typical sample-sets; (5) intuitive convergence proof of the algorithms. Our experimental results illustrate that the proposed approaches can significantly reduce the computation cost with competitive accuracy.

In recent years, a variety of supervised manifold learning techniques have been proposed to outperform their unsupervised alternative versions in terms of classification accuracy and data structure capturing. Some dissimilarity measures have been used in these techniques to guide the dimensionality reduction process. Their good performance was empirically demonstrated; however, the relevant analysis is still missing. This paper contributes to a theoretical analysis on a) how dissimilarity measures affect maintaining manifold neighbourhood structure and b) how supervised manifold learning techniques could contribute to the reduction of classification error. This paper also provides a cross-comparison between supervised and unsupervised manifold learning approaches in terms of structure capturing using Kendall’s Tau coefficients and co-ranking matrices. Four different metrics (including three dissimilarity measures and Euclidean distance) have been considered along with manifold learning methods such as Isomap, ${t}$ -Stochastic Neighbour Embedding ( ${t}$ -SNE), and Laplacian Eigenmaps (LE), in two datasets: Breast Cancer and Swiss-Roll. This paper concludes that although the dissimilarity measures used in the manifold learning techniques can reduce classification error, they do not learn well or preserve the structure of the hidden manifold in the high dimensional space, but instead, they destroy the structure of the data. Based on the findings of this paper, it is advisable to use supervised manifold learning techniques as a pre-processing step in classification. In addition, it is not advisable to apply supervised manifold learning for visualization purposes since the two-dimensional representation using supervised manifold learning does not improve the preservation of data structure.

This paper considers the problem of expanding a language class that can be proven by a non-interactive zero-knowledge proof system (NIZK) in a black-box manner in the common reference string model. Namely, given NIZKs for two languages, ${\mathcal L}_{0}$ and ${\mathcal L}_{1}$ , can we construct an NIZK for ${\mathcal L}_{0} \vee {\mathcal L} _{1}$ in a black-box manner? NIZKs for disjunctive languages have a large number of applications, such as electronic voting. Therefore, such a black-box construction may enable the efficient constructions of such applications. However, Abe et al. (PKC 2020) showed that this is impossible if the two given NIZKs are simulation-sound. In this paper, we prove that it is also impossible if the two given NIZKs are constructed by the commit-and-prove methodology that is typically used in many cryptographic protocols, including NIZKs. This result suggests that if we want to augment the capability of NIZKs in terms of the languages they can prove, we should rely on certain properties or structures of the underlying NIZKs, such as algebraic structures.

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 epidemic increase in online reviews’ growth made the sentiment classification a fascinating domain in academic and industrial research. The reviews assist several domains, which is complicated to gather annotated training data. Several sentiment classification methodologies are devised for performing the sentiment analysis, but retrieval of information is not accurately performed, less effective, and less convergence speed. In this paper, we propose a sentiment paper proposes a sentiment classification model, namely Spider Monkey Crow Optimization algorithm (SMCA), for training the deep recurrent neural network (DeepRNN). In this method, the telecom review is employed to remove stop words and stemming to eliminate inappropriate data to minimize user’s seeking time. Meanwhile, the feature extraction is performed using SentiWordNet to derive the sentiments from the reviews. The extracted SentiWordNet features and other features, like elongated words, punctuation, hashtag, and numerical values, are employed in the DeepRNN for classifying sentiments. To retrieve the required review, the Fuzzy K-Nearest neighbor (Fuzzy-KNN) is employed to retrieve the review based on a distance measure. With rigorous assessments and experimentation, it is observed that the proposed SMCA-based DeepRNN performs better in terms of accuracy of 97.7%, precision of 95.5%, recall of 94.6%, and F1-score 96.7%, respectively.

Accident causal scenario can describe the process logic of the accident clearly and concretely from the perspective of the control mechanism. Only by improving the quality of the causal scenario can the effective control measures be taken. Combining the technical characteristics of the fully automatic operation (FAO) system, the paper proposes an automated accident causal scenario identification method for FAO system based on the System-Theoretic Process Analysis (STPA) method. Aiming at the problem that there are too many layers in the hierarchical control structure diagram of STPA method, which makes it impossible to effectively trace the cause and the problem that the basic control structure model only contains the control structural information and lacks the cause information, a new basic control structure model is defined to model multiple control processes in time sequence, and then the paper extends it from four aspects: control action, input variables, external disturbance, and synchronous timing to add more system cause information. For the lack of a unified standard description problem for the causal scenario, a four-stage causal scenario description method is defined, this paper has developed the first timing, non-first timing, synchronous timing, and external disturbance causal scenario search rules to ensure the automatic identification of the causal scenarios. Applying the automated safety analysis method to the case study of the operational scenarios of parking in a station of Beijing Yanfang Line, the automated identification of related causal scenarios is successfully completed through the Auto-STPA platform, and corresponding safety requirements are added. The feasibility of the method and the applicability to the analysis of operational scenarios are verified.

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.

In this paper, a finite control set model predictive direct power control (FCS-MPDPC) method based on satisfactory optimization, for single-phase three-level PWM rectifier, is proposed to achieve global optimization that takes into account all its objectives and constraints. Satisfaction optimization aims to obtain the satisfactory solution after coordination of multiple goals, instead of the optimal solution of a single goal. By replacing “optimal” with “satisfaction”, more control degrees of freedom are acquired, so that low-priority auxiliary control objectives can participate in the optimization process. Meanwhile, in order to enhance the description accuracy of FCS-MPDPC method for the future trend of PWM rectifier, the prediction time domain is extended from the traditional single-step to multi-step, and the average switching frequency model is established to realize the low switching frequency control. The satisfactory optimized FCS-MPDPC method proposed in this paper is compared, through simulation and experimental results, with the standard FCS-MPDPC method, which verifies the effectiveness and superiority of the proposed algorithm.

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.

Several hypovigilance detection systems (HDx) were developed to avoid road-side accidents due to driver fatigue. They have suffered from several limitations. Notably many of these are focused on center-head position to define an area of interest (often referred to as PERCLOS (percentage eye closure)) without considering the face occlusion problem, light illumination, and suffer poor response time. These HDx systems mostly depend on image processing, vision-based, and multisensor-based features. To address these problems, the author utilized vision, sensors, environmental, and vehicular-based features that integrated together by fusion to predict multistage of HDx. Lately, few studies have utilized the combination of multimodal features and deep learning (DL) architectures. Those multimodal-based features (M-HDx) were feasible to predict stages of driver fatigue (multi-stage). However, there is a need to critically measure the performance of these M-HDx by carrying out a comparative analysis to recognize multi-stage of fatigue in terms of hardware-based benchmarks. Moreover, it is important to evaluate the M-HDx systems using different features-set with respect to traditional and advanced machine learning techniques. Therefore, the primary aim of this work is in algorithm and feature modeling, then compare the advantages and differences with other work. In this paper, a different study is conducted compare to state-of-the-art survey articles by statistically measuring the performance. After experiments on M-HDx systems, this paper concludes that there is still a research gap to real-time development of multistage M-HDx systems. In the end, the paper summarizes the directions, challenges, and applications in the development of HDx systems to assist other researchers for further research.

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.

The transportation systems around the world are drastically going electrified as a trend because of inevitable heed being paid towards global warming caused by carbon dioxide emissions. A variety of equipment is contained inside these modern versions of the electrified vehicles, and many appear to be similar in types. The internal electric motor and battery power used in these designs are largely responsible for their robustness and durability in transportation systems. The energy conservation problem, on the other hand, is a vital factor that must be handled in order to ensure overall performance and cost-effectiveness. This paper provides a thorough examination of the internal equipment needed to facilitate and optimize the transportation system’s energetic global success with these critical parameters. In the present study, a specific investigation is emphasized which mainly aims to recognize a new electric motor within the propulsion system. The same type of machine is discussed by elaborating internal designing through the implementation of the corresponding mathematical model and along with the corresponding electronic inverter. The associated control system is also established and implemented. Therefore, a significant theoretical contribution, made in this paper, can be used to examine the performance of a particular electrical machine for EV applications. A robust FOC-based control application confirmed this analysis. When a vehicle’s power needs to be increased rapidly, this one-of-a-kind electrical machine proves its worth. Using the MATLAB simulation method, the robustness of this system’s control has been demonstrated in this special mode.

Terrain generation aims to automatize the procedure of creating landscapes using a computer system. The generation models must follow different terrains’ topographical features, such as areas with river deltas and other regions where water bodies affect the natural landscapes. It is possible to generate more realistic terrains thanks to improvements in computer graphics techniques and deep learning models that use specific hardware. However, the advance on the generation of terrains that include river deltas, fjords, and waterfalls has not had the same pace as other more studied landscapes. Therefore, as a contribution to the advance of the research of terrain generation with water bodies using generative models, this paper presents the DRCA2020 dataset, which is useful for supervised training. The proposed dataset contains eight different types of real-world satellite images. These images are grouped by the same geographical location. There are 13,184 groups; each one has three RGB surface images, a water coverage map, three binarizations of water coverage, and a digital elevation model (DEM). Additionally, this paper proposes the use of a cGAN composite model, trained with the DRCA2020 dataset, for generating synthetic DEMs from water coverage images and therefore, to create realistic surface texture images with promising validation results.

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 order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by the Hamiltonian of quantum annealing algorithm (EMGH) to balance the energy consumption of wireless sensor networks, improve the network life and solve the energy hole problem. First of all, this paper analyzes the problem in theory, and transforms the characteristics of the problem into a mathematical model. The mathematical model considers that the sensor network itself is a travelling salesman problem (TSP), but also requires the shortest path of the mobile sink node. Then, the path of each node in the sensor network is iterated by quantum annealing algorithm, and an optimal TSP path is obtained by using quantum tunneling effect and quantum circuit to achieve parallelism. Finally, in the case of compressing the solution space, the moving path of the mobile sink node is quantum coded, and the Hamiltonian in the quantum annealing algorithm is taken as the guiding factor, and then the individual dimensions are moved, which improves the accuracy of the algorithm and speeds up the convergence speed of the algorithm. Finally, the feasibility of EMGH is verified by simulation experiments and comparison with other algorithms, which provides a reference for the optimization and improvement of path planning method.

A workflow model specifies execution sequences of the associated activities and their affiliated relationships with roles, performers, invoked-applications, and relevant data. These affiliated relationships exhibit a series of valuable human-centered organizational knowledge and are utilized for exploring human resource’s work patterns. This paper focuses not only on a specific type of affiliated relationships between performers and activities, in particular, which forms a performer-to-activity affiliation network, but also on a specific type of analysis techniques, which builds a closeness centrality measurement approach for quantifying the degrees of farnesses between performers as well as between activities. In other words, this paper investigates a series of formal approaches for building organizational closeness centrality measurement techniques on the specific type of affiliation networks. The investigation mainly deploys two types of algorithmic formalisms along with an operational example, which are measuring performer-centered organizational closeness centralities and activity-centered organizational closeness centralities, respectively. In order to validate the deployed algorithmic equations, the paper carries out a couple of operational experiments; One is on an ICN-based workflow package and the other is on a discovered workflow model mined from a dataset of workflow event logs. Summarily, this paper devises a series of algorithms and equations for measuring closeness centralities of activities, verify the devised algorithms and their related equations along with operational examples, and discuss the ultimate implications of these analysis techniques of organizational closeness centrality measurements as the performer-to-activity affiliation networking knowledge in workflow-supported organizations.