Search

This paper introduces hybrid iterative algorithms that combine Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms for Field Programmable Gate Array (FPGA) placement by considering adaptive inertia weight and local minima avoidance. The algorithms target to optimize the wire-length of the nets, run time and critical path delay in the placement of logic blocks. Using the adaptive inertia weight parameter and local minima avoidance, the hybrid PSO-SA algorithm is modified to Time-varying PSO-SA (TPSO-SA) and Modified PSO-SA (MPSO-SA) algorithm, respectively. These different hybrid PSO-SA algorithms are checked for efficiency by comparing with the Versatile Place and Route (VPR) algorithm of the Verilog to Routing (VTR) tool using Microelectronics Centre of North Carolina (MCNC) benchmark circuits. The hybrid PSO-SA algorithms give 5–37% better results for wire-length cost and 20–58% reduction in runtime compared to the VPR placement algorithm on different benchmark circuits. Critical path delay is also taken into consideration. [ABSTRACT FROM AUTHOR]

Fixed-point multiplication is an important operation that is frequently used in many digital signal processing (DSP) applications. The operation is computationally intense and very often the performance of multiplier determines the overall performance of DSP system. Evidently, a wide range of approaches have been proposed for efficient implementation of fixed-point multipliers on different hardware platforms. In this paper, we use Coordinate Rotation DIgital Computer (CORDIC) algorithm to perform fixed-point multiplication operation. The motivation for our approach is based on the fact that CORDIC is a hardware-efficient algorithm, wherein accuracy can be traded-off for performance. Our implementation targets field programmable gate arrays (FPGAs) and focuses on exploiting the underlying general and specialized fabric to the fullest. Performance comparisons against various traditional and recent approaches show that a substantial improvement is achievable by using CORDIC-based multipliers. We have also implemented a recently proposed convolution architecture using CORDIC-based multipliers. The results show that a proper choice of CORDIC architecture can result in an improvement of performance parameters like resource utilization, throughput and dynamic power. This, however, is achieved in lieu of a small cost in accuracy. Our analysis of an 8-stage CORDIC multiplier reports a mean absolute percentage error (MAPE) of 6.032 — a factor that reduces exponentially with increasing number of stages. [ABSTRACT FROM AUTHOR]

Quantum edge detection is one of the important part of quantum image processing. In this paper, a quantum edge detection algorithm is designed for the quantum representation of multi-wavelength image (QRMW) model. The algorithm includes all stages of filtering, enhancement and detection. The proposed algorithm is also designed to apply any filtering operation to QRMW images, not only for a particular filtering operation. The proposed algorithm aims to solve the problems that quantum edge detection algorithms in the literature have processing only for a particular operator and noise reduction. Moreover, the algorithm aims to perform operations more efficiently by using less resources. Low-pass filter (LPF) smoothing operators are applied in the filtering stage for the noise reduction problem. In order to apply all filtering operations to the image, arithmetic operators that can operate with all signed integers are used in the algorithm. The operators Sobel, Prewitt and Scharr in the enhancement stage and the gradient method in the detection stage are used for both verification of the proposed algorithm and comparisons with the existing algorithms. A method with quantitative outcomes is shown to evaluate the performance of the edge detection algorithms. Analysis of the simulations performed on sample images with different operators. The circuit complexity of the algorithm is presented and the comparisons are made with the existing studies. The superiority of the proposed algorithm and its flexibility to be used in other studies are clearly demonstrated by analysis. [ABSTRACT FROM AUTHOR]

This paper presents an end-to-end algorithm for solving circuit problems in secondary physics. A key challenge in solving circuit problems is to automatically understand circuit problems over the modals of both text and schematic. Existing methods have a limited capacity in problem understanding due to the they cannot deal with the numerous expressions of problems in natural language and the various circuit diagrams. In fact that this paper, a batch of methods is proposed to work against the challenge of solving circuit problems. The problem understanding is modeled as a problem of relation extraction and a scheme is proposed to extract relations from both text and schematic. A syntax–semantics model is adopted to extract explicit relations from text, whereas a unit-theorem-based method is proposed to extract implicit relations. And a mesh search method is proposed to extract relations from schematic. Based on the result of problem understanding, an algorithm is proposed to produce the solutions of circuit problems, in which the solutions are presented in a readable way. The experimental results demonstrate the effectiveness of the proposed algorithm in solving circuit problems. To the best of our knowledge, this paper is the first literature which reports the quantitative results in understanding and solving circuit problems. [ABSTRACT FROM AUTHOR]

In order to solve the inaccuracy of age estimation dataset and the imbalance of age distribution, this paper proposes an age estimation model based on the structured sparse learning. Firstly, the Multi-label representation of facial images is performed by age, and the age estimation model is trained by solving the model matrix. Finally, the correlation with all age labels is calculated according to the facial images and age estimation model to be tested, and the most correlated age is taken as the predicted age. This paper sets up a series of verification experiments, and analyzes the structured sparse age estimation model from several perspectives. The proposed algorithm has achieved good results in the evaluation of indexes such as the mean absolute error, accumulation index curve and convergence rate, and has designed the demo system to put the model into use. Facts prove that the age estimation model proposed in this paper may achieve a good estimation effect. [ABSTRACT FROM AUTHOR]

The objective of this paper is to apply clipping techniques on natural images and to analyze the performance of various clipping algorithms in computer graphics. The clipping techniques used in this paper is Cohen–Sutherland line clipping, Liang–Barsky line clipping, Nicholl–Lee–Nicholl line clipping and Sutherland–Hodgman polygon clipping. The clipping algorithms are evaluated by using the three parameters: time complexity, space complexity and image accuracy. Previously, there is no performance evaluation on clipping algorithms done. Motivating by this factor, in this paper an evaluation of clipping algorithms is made. The novelty of this paper is to apply the clipping algorithms on natural images. It is justified that the above mentioned clipping algorithms outperform well on clipping the natural images. [ABSTRACT FROM AUTHOR]

The consensus dynamics with additive stochastic disturbances are characterized by the network coherence, which is the robustness of consensus algorithms when the nodes are subject to external perturbations. In this paper, the research goal is to obtain the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. One innovation point of this paper is the structure of a family of the weighted recursive trees with weight factor. We mainly obtain the exact expressions and scalings of network coherence on the family of weighted recursive trees. The scalings of first-order network coherence with network size obey three laws along with the range of the weight factor, while the scalings of second-order network coherence obey four laws along with the range of the weight factor. In addition, the scalings of first- and second-order network coherence on our studied networks are smaller than those performed on other studied networks when 1 m + 1 < r ≤ 1. The obtained results indicate that the efficiency of network coherence on the weighted network has close relation to the weight distribution, and we can design a better weight distribution to make the coherence of network more efficient. [ABSTRACT FROM AUTHOR]

This paper attempts to develop an efficient route planning algorithm to guide the operations of the multi-helicopter search and rescue in emergency. Route planning model of multi-helicopter cooperative search and rescue activity was established first, based on preference ordering of search and rescue objectives, as well as behavioral model of rescue helicopter and on-board detector. Given the route planning model, a multi-helicopter search and rescue route planning general algorithm was developed. The operation mechanism of ant colony algorithm was improved by introducing cooperative modes and the pheromone updating mechanism into existing methods. Furthermore, two cooperative search and rescue modes were studied: one is Overall Cooperative Search and Rescue Mode (OCSARM), in which many ants search and rescue the same region all together; the other is Blocking Cooperative Search and Rescue Mode (BCSARM), which partitions the region into small blocks and appoints helicopter with corresponding performance capabilities. Simulated experiments were developed to test the operability of proposed multi-helicopter search and rescue route planning algorithm. The comparison with existing algorithm shows that the algorithm proposed in this paper reduces computational complexity and evidently enhances algorithm efficiency. Results also indicate that this algorithm not only has the capability of comparing efficiency of two search and rescue modes in different mission requirements but also helps select search and rescue modes before rescue operation. [ABSTRACT FROM AUTHOR]

Community detection is significative in the complex network. This paper focuses on community detection based on clustering algorithms. We tend to find out the central nodes of the communities by centrality algorithms. Firstly, we define the distance between nodes using similarity. Then, a new centrality measuring the local density of nodes is put forward. Combining the independence of the centrality, the nodes in the network can be divided into four classes. Leveraging the product of centrality and independence, the central nodes in the network are easily identified. We also find that we can distinguish bridge nodes from central nodes using centrality and independence. This research designs a community detection algorithm combining centrality and independence. Simulation results reveal that our centrality is more effective than existing centralities in measuring local density and identifying community centers. Compared with other community detection algorithms, results prove the effectiveness of our algorithm. This paper just shows one application of independence of the centrality. There may be more useful applications of it. [ABSTRACT FROM AUTHOR]

With the development of quantum computing, the application of it to image processing has lots of advantages compared to classical image processing. In this paper, we propose a scheme to extract the interest point in quantum images. Interest point is a kind of feature point which can help to identify the target object in the image. Our scheme is based on the idea of Luminance Contrast (LC) algorithm. The scheme computes the absolute value of gray level differences between a pixel and the others, and then adds all these differences together. The sum is defined as a saliency. After computing the saliency of every pixel, we label the pixels with the maximal saliency as the interest points. The algorithm has pretty good performance and its time complexity is much better than the classical algorithm in same conditions, which provides a new idea for the extraction of image interest point. [ABSTRACT FROM AUTHOR]

Community detection is important for understanding the structure and function of networks. Resistance distance is a kind of distance function inherent in the network itself, which has important applications in many fields. In this paper, we propose a novel community detection algorithm based on resistance distance and similarity. First, we propose the node similarity, which is based on the common nodes and resistance distance. Then, we define the distance function between nodes by similarity. Furthermore, we calculate the distance between communities by using the distance between nodes. Finally, we detect the community structure in the network according to the nearest-neighbor nodes being in the same community. Experimental results on artificial networks and real-world networks show that the proposed algorithm can effectively detect the community structures in complex networks. [ABSTRACT FROM AUTHOR]

Innovative applications in rapidly evolving domains such as robotic navigation and autonomous (driverless) vehicles rely on binocular computer vision systems that meet stringent response time and accuracy requirements. A key problem in these vision systems is stereo matching, which involves matching pixels from two input images in order to construct the output, a 3D map. Building upon the existing local stereo matching algorithms, this paper proposes a novel stereo matching algorithm that is based on a weighted guided filtering foundation. The proposed algorithm consists of three main steps; each step is designed with the goal of improving accuracy. First, the matching costs are computed using a unique combination of complementary methods (absolute difference, Census, and gradient algorithms) to reduce errors. Second, the costs are aggregated using an adaptive weighted guided image filtering method. Here, the regularization parameters are adjusted adaptively using the Canny method, further reducing errors. Third, a disparity map is generated using the winner-take-all strategy; this map is subsequently refined using a densification method to reduce errors. Our experimental results indicate that the proposed algorithm provides a higher level of accuracy in comparison to a collection of the existing state-of-the-art local algorithms. [ABSTRACT FROM AUTHOR]

Fault diagnostic analysis is extremely important for interconnection networks. The t ′ / g -diagnosis imprecise strategy plays an essential role in the reliability of networks. The t ′ / g -diagnosis strategy can detect up to t ′ faulty vertices which might include at most g misdiagnosed vertices. The exchanged hypercube is obtained by systematically removing links from a binary hypercube, which has smaller maximum degree and Wiener index than the hypercube. We use G E H (s , t) to denote the generalized exchanged hypercube, and show in this paper that G E H (s , t) is [ (g + 1) s − g (g + 1) 2 + 1 ] / g -diagnosable with 1 ≤ s ≤ t and 0 ≤ g ≤ s − 1 under the PMC model and MM ∗ model. We also propose a t ′ / g -diagnosis algorithm on G E H (s , t). As a side benefit, the t ′ / g -diagnosability of the dual-cube-like network D C n can be directly obtained from our results. [ABSTRACT FROM AUTHOR]

Independent component analysis (ICA) is an efficient blind source separation technique, but the extracted independent components are randomly permuted in classic ICA algorithms, and subsequent identification is required to find the desired component. Such a two-stage method causes inefficiency. By utilizing the prior information, ICA with reference (ICA-R) algorithm can extract the desired source signal in one stage without subsequent processing. There are many theoretical extensions on ICA-R, but few hardware implementations can be found. Therefore, the efficient VLSI design of a fast one-stage independent component extracting system based on ICA-R algorithm is presented in this paper. The proposed system consists of Preprocess module and Iteration module, which are designed highly parallel and pipelined to accelerate the extraction process. The designed system is implemented in Kintex-7 FPGA, and its performance is verified using synthesized signal. Experiment results show that the presented system can extract the desired components in one stage without subsequent identification, and the highly parallel circuit structure of the system speeds up the component extracting process by 3. 8 × compared to software implementation. [ABSTRACT FROM AUTHOR]

In both practical applications and theoretical analysis, there are many fuzzy chance-constrained optimization problems. Currently, there is short of real-time algorithms for solving such problems. Therefore, in this paper, a continuous-time neurodynamic approach is proposed for solving a class of fuzzy chance-constrained optimization problems. Firstly, an equivalent deterministic problem with inequality constraint is discussed, and then a continuous-time neurodynamic approach is proposed. Secondly, a sufficient and necessary optimality condition of the considered optimization problem is obtained. Thirdly, the boundedness, global existence and Lyapunov stability of the state solution to the proposed approach are proved. Moreover, the convergence to the optimal solution of considered problem is studied. Finally, several experiments are provided to show the performance of proposed approach. [ABSTRACT FROM AUTHOR]

As short video social apps develop rapidly, feed has become the main approach or algorithm to present recommendation content to users in such apps. There are big differences in the way that video apps make use of feed flow based on artificial intelligence algorithm. Two kinds of short video social apps including DouYin and KuaiShou are studied with a user experiment in this paper. Several indicators are established to quantify the user experience differences of these two apps. The results are analyzed with correlation analysis to find out the relationship between user experience performance and content presentation mode of feed flow. The differences found from the results are explained from the perspectives of user cognition and behavior. [ABSTRACT FROM AUTHOR]

In synthetic aperture sonar (SAS) image, the underwater shipwreck targets are often buried by sediment or badly damaged. Only a part of the characteristics of artificial objects is retained. In this paper, firstly, based on the analysis of the ocean buried background, the Meanshift filtering is used to smooth the original image and convert the color image into binary one. Secondly, the residual contour of artificial target is extracted through the modified Canny edge detection algorithm. Thirdly, the Region Growing method is taken to remove the discrete interference and keep the intact edge of the line. Consideration with the principle of line alignment, the contours of shipwreck targets are gradually connected and aggregated. Finally, a large amount of measured practical SAS images are tested. The experimental results verified that the proposed algorithm can accurately detect the shipwreck target based on residual contour information, meanwhile with an acceptable timeliness for large size sonar image data. [ABSTRACT FROM AUTHOR]

Recent years have seen an increasing trend in developing 3D action recognition methods. However, despite the advances, existing models still suffer from some major drawbacks including the lack of any provision for recognizing action sequences with some missing frames. This significantly hampers the applicability of these methods for online scenarios, where only an initial part of sequences are already provided. In this paper, we introduce a novel sequence-to-sequence representation-based algorithm in which a query sample is characterized using a collaborative frame representation of all the training sequences. This way, an optimal classifier is tailored for the existing frames of each query sample, making the model robust to the effect of missing frames in sequences (e.g. in online scenarios). Moreover, due to the collaborative nature of the representation, it implicitly handles the problem of varying styles during the course of activities. Experimental results on three publicly available databases, UTKinect, TST fall, and UTD-MHAD, respectively, show 95.48%, 90.91%, and 91.67% accuracy when using the beginning 75% portion of query sequences and 84.42%, 60.98%, and 87.27% accuracy for their initial 50%. [ABSTRACT FROM AUTHOR]

In this paper, we provide extensions to hyperbolic numbers plane of the classical Chaos game algorithm and the Shannon entropy. Both notions connected with that of probability with values in hyperbolic number, introduced by Alpay et al. [Kolmogorov's axioms for probabilities with values in hyperbolic numbers, Adv. Appl. Clifford Algebras27(2) (2017) 913–929]. Within this context, particular attention has been paid to the interpretation of the hyperbolic valued probabilities and the hyperbolic extension of entropy as well. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the direction of arrival (DOA) estimation problem of noncircular signals for coprime linear array (CLA). From the perspective of the CLA as extracted from a filled uniform linear array (ULA), a noncircular root-MUSIC algorithm is proposed to estimate the DOA which can avoid the spectral peak search and lower the computational complexity. Due to the noncircular characteristic, the proposed algorithm enables to resolve more sources than sensors. Meanwhile, the proposed algorithm has better angle estimation performance than some conventional DOA estimation algorithms. Numerical simulation results illustrate the performance of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, an image encryption algorithm based on compressive sensing (CS) and a hyperchaotic system is proposed. This new two-dimensional logical coupling sine chaotic map (2D-LCSCM) has a wider range of chaos, better ergodicity and hyperchaotic properties rather than for existing chaotic maps. By combining with the novel chaotic map and CS, we design an image compression encryption algorithm with good reconstruction accuracy and high security. In the substitution phase of the encryption process, the security performance of the algorithm is improved by the nonlinear transformation of the dynamic substitution box (S-box) and the linear transformation of the chaotic sequences. The performance analyses of the experimental results show that the proposed algorithm can resist various attacks and is highly secure. [ABSTRACT FROM AUTHOR]

High-resolution images have always been in urgent need in the fields of surveying, mapping, military and civilian. In this paper, first, based on anisotropic nonlinear diffusion tensor, a diffusion tensor regularization term which can make full use of direction selection smoothing property was constructed. Based on the improved gradient vector field (GVF), a regularization term which can constrain the continuity of gradient vectors for high-resolution and low-resolution images was constructed. On the basis of these, a multi-frame super-resolution reconstruction algorithm based on double regularization terms was proposed and verified by simulation. Second, combining PCA with adaptive dictionary learning, two constraints of reconstruction regularity based on improved nonlocal means and kernel regression were proposed for experimental verification, and an improved K-means clustering algorithm for initial centre selection of spatial characteristic measure clustering was proposed to enhance the stability of the algorithm. Then high-resolution image generated by learning method was used as the initial input of multi-frame reconstruction of optical remote sensing images. The experimental results show that the reconstruction algorithm based on partial differential equation and unsupervised learning achieves both subjective and objective results for the realization of super-resolution reconstruction of optical remote sensing images. [ABSTRACT FROM AUTHOR]

Cloud computing has become a growing technique due to its on-demand service and scalable features. Most of the applications of the cloud today are in data storage. Data protection and privacy have thus become a major concern. There are huge risks of storing transaction data on third-party hosts. Service providers need to make right investments in proving and ensuring appropriate security over time. Malicious users can exploit weak spots in the data protection model to increase unauthorized access to data. To overcome the problem, in this paper, security-aware data transaction on the cloud using the blowfish algorithm (BA) is proposed. To improve the security of the system, initially, the proposed system verifies the authentication of the user. After the authentication process, the uploaded data are initially split using a pattern-matching algorithm. Then, the separated data are encrypted with the help of BA. Finally, the encrypted data are stored in the cloud at an optimal location. This method is more secure as the data are column-separated and optimized in the cloud, so it is difficult to attack. This method is highly guaranteed because the user cannot recover the document without authentication checking. The performance of the proposed approach is analyzed in terms of different metrics, namely, memory, encryption and decryption time. The experimental results clearly say that the proposed method took minimum encryption time compared with the existing approach. [ABSTRACT FROM AUTHOR]

Correntropy-based learning has achieved great success in practice during the last decades. It is originated from information-theoretic learning and provides an alternative to classical least squares method in the presence of non-Gaussian noise. In this paper, we investigate the theoretical properties of learning algorithms generated by Tikhonov regularization schemes associated with Gaussian kernels and correntropy loss. By choosing an appropriate scale parameter of Gaussian kernel, we show the polynomial decay of approximation error under a Sobolev smoothness condition. In addition, we employ a tight upper bound for the uniform covering number of Gaussian RKHS in order to improve the estimate of sample error. Based on these two results, we show that the proposed algorithm using varying Gaussian kernel achieves the minimax rate of convergence (up to a logarithmic factor) without knowing the smoothness level of the regression function. [ABSTRACT FROM AUTHOR]

Dendrite P systems (DeP systems) are a recently introduced neural-like model of computation. They provide an alternative to the more classical spiking neural (SN) P systems. In this paper, we present the first software simulator for DeP systems, and we investigate the key features of the representation of the syntax and semantics of such systems. First, the conceptual design of a simulation algorithm is discussed. This is helpful in order to shade a light on the differences with simulators for SN P systems, and also to identify potential parallelizable parts. Second, a novel simulator implemented within the P-Lingua simulation framework is presented. Moreover, MeCoSim, a GUI tool for abstract representation of problems based on P system models has been extended to support this model. An experimental validation of this simulator is also covered. [ABSTRACT FROM AUTHOR]

In this paper, a new spatiotemporal chaotic Parameter Uncertainty Mixed Coupled Map Lattice (PUMCML) is proposed. The Cantor diagonal matrix is generated from the Cantor set, and the ordered rotation scrambling strategy for this matrix is used to generate the scrambled image. Cantor set is a fractal system, so the Cantor set has a good effect on chaotic image encryption. The dynamic behavior of the PUMCML system is analyzed. The system has good chaotic property, so it is very suitable for chaotic image encryption. Using the PUMCML system, a diffusion strategy based on the mixture of Arnold and Logistic is proposed. Compared with other algorithms, the encryption effect of the proposed method is better and more secure. [ABSTRACT FROM AUTHOR]

In today's world scenario, many of the real-life problems and application data can be represented with the help of the graphs. Nowadays technology grows day by day at a very fast rate; applications generate a vast amount of valuable data, due to which the size of their representation graphs is increased. How to get meaningful information from these data become a hot research topic. Methodical algorithms are required to extract useful information from these raw data. These unstructured graphs are not scattered in nature, but these show some relationships between their basic entities. Identifying communities based on these relationships improves the understanding of the applications represented by graphs. Community detection algorithms are one of the solutions which divide the graph into small size clusters where nodes are densely connected within the cluster and sparsely connected across. During the last decade, there are lots of algorithms proposed which can be categorized into mainly two broad categories; non-overlapping and overlapping community detection algorithm. The goal of this paper is to offer a comparative analysis of the various community detection algorithms. We bring together all the state of art community detection algorithms related to these two classes into a single article with their accessible benchmark data sets. Finally, we represent a comparison of these algorithms concerning two parameters: one is time efficiency, and the other is how accurately the communities are detected. [ABSTRACT FROM AUTHOR]

The influence of features on each cluster is not the same in a mixed-type dataset. Based on the rough set and shadow set theories, the fuzzy distribution centroid was defined to represent the clustering center of the discrete feature so that the fuzzy c-means algorithm (FCM) could be extended to cluster the data with both continuous and discrete features. Then, considering the different contributions of the features to each cluster, a new weighted objective function was constructed in accordance with the principles of fuzzy compactness and separation. Because the learning feature weight is the key step in feature-weighted FCM, this paper regarded the feature weight as a variable optimized in the clustering process and put forward a self-adaptive mixed-type weighted FCM. The experimental results showed that the algorithm could be effectively applied to a heterogeneous mixed-type dataset. [ABSTRACT FROM AUTHOR]

Bed temperature in dense-phase zone is the key parameter of circulating fluidized bed (CFB) boiler for stable combustion and economic operation. It is difficult to establish an accurate bed temperature model as the complexity of circulating fluidized bed combustion system. T-S fuzzy model was widely applied in the system identification for it can approximate complex nonlinear system with high accuracy. Fuzzy c-regression model (FCRM) clustering based on hyper-plane-shaped distance has the advantages in describing T-S fuzzy model, and Gaussian function was adapted in antecedent membership function of T-S fuzzy model. However, Gaussian fuzzy membership function was more suitable for clustering algorithm using point to point distance, such as fuzzy c-means (FCM). In this paper, a hyper-plane-shaped FCRM clustering algorithm for T-S fuzzy model identification algorithm is proposed. The antecedent membership function of proposed identification algorithm is defined by a hyper-plane-shaped membership function and an improved fuzzy partition method is applied. To illustrate the efficiency of the proposed identification algorithm, the algorithm is applied in four nonlinear systems which shows higher identification accuracy and simplified identification process. At last, the algorithm is used in a circulating fluidized bed boiler bed temperature identification process, and gets better identification result. [ABSTRACT FROM AUTHOR]

Accurate identification of Golgi protein types can provide useful clues to reveal the correlation between GA dysfunction and disease pathology and improve the ability to develop more effective treatments for the diseases. This paper introduces an effective and robust method to classify Golgi protein type with traditional machine learning algorithms. In which various features such as n-GDip, DCCA, psePSSM were used as training features and SVM with linear kernel was employed as a classifier. To solve the imbalance problem of the benchmark datasets, the oversampling technique SMOTE was adopted. To deal with the huge amount of features, the PCA algorithm and Fisher feature selection method were adopted to reduce feature dimensions and remove redundant features. The experimental results show that the proposed method had a further improvement compared with other traditional machine learning methods in 10-fold cross-validation, Jackknife cross-validation and independent testing, which means a further step for the clinical application of computational methods to predict the Golgi protein types. [ABSTRACT FROM AUTHOR]

The 3D measurement system based on line-structured light uses a camera to capture laser stripes due to changing in the shape of an object, and uses the acquired pixel coordinates for 3D reconstruction. System calibration is an important step in 3D measurement. The current camera calibration algorithm research mainly focuses on improving the algorithm itself, and there is less research on the influence of external factors. This paper proposes a coplanar hybrid calibration algorithm based on the error screening model by combining the error screening model, mathematical model and neural network model. It is mainly divided into two steps. The first step is to use the radial array constraint calibration algorithm based on the error screening model to solve the camera's internal and external parameters. The second step uses the camera internal and external parameters obtained in the first step to convert the pixel coordinates into real three-dimensional coordinates, and compares the calculated three-dimensional coordinates with the actual coordinates. Using machine learning to establish a compensation network, get a compensation function, and use the resulting 3D world coordinates to perform point cloud stitching. Experiments show that compared with the traditional calibration algorithm, the calibration algorithm has a small error and reduces the calibration error by about 6.5%. [ABSTRACT FROM AUTHOR]

Time series data from real problems have nonlinear, non-smooth, and multi-scale composite characteristics. This paper first proposes a gated recurrent unit-correction (GRU-corr) network model, which adds a correction layer to the GRU neural network. Then, a adaptive staged variation PSO (ASPSO) is proposed. Finally, to overcome the drawbacks of the imprecise selection of the GRU-corr network parameters and obtain the high-precision global optimization of network parameters, weight parameters and the hidden nodes number of GRU-corr is optimized by ASPSO, and a time series prediction model (ASPSO-GRU-corr) is proposed based on the GRU-corr optimized by ASPSO. In the experiment, a comparative analysis of the optimization performance of ASPSO on a benchmark function was performed to verify its validity, and then the ASPSO-GRU-corr model is used to predict the ship motion cross-sway angle data. The results show that, ASPSO has better optimization performance and convergence speed compared with other algorithms, while the ASPSO-GRU-corr has higher generalization performance and lower architecture complexity. The ASPSO-GRU-corr can reveal the intrinsic multi-scale composite features of the time series, which is a reliable nonlinear and non-steady time series prediction method. [ABSTRACT FROM AUTHOR]

The human emotion recognition based on facial expression has a significant meaning in the application of intelligent man–machine interaction. However, the human face images vary largely in real environments due to the complex backgrounds and luminance. To solve this problem, this paper proposes a robust face detection method based on skin color enhancement model and a facial expression recognition algorithm with block principal component analysis (PCA). First, the luminance range of human face image is broadened and the contrast ratio of skin color is strengthened by the homomorphic filter. Second, the skin color enhancement model is established using YCbCr color space components to locate the face area. Third, the feature based on differential horizontal integral projection is extracted from the face. Finally, the block PCA with deep neural network is used to accomplish the facial expression recognition. The experimental results indicate that in the case of weaker illumination and more complicated backgrounds, both the face detection and facial expression recognition can be achieved effectively by the proposed algorithm, meanwhile the mean recognition rate obtained by the facial expression recognition method is improved by 2.7% comparing with the traditional Local Binary Patterns (LBPs) method. [ABSTRACT FROM AUTHOR]

For the virtual reality 360 ∘ videos, equirectangular projection (ERP) is a commonly used projection format. However, its high resolution brings extraordinary huge computational complexity in encoding. In order to speed up the intra coding process, a fast coding unit (CU) partitioning algorithm based on regional decision tree is proposed in this paper. The frame image is divided into two regions from a statistical point of view, and the earlysplit and pruned decision trees are established using light weight sample attributes for each region. With the help of these decision trees, the CU partitioning process is accelerated. Compared with the original algorithm of HM16.20, the proposed algorithm can reduce the encoding time by 28%, while BD-rate only increases by 0.27%. [ABSTRACT FROM AUTHOR]

With the development of information theory and image analysis theory, the studies on fault diagnosis methods based on image processing have become a hot spot in the recent years in the field of fault diagnosis. The gearbox of wind turbine generator is a fault-prone subassembly. Its time frequency of vibration signals contains abundant status information, so this paper proposes a fault diagnosis method based on time-frequency image characteristic extraction and artificial immune algorithm. Firstly, obtain the time-frequency image using wavelet transform based on threshold denoising. Secondly, acquire time-frequency image characteristics by means of Hu invariant moment and correlation fusion gray-level co-occurrence matrix of characteristic value, thus, to extract the fault information of the gearing of wind turbine generator. Lastly, diagnose the fault type using the improved actual-value negative selection algorithm. The application of this method in the gear fault diagnosis on the test bed of wind turbine step-up gearbox proves that it is effective in the improvement of diagnosis accuracy. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose the Atangana–Baleanu fractional methodology for fathoming the Van der Pol damping model by using the reproducing kernel algorithm. To this end, we discuss the mathematical structure of this new approach and some other numerical properties of solutions. Furthermore, all needed requirements for characterizing solutions by applying the reproducing kernel algorithm are debated. In this orientation, modern trend and new computational algorithm in terms of analytic and approximate Atangana–Baleanu fractional solutions are proposed. Finally, numerical simulations in fractional emotion is constructed one next to the other with tabulated data and graphical portrayals. [ABSTRACT FROM AUTHOR]

In this paper, it is proposed to combine the forecasts using a simple Bayesian forecast combination algorithm. The algorithm is applied to forecasts from three non-nested diffusion models for S shaped processes like virus diffusion. An illustration to daily data on first-wave cumulative Covid-19 cases in the Netherlands shows the ease of use of the algorithm and the accuracy of the newly combined forecasts. [ABSTRACT FROM AUTHOR]

SDN is approaching its own structure of acceptance. Therefore, the increasing deployment of SDNs is being discussed as a possible approach, appearing in the development of the hybrid SDN networks. An foremost work in the hybrid SDN networks is bandwidth allocation, taking into account the integration of both SDN-enabled and conventional switches. The network loop in layer 2 switches is skipped in Spanning Tree Protocol (STP) by ceaselessly watching the network to trace all links and block the unwanted ones. Bridge loops will occur anytime there's a redundant Layer2 way between ends. By default, switches forward broadcast/multicast out all ports, other than the port from that the broadcast/multicast was delivered. Once a switch loop is brought in the network, broadcast messages are going to be broadcasted more often leading to broadcast storms. The Spanning-tree algorithm enforces a distributed divergent of the Bellman-Ford iterative algorithm that always looks for the optimal solution and selects an optimal influential switch anytime. In this paper we use controller's global network view for resolving loop problem in layer 2 network. SDN controller acts on broadcast packets received from switch-ports and host-ports differently that is if the broadcast packets received from host ports, the SDN controller broadcasts these packets to all ports and if broadcast packets is received from switch ports, only some switches broadcasts these packets on all ports instead of all switches. [ABSTRACT FROM AUTHOR]

Using a prior biological knowledge of relationships and genetic functions for gene similarity, from repository such as the Gene Ontology (GO), has shown good results in multi-objective gene clustering algorithms. In this scenario and to obtain useful clustering results, it would be helpful to know which measure of biological similarity between genes should be employed to yield meaningful clusters that have both similar expression patterns (co-expression) and biological homogeneity. In this paper, we studied the influence of the four most used GO-based semantic similarity measures in the performance of a multi-objective gene clustering algorithm. We used four publicly available datasets and carried out comparative studies based on performance metrics for the multi-objective optimization field and clustering performance indexes. In most of the cases, using Jiang–Conrath and Wang similarities stand in terms of multi-objective metrics. In clustering properties, Resnik similarity allows to achieve the best values of compactness and separation and therefore of co-expression of groups of genes. Meanwhile, in biological homogeneity, the Wang similarity reports greater number of significant GO terms. However, statistical, visual, and biological significance tests showed that none of the GO-based semantic similarity measures stand out above the rest in order to significantly improve the performance of the multi-objective gene clustering algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a new auto-scoring algorithm that automatically evaluates the Berg balance scale (BBS) tasks is proposed. The BBS can be used as an indicator for patients to analyze their rehabilitation status by themselves. In the proposed method, the patient must use a wearable inertial measurement unit (IMU) sensor, and the result of the patient's BBS task execution would be scored automatically by the evaluation algorithm. The proposed evaluation algorithm involves only few computations and has high scoring accuracy. Nonlinear kernel principal component analysis and a small number of linear features were combined to reduce the features from each sensor, and the algorithm model was implemented using a support vector machine (SVM), a machine learning technique with low computational complexity. The effectiveness of the algorithm was evaluated through clinical evaluation of 53 subjects with up to eight IMU sensors. The average accuracy of the proposed algorithm using eight sensors was 93.2%, and that using five sensors was 91.5%. There was a 12.6% and 10.9% increase in accuracy, respectively, compared to a previous study. The training and testing times of the proposed SVM model were over 38 times faster than the multi-layer perceptron model used in a previous study. [ABSTRACT FROM AUTHOR]

Microscopic images of bovine milk somatic cells are used to classify neutrophils, epithelial cells, macrophages and lymphocytes. Using pattern recognition technology, the problem of classification and recognition is solved from different nature, levels and spaces. The proposed RKSGA-SVM algorithm is used to realize somatic cell image recognition. First, color, morphological and texture features of four types of cells are extracted separately, including geometric and moment invariant features. Second, ReliefF algorithm is used to calculate the weights of all features. According to preset cumulative contribution rate, the preliminary feature set is obtained. Third, redundant features are eliminated by Kolmogorov–Smirnov (KS) test, and the high-level optimization is obtained. The selected feature sets have remarkable distinguishing ability. Finally, the weighted optimal feature sets are obtained by weighted coefficient method on the advanced optimal feature sets. The overall accuracy of RKSGA-SVM algorithm is 99.00%, and Kappa coefficient is 0.987. The proposed algorithm has the advantages of balancing classification accuracy, eliminating redundancy and reducing feature dimension. On the premise of ensuring high classification accuracy, the feature set can reduce feature dimension and the amount of data calculation, improve operation efficiency and save storage space. Experiments show that the feature selection method proposed in this paper is feasible and more suitable for extracting feature sets in the process of somatic cell classification. [ABSTRACT FROM AUTHOR]

The one-dimensional Otsu method is an adaptive threshold method. It obtains the optimal threshold for image segmentation by the maximum between-class variance, without considering the minimum within-class variance. As the background of water surface image is mostly uniform, using this feature, the threshold selection tactics adopt the combination of the one-dimensional Otsu method and the uniformity measurement, proposes the threshold segmentation method based on uniformity measurement, and adopts the performance evaluation method based on GT image to compare the segmentation result. Experimental results demonstrate that effectiveness of the improved Otsu method is generally better than the traditional Otsu method, and the other four commonly used threshold segmentation methods for the water surface image, which improves the segmentation accuracy of such images and reduces the segmentation error rate. At the same time, as the water surface image is usually affected by light intensity, water ripple and other factors, this paper also adopts the relevant correction algorithm to further improve the segmentation accuracy. [ABSTRACT FROM AUTHOR]

The recommender system predicts user preferences by mining user historical behavior data. This paper proposes a social recommendation combining trust relationship and distance metric factorization. On the one hand, the recommender system has a cold start problem, which can be effectively alleviated by adding social relations. Simultaneously, to improve the problem of sparse trust matrix, we use the Jaccard similarity coefficient and the Dijkstra algorithm to reconstruct the trust matrix and explore the potential user trust relationship. On the other hand, the traditional matrix factorization algorithm is modeled by the user item potential factor dot product, however, it does not satisfy the triangle inequality property and affects the final recommender effect. The primary motivator behind our approach is to combine the best of both worlds, mitigate the inherent weaknesses of each paradigm. Combining the advantages of the two ideas, it has been demonstrated that our algorithm can enhance recommender performance and improve cold start in recommender systems. [ABSTRACT FROM AUTHOR]

This paper presents an optimized noise reduction hardware architecture for real electrooculogram (EOG) system. The proposed denoise architecture is developed using differential evolution (DE) algorithm. The algorithm design the filter with fewer sign-power-of-two (SPT) terms to optimize the denoise filter hardware with desired frequency response. The proposed denoise filter architecture with a DE coefficient set uses shift and add approach and is implemented in gate-level Verilog HDL. The real EOG denoise filter's functionality is checked with Altera DSP Builder and synthesized using Cadence RTL compiler. Both FPGA and ASIC synthesis results are compared with the recently published works. The area and power consumption results show that the proposed filter occupies less area and with low power consumption as compared to the existing architectures. [ABSTRACT FROM AUTHOR]

In order to solve the problems of low efficiency and long running time caused by the traditional Zernike moment method for convolution calculation of the whole image, this paper combines the canny detection algorithm with the Zernike moment method. First, the canny edge detection algorithm, which combined with the Otsu threshold method, is used to extract the pixel edge of the image. Then an improved Hough transform method is used to fit the geometric edge in the image. Based on this, the Zernike moment method is applied to realize sub-pixel positioning of images. The algorithm improves the deficiencies of direct sub-pixel detection, improving accuracy and reducing running time. To verify the effectiveness of the proposed algorithm, the algorithm is applied to the dimension measurement experiment of T-type guide way. The results clearly show that the algorithm is superior to the traditional algorithm in accuracy. [ABSTRACT FROM AUTHOR]

The security of chaotic cryptographic system can be theoretically evaluated by using conventional statistical tests and numerical simulations, such as the character frequency test, entropy test, avalanche test and SP 800-22 tests. However, when the cryptographic algorithm operates on a cryptosystem, the leakage information such as power dissipation, electromagnetic emission and time-consuming can be used by attackers to analyze the secret keys, namely the Side Channel Analysis (SCA) attack. In this paper, a cryptanalysis method is proposed for evaluating the security of a chaotic block cryptographic system from a hardware perspective by utilizing the Template Attacks (TAs). Firstly, a chaotic block cryptographic system is described briefly and implemented based on an Atmel XMEGA microcontroller. Then the TA using a multivariate Gaussian model is introduced. In order to reduce computational complexity and improve the efficiency of TA, the Hamming weight is used in this work to model power consumption traces. The proposed TA method has the following advantages including (a) using the sum of difference to select points of interest of traces, (b) using a data processing method to minimize the influences on power information modeling from the redundant sampling points, and (c) all the traces are aligned precisely before establishing the templates. Experimental results show that the TA can be used to attack the chaotic cryptographic systems and is more efficient, i.e. ∼ 32% less attack traces than correlation power analysis, when the templates are properly built. [ABSTRACT FROM AUTHOR]

In this paper, the first-passage behavior of under-damped asymmetric bistable system driven by Lévy noise is studied. The two aspects considered are the mean first-passage time (MFPT) and the distribution of first-passage time in two opposite directions. To begin with, using the Janicki–Weron algorithm to generate Lévy noise, the system driven by Lévy noise is simulated through the fourth-order Runge–Kutta algorithm. Then the first-passage time of 2 × 1 0 4 response tracks is calculated, and the MFPT and the distribution of first-passage time are obtained. Finally, the influence of Lévy noise and system parameters on MFPT and the distribution of first-passage time are analyzed. Moreover, the noise enhanced stability (NES) effect is found. [ABSTRACT FROM AUTHOR]

Link prediction based on node similarity has become one of the most effective prediction methods for complex network. When calculating the similarity between two unconnected endpoints in link prediction, most scholars evaluate the influence of endpoint based on the node degree. However, this method ignores the difference in contribution of neighbor (NC) nodes for endpoint. Through abundant investigations and analyses, the paper quantifies the NC nodes to endpoint, and conceives NC Index to evaluate the endpoint influence accurately. Extensive experiments on 12 real datasets indicate that our proposed algorithm can increase the accuracy of link prediction significantly and show an obvious advantage over traditional algorithms. [ABSTRACT FROM AUTHOR]

To overcome the shortcomings of the basic glowworm swarm optimization (GSO) algorithm, such as low accuracy, slow convergence speed and easy to fall into local minima, chaos algorithm and cloud model algorithm are introduced to optimize the evolution mechanism of GSO, and a chaos GSO algorithm based on cloud model (CMCGSO) is proposed in the paper. The simulation results of benchmark function of global optimization show that the CMCGSO algorithm performs better than the cuckoo search (CS), invasive weed optimization (IWO), hybrid particle swarm optimization (HPSO), and chaos glowworm swarm optimization (CGSO) algorithm, and CMCGSO has the advantages of high accuracy, fast convergence speed and strong robustness to find the global optimum. Finally, the CMCGSO algorithm is used to solve the problem of face recognition, and the results are better than the methods from literatures. [ABSTRACT FROM AUTHOR]

Face recognition (FR) is a hotspot in pattern recognition and image processing for its wide applications in real life. One of the most challenging problems in FR is single sample face recognition (SSFR). In this paper, we proposed a novel algorithm based on nonnegative sparse representation, collaborative presentation, and probabilistic graph estimation to address SSFR. The proposed algorithm is named as Nonnegative Sparse Probabilistic Estimation (NNSPE). To extract the variation information from the generic training set, we first select some neighbor samples from the generic training set for each sample in the gallery set and the generic training set can be partitioned into some reference subsets. To make more meaningful reconstruction, the proposed method adopts nonnegative sparse representation to reconstruct training samples, and according to the reconstruction coefficients, NNSPE computes the probabilistic label estimation for the samples of the generic training set. Then, for a given test sample, collaborative representation (CR) is used to acquire an adaptive variation subset. Finally, the NNSPE classifies the test sample with the adaptive variation subset and probabilistic label estimation. The experiments on the AR and PIE verify the effectiveness of the proposed method both in recognition rates and time cost. [ABSTRACT FROM AUTHOR]