Starting from unidentified objects moving inside a two-dimensional Euclidean manifold, we propose a simple method to detect the topological changes that occur during their reciprocal interactions and shape morphing.  This method, which allows the detection of topological holes development and disappearance, makes it possible to solve the uncertainty due to disconnectedness, lack of information and absence of objects’ sharp boundaries, i.e., the three troubling issues which prevent scientists to select the required proper sets/subsets during their experimental assessment of natural and artificial dynamical phenomena, such as fire propagation, wireless sensor networks, migration flows, neural networks’ and cosmic bodies’ analysis.   

We present a uniform method of density elimination for several semilinear substructural logics. Especially, the density elimination for the involutive uninorm logic IUL is proved. Then the standard completeness of IUL follows as a lemma by virtue of previous work by Metcalfe and Montagna.

Our method for density elimination is generalized to the non-commutative substructural logic GpsUL∗. Then the standard completeness of HpsUL∗follows as a lemma by virtue of previous workbyMetcalfeandMontagna. This result shows that HpsUL∗ is the logic of pseudo-uninorms and their residua and answered the question posed by Prof. Metcalfe, Olivetti, Gabbay and Tsinakis.

Matiyasevich's theorem states that there is no algorithm to decide whether or not a given Diophantine equation has a solution in non-negative integers. Smorynski's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. We prove: (1) Smorynski's theorem easily follows from Matiyasevich's theorem, (2 ) Hilbert's Tenth Problem for Q has a negative solution if and only if the set of all Diophantine equations with a finite number of rational solutions is not recursively enumerable.

With the increase of the Artificial Neural Network (ANN), machine learning has taken a forceful twist in recent times. One of the most spectacular kinds of ANN design is the Convolutional Neural Network (CNN). The Convolutional Neural Network (CNN) is a technology that mixes artificial neural networks and up to date deep learning strategies. In deep learning, Convolutional Neural Network is at the center of spectacular advances. This artificial neural network has been applied to several image recognition tasks for decades and attracted the eye of the researchers of the many countries in recent years as the CNN has shown promising performances in several computer vision and machine learning tasks. This paper describes the underlying architecture and various applications of Convolutional Neural Network.

This paper aims at tackling with the task of fusion feature from images and its corresponding point clouds for 3D object detection in autonomous driving scenarios basing on AVOD, an Aggregate View Object Detection network. The proposed fusion algorithms fuse features targeted from Bird’s Eye View (BEV) LIDAR point clouds and its corresponding RGB images. Differs in existing fusion methods, which are simply the adoptions of concatenation module, element-wise sum module or element-wise mean module, our proposed fusion algorithms enhance the interaction between BEV feature maps and its corresponding images feature maps by designing a novel structure, where single level feature maps and another utilizes multilevel feature maps. Experiments show that our proposed fusion algorithm produces better results on 3D mAP and AHS with less speed loss comparing to existing fusion method used on the KITTI 3D object detection benchmark.

We give a topological condition for a generic sliced space to be globally hyperbolic, without any hypothesis on the lapse function, shift function and spatial metric.

We report on an exploratory study conducted at a graduate school in Sweden with a humanoid robot, Baxter. First, we describe a list of potentially useful capabilities for a robot teaching assistant derived from brainstorming and interviews with faculty members, teachers, and students. These selected capabilities consist of reading, greeting, alerting, remote operation, clarification, and motion. Second, we present feedback on how the robot's capabilities, demonstrated in part with the Wizard of Oz approach, were perceived, and iteratively adapted over the course of several lectures, using the \EP tool. Third, we discuss observations and findings regarding the capabilities and the development process. Our findings suggest that using a social robot as a teaching assistant is promising using the chosen capabilities. We find that personalizing the capabilities and the role of embodiment are important topics to be considered in future work.

This paper has two major parts. In the first part histogram equalization for the image enhancement was implemented without using the built-in function in MATLAB. Here, at first, a color image of a rat was chosen and the image was transformed into a grayscale image. After this conversion, histogram equalization was implemented on the grayscale image. Later on, in the same image for each RGB channel, histogram equalization was implemented to observe the effect of histogram equalization on each channel. In the end, the histogram equalization was implemented to this specific color image of a rat. In the second part, for the grayscale image in part 1, the desired histogram of another colored image of a rat was introduced and histogram specification was implemented on the original colored image.

In recent years, CPU caches have revealed themselves as one of the most powerful sources of information leakage. This information leakage affects any implementation whose memory accesses, to data or instructions, depend on sensitive information such as private keys. In most cases, side-channel cache attacks do not require any specific permission and just need access to a shared cache. This fact, combined with the spread of cloud computing, where the infrastructure is shared between different customers, have made these attacks quite popular. In this paper, we present a novel approach to exploit the information obtained from the CPU cache. First, we introduce a non-access attack that provides a 97\% reduction in the number of encryptions required to obtain a 128-bit AES key. Next, this attack is adapted and extended in what we call the encryption-by-decryption cache attack or EBD, to obtain a 256-bit AES key. When EBD is applied to AES-256, we are able to obtain the 256 bits of the key with less than 10000 encryptions. These results make EBD, to the best of our knowledge, the first practical attack on AES-256 and also demonstrate that AES-256 is only about 3 times more complex to attack than AES-128 via cache attacks. In both cases the target is the AES T-table-based implementation, and we also demonstrate that our approach works in a cross-VM scenario.

Estimation and planning play a vital role in the construction of an autonomous navigation framework. However, these problems are often considered separately, while planning gives robot a free-collision path towards the desired goal, estimation algorithm presents the executed trajectory in the sense that it has to be closed to the ground truth path as much as possible. Recently, a unified probabilistic framework, which supports solving these problems simultaneously, dubbed STEAP has been proposed. Nevertheless, its current version is only designated for an omni wheels robot, which allows robot to move and turn in vertical direction. Differential drive robot, on the other hand, though limited to move along only one direction, has been used in various situations due to its flexibility and lower cost in hardware designing. Thus, in this extension, our aim is to control a differential drive robot via STEAP. Moreover, in a more complicated environment such as labyrinth or maze, the original STEAP sometimes fails to find a path. Indeed, this problem is mainly caused by the poor initialization and the non-linearity in optimizer constraints. In our implementation, instead of dealing with these constraints, we employ a global planner algorithm such as Dijkstra or RRT to treat STEAP as an effective local planner module that focus on following the global path. Consequently, the experimental results show that the extended STEAP not only able to navigate a differential drive robot but also in a more complicated and unstructured environment.

Komlos conjecture is about the existing of a universal constant K such that for all dimension n and any collection of vectors (V_1 ) ⃗ ,…,(V_n ) ⃗ ∈R^n with ‖(V_i ) ⃗ ‖_2≤1 , there are weights ε_i∈{-1,1} in such that ‖∑_(i=1)^n▒〖ϵ_i (V_i ) ⃗ 〗‖_∞≤K(n)≤K. In this paper, the constant K(n) is evaluated for n≤5 to be K(2)=√2, K(3)=(√2+√11)/3, K(4)=√3, and K(5)=(4+√142)/9. For higher dimension, the function f(n)=√(n-⌈〖 log〗_2 (2^(n-1)⁄n)⌉ ) is found to be the lower bound for the constant K(n), from where it can be concluded that the Komlos conjecture is false i.e., the universal constant K=max┬(‖(V_i ) ⃗^* ‖_2≤1)⁡min┬(ε_i=±1)⁡〖‖∑_(i=1)^n▒〖ϵ_i (V_i ) ⃗^* 〗‖_∞ 〗 does not exsit because of lim┬(n→∞)⁡〖K(n)≥lim┬(n→∞)⁡√(log⁡(n)-1)=+∞〗.

In this paper, at first, a color image of a car is taken. Then the image is transformed into a grayscale image. After that, the motion blurring effect is applied to that image according to the image degradation model described in equation 3. The blurring effect can be controlled by a and b components of the model. Then random noise is added in the image via Matlab programming. Many methods can restore the noisy and motion blurred image; particularly in this paper Inverse filtering as well as Wiener filtering are implemented for the restoration purpose. Consequently, both motion blurred and noisy motion blurred images are restored via Inverse filtering as well as Wiener filtering techniques and the comparison is made among them.

Thresholding is considered as a statistical-decision making theory which can lessen the average error incurred in allocating pixels to two or more groups. The traditional Bayes decision rule can be applied with the prior knowledge of the Probability Density Function (PDF) of each class. It is surmised that a threshold resulting in the best class separation is the optimal one. In this paper, Otsu’s thresholding for image segmentation has been implemented. The well-known Otsu’s method is to learn a threshold that can maximize the between-class variance or equivalently make light of the within-class variance of the entire image. At first, a color image of a tree is taken. After that, the image is transformed into a grayscale image. Then in the first part, two-level thresholding is conducted, and later on, three-level thresholding is also applied. Again, two-level thresholding, as well as three level thresholding, are also applied to some other images. Finally, the comparison is made between two level thresholding and three level thresholding

In this work, we establish some new Hermite-Hadamard type inequalities for convex functions via conformable fractional integral. Moreover, we show that through the conformable fractional integral we can find some new Hermite-Hadamard type inequalities for convex functions via the classical integrals.

The aim of this research work was to provide model for predicting stock volatility in Nigeria Stock market. To achieve this, monthly data for Nigerian stock exchange, Exchange rate, Share index and inflation rate was collected for a period of January 1990 to December 2016.The descriptive statistics revealed these variables to exhibit volatility as a characteristics of financial time –varying series. DCC Model was fitted, were the coefficients for all the parameters and that of the correlation-Targeting (rho_21) are both negative and positive and tend very close to 1 and -1, indicating that high persistence in the conditional variances. The Model DCC, satisfied the properties of a good model of conditional mean and variance of the confidential Interval (C.I) of 1 and -1, that is, the conditional variances are finites and their series are strictly stationary. This therefore implies that the Nigerian Stock Exchange, Exchange rate, share index and Inflation rate will experience a non-steady shock in the Stock market. However Each of these variables have different length of recovery (volatility half- life)  ranging from 1.5month, 6.5months, 6months to 2,4months   for stock exchange, exchange rate, share index and inflation rate respectively. By implication, the volatility of these variables had a long memory, persistence and mean-reverting.

Clustering is an important task in data mining that has become more challenging due to the ever-increasing size of available datasets. To cope with these big data scenarios, a high-performance clustering approach is required. Sparse grid clustering is a density-based clustering method that uses a sparse grid density estimation as its central building block. The underlying density estimation approach enables the detection of clusters with non-convex shapes and without a predetermined number of clusters. In this work, we introduce a new distributed and performance-portable variant of the sparse grid clustering algorithm that is suited for big data settings. Our compute kernels were implemented in OpenCL to enable portability across a wide range of architectures. For distributed environments, we added a manager-worker scheme that was implemented using MPI. In experiments on two supercomputers, Piz Daint and Hazel Hen, with up to 100 million data points in a 10-dimensional dataset, we show the performance and scalability of our approach. The dataset with 100 million data points was clustered in 1198s using 128 nodes of Piz Daint. This translates to an overall performance of 352TFLOPS. On the node-level, we provide results for two GPUs, Nvidia's Tesla P100 and the AMD FirePro W8100, and one processor-based platform that uses Intel Xeon E5-2680v3 processors. In these experiments, we achieved between 43% and 66% of the peak performance across all compute kernels and devices, demonstrating the performance portability of our approach.

E-commerce businesses employ recommender models to assist in identifying a personalized set of products for each visitor. To accurately assess the recommendations’ influence on customer clicks and buys, three target areas—customer behavior, data collection, user-interface —will be explored for possible sources of erroneous data. Varied customer behavior misrepresents the recommendations’ true influence on a customer due to the presence of B2B interactions and outlier customers. Non-parametric statistical procedures for outlier removal are delineated and other strategies are investigated to account for the effect of a large percentage of new customers or high bounce rates. Subsequently, in data collection we identify probable misleading interactions in the raw data, propose a robust method of tracking unique visitors, and accurately attributing the buy influence for combo products. Lastly, user-interface issues discuss the possible problems caused due to the recommendation widget’s positioning on the e-commerce website and the stringent conditions that should be imposed when utilizing data from the product listing page. This collective methodology results in an exact and valid estimation of the customer’s interactions influenced by the recommendation model in the context of standard industry metrics such as Click-through rates, Buy-through rates, and Conversion revenue.

In this paper, a local meshless method (LMM) based on radial basis functions (RBFs) is utilized for the numerical solution of various types of PDEs, due to the flexibility with respect to geometry and high order of convergence rate. In case of global meshless methods, the two major deficiencies are the computational cost and the optimum value of shape parameter. Therefore, research is currently focus towards localized radial basis function approximations, as the local meshless method is proposed here. The local meshless procedures is used for spatial discretization whereas for temporal discretization different time integrators are employed. The proposed local meshless method is testified in terms of efficiency, accuracy and ease of implementation using regular and irregular domains.

The aim of this work is to study generalizations of the notion of mean. Kolmogorov proposed a generalization based on an improper integral with a decay rate for the tail probabilities. This weak or Kolmogorov mean relates to the Weak Law of Large Numbers in the same way that the ordinary mean relates to the Strong Law. We propose a further generalization, also based on an improper integral, called the doubly weak mean, applicable to heavy-tailed distributions such as the Cauchy distribution and the other symmetric stable distributions, We also consider generalizations arising from Abel-Feynman type mollifiers that damp the behavior at infinity and alternative formulations of the mean in terms of the cumulative distribution and the characteristic function.

We study the effectiveness of various machine learning techniques, including artificial neural networks, support vector machine, logistic regression, K-nearest neighbors, decision tree and Naive Bayesian, for detecting and mitigating power jamming attacks in optical networks. Our study shows that artificial neural network is the most accurate in detecting out-of-band power jamming attacks in optical networks. To further mitigating the power jamming attacks, we apply a new resource reallocation scheme that utilizes the statistical information of attack detection accuracy, and propose a resource reallocation algorithm to lower the probability of successful jamming of lightpaths. Simulation results show that higher the accuracy of detection, lower is the likelihood of jamming a lightpath.

IoT is a new communication paradigm that gains a very high importance in the past few years. This communication paradigm supports various heterogeneous applications in many fields and with the dramatic increase of the number of sensor devices, it becomes a demand. Designing IoT networks faces many challenges that include security, massive traffic, high availability, high reliability and energy constraints. Thus, new communication technologies and paradigms should be deployed for IoT networks to overcome these challenges and achieve high system performance. Distributed computing techniques (e.g. fog and MEC), software defined networking (SDN), network virtualization and blockchain are common recent paradigms that should be deployed for IoT networks, either combined or individually, to achieve the main requirements of the IoT networks at a high system performance. Fog computing is a form of edge computing that has been developed to provide the computing capabilities (e.g. storage and processing) at the edge of the access network. Employing Fog computing in IoT networks, as an intermediate layer between IoT devices and the remote cloud, becomes a demand to make use of the edge computing benefits. In this work, we provide a framework for the IoT system structure that employs an edge computing layer of Fog nodes controlled and managed by SDN network with the blockchain technology to achieve a high level of security for latency sensitive IoT applications. The proposed system employs SDN network with distributed controllers and distributed OpenFlow switches; these switches are enabled with limited computing and processing capabilities.  Furthermore, a data offloading algorithm is developed to allocate different processing and computing tasks to the distributed OpenFlow switches with available resources. Moreover, a traffic model is proposed to model and analyze the traffic among different parts of the network. The proposed work achieves various benefits to the IoT network, such as the latency reduction, security improvement and high efficiency of resources utilization. The proposed algorithm is simulated and also the proposed system is experimentally tested over a developed testbed to validate the proposed structure. Experimental results show that the proposed system achieves higher efficiency in terms of latency, security and resource utilization.

The present reality of the Nigerian economy is the fact that inflation has remained unabated in spite of all exchange rate measures that have been adopted by the monetary authority. This calls for investigation into the extent to which exchange rate impact on inflation in Nigeria. The research paper examined the impact of exchange rate depreciation on inflation in Nigeria for the period 1981–2017, using Auto Regressive Distributed Lag (ARDL) Bounds Test Cointegration Procedure. The research shows that inflation rate in Nigeria is highly susceptible to lagged inflation rate, exchange rate, lagged exchange rate, lagged broad money, and lagged gross domestic product at 5% level of significance. A long run relationship was also found to exist between inflation rate, gross domestic product and general government expenditure, indicating that the model has a self-adjusting mechanism for correcting any deviation of the variables from equilibrium. Therefore, this study concludes that exchange rate is an important tool to manage inflation in the country; thus, this paper recommends that policies that have direct influence on inflation as well as exchange rate policies that would checkmate inflation movement in the country, should be used by the Central Bank of Nigeria. Also, monetary growth and import management policies should be put in place to encourage domestic production of export commodities, which are currently short-supplied. In addition, policy makers should not rely on this instrument totally to control inflation, but should use it as a complement to other macro-economic policies.

Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. One of these is a four-parameter polynomial with a discrete spectrum. Another that appeared while solving a Heun-type equation has a mix of continuous and discrete spectra. Based on these results and on our recent study of the solution space of an ordinary differential equation of the second kind with four singular points, we introduce a modification of the hypergeometric polynomials in the Askey scheme. Up to now, all of these polynomials are defined only by their three-term recursion relations and initial values. However, their other properties like the weight function, generating function, orthogonality, Rodrigues-type formula, etc. are yet to be derived analytically. This is an open problem in orthogonal polynomials.

In this paper, we look at how Artificial Swarm Intelligence can evolve using evolutionary algorithms that try to minimize the sensory surprise of the system. We will show how to apply the free-energy principle, borrowed from statistical physics, to quantitatively describe the optimization method (sensory surprise minimization), which can be used to support lifelong learning. We provide our ideas about how to combine this optimization method with evolutionary algorithms in order to boost the development of specialized Artificial Neural Networks, which define the proprioceptive configuration of particular robotic units that are part of a swarm. We consider how optimization of the free-energy can promote the homeostasis of the swarm system, i.e. ensures that the system remains within its sensory boundaries throughout its active lifetime. We will show how complex distributed cognitive systems can be build in the form of hierarchical modular system, which consists of specialized micro-intelligent agents connected through information channels. We will also consider the co-evolution of various robotic swarm units, which can result in development of proprioception and a comprehensive awareness of the properties of the environment. And finally, we will give a brief outline of how this system can be implemented in practice and of our progress in this area.

Timely detection of surface damages on wind turbine blades is imperative for minimising downtime and avoiding possible catastrophic structural failures. With recent advances in drone technology, a large number of high-resolution images of wind turbines are routinely acquired and subsequently analysed by experts to identify imminent damages. Automated analysis of these inspection images with the help of machine learning algorithms can reduce the inspection cost, thereby reducing the overall maintenance cost arising from the manual labour involved. In this work, we develop a deep learning based automated damage suggestion system for subsequent analysis of drone inspection images. Experimental results demonstrate that the proposed approach could achieve almost human level precision in terms of suggested damage location and types on wind turbine blades. We further demonstrate that for relatively small training sets advanced data augmentation during deep learning training can better generalise the trained model providing a significant gain in precision.

In this paper, we study the well-posedness and asymptotics of a one-dimensional thermoelastic laminated beam system either with or without structural damping, where the heat conduction is given by Fourier's law effective in the rotation angle displacements. We show that the system is well-posed by using Lumer-Philips theorem, and prove that the system is exponentially stable if and only if the wave speeds are equal, by using the perturbed energy method and Gearhart-Herbst-Prüss-Huang theorem. Furthermore, we show that the system with structural damping is polynomially stable provided that the wave speeds are not equal, by using the second-order energy method.

This paper predict and effectively control the temperature distribution of the steady-state and transient states of anisotropic four-layer composite materials online, knowing the density, specific heat, heat conductivity and thickness of the composite materials. Based on the transfer function, a mathematical model was established to study the dynamic characteristics of heat transfer of the composite materials. First of all, the Fourier heat transfer law was used to establish a one-dimensional Fourier heat conduction differential equation for each composite layer, and the Laplace transformation was carried out to obtain the system function. Then the approximate second-order transfer function of the system was obtained by Taylor expansion, and the Laplace inverse transformation was carried out to obtain the transfer function of the whole system in the time domain. Finally, the accuracy of the simplified analytical solutions of the first, second and third order approximate transfer functions was compared with computer simulation. The results showed that the second order approximate transfer functions can describe the dynamic process of heat transfer better than others. The research on the dynamic characteristics of heat transfer in the composite layer and the dynamic model of heat transfer in composite layer proposed in this paper have a reference value for practical engineering application. It can effectively predict the temperature distribution of composite layer material and reduce the cost of experimental measurement of heat transfer performance of materials.

In this paper, we work with a diffusion-perturbed risk model comprising a surplus generating process and an investment return process. The investment return process is of standard Black-Scholes type, that is, it comprises a single risk-free asset that earns interest at a constant rate and a single risky asset whose price process is modelled by a geometric Brownian motion. Additionally, the company is allowed to purchase noncheap proportional reinsurance priced via the expected value principle. Using the Hamilton-Jacobi-Bellman approach, we derive a second-order Volterra integrodifferential equation which we transform into a linear Volterra integral equation of the second kind. We proceed to solve this integral equation numerically using the block-by-block method for the optimal reinsurance retention level that minimizes the ultimate ruin probability. The numerical results based on light- and heavy-tailed distributions show that proportional reinsurance and investments play a vital role in enhancing the survival of insurance companies. But the ruin probability exhibits sensitivity to the volatility of the stock price.

In most econometrics literature, the Autoregressive Distributed Lag (ARDL) model is often applied in many economic analyses to study short and long run relationships. This is because ARDL model can deal with economic variables that are integrated of different order (I(0), I(1) or combination of both) and also it is robust where there is single long-run relationship between the underlying variables in a simple sample size. This study applied the ARDL model to examine the contributions of commercial Banks to GDP growth in Nigeria. To achieve this, annual data covering 1981 to 2015 for loans and advances, savings, lending rates and GDP of Financial Institutions were collected from CBN bulletin. The ADF test revealed that the variables are I(1) except for lending rate which was of I(0) order. The ARDL(1,1,1,2) model revealed that loans and advances, and lending rates are significantly positively related to GDP in Nigeria but savings was not significant in the model. The model revealed some evidence of short run relationships while the ecm(-1) was -0.6156 (P-value=0.0038<0.05) which means that the rate of the speed of adjustment to equilibrium is 61.56% annually. The estimated model is free from serial correlation, multicollinearity, heteroscedasticity while the model is stable and the residuals are normally distributed. The study recommends that savings and savings culture should be encouraged in Nigeria since economic theory states that savings and investment are related in any economic development.

We derive a concentration inequality for the uncertainty in stratied random sampling. Minimising this inequality leads to an iterated online method for choosing samples from the strata. The inequality is versatile and considers a range of factors including: the data ranges, weights, sizes of the strata, as well as the number of samples taken, the estimated sample variances and whether strata are sampled with or without replacement. We evaluate the improvement this method reliably offers against other methods over sets of synthetic data, and also in approximating the Shapley value of cooperative games. The method is seen to be competitive with the performance of perfect Neyman sampling, even without prior information on strata variances. We supply a multidimensional extension of our inequality and discuss some future applications.

The dark proteome as we define it, is the part of the proteome where 3D structure has not been observed either by homology modeling or by experimental characterization in the protein universe. From the 550.116 proteins available in Swiss-Prot (as of July 2016) 43.2% of the Eukarya universe and 49.2% of the Virus universe are part of the dark proteome. In Bacteria and Archaea, the percentage of the dark proteome presence is significantly less, with 12.6% and 13.3% respectively. In this work, we present the map of the dark proteome in Human and in other model organisms. The most significant result is that around 40%- 50% of the proteome of these organisms are still in the dark, where the higher percentages belong to higher eukaryotes (mouse and human organisms). Due to the amount of darkness present in the human organism being more than 50%, deeper studies were made, including the identification of ‘dark’ genes that are responsible for the production of the so-called dark proteins, as well as, the identification of the ‘dark’ organs where dark proteins are over represented, namely heart, cervical mucosa and natural killer cells. This is a step forward in the direction of the human dark proteome.

The geometry of Poincare disk itself is interpreted without any mapping to dierent spaces. Our approach might be one of the shortest and is intended for educational contribution.

Multispectral remote sensing data may contain component images which are heavily corrupted by noise and pre-filtering (denoising) procedure is often applied to enhance these component images. To do this, one can use reference images – component images having relatively high quality and which are similar to the image subject to pre-filtering. Here we study the following problems: how to select component images that can be used as references (e.g., for the Sentinel multispectral remote sensing data) and how to perform the actual denoising. We demonstrate that component images of the same resolution as well as component images of a better resolution can be used as references. Examples of denoising of real-life images demonstrate high efficiency of the proposed approach.

In this paper we define a continuous wavelet transform of a Schwartz tempered distribution $f \in S^{'}(\mathbb R^n)$ with wavelet kernel $\psi \in S(\mathbb R^n)$ and derive the corresponding wavelet inversion formula interpreting convergence in the weak topology of $S^{'}(\mathbb R^n)$. It turns out that the wavelet transform of a constant distribution is zero and our wavelet inversion formula is not true for constant distribution, but it is true for a non-constant distribution which is not equal to the sum of a non-constant distribution with a non-zero constant distribution.

Multigranulation is a new approach to the Rough Set Theory, where several separability relationships are used to obtain different granulations of the universe. The Multigranulation starts from the existence of different contexts or subsets of features to characterize the objects of the universe. In this paper, a method for the generation of contexts from the construction of similarity relations is proposed.The proposed solution was evaluated in an international database using the KNN classifier. It was also applied in the solution of a real problem in Civil Engineering specifically in Traffic Engineering, the contexts generated from the proposal used to determine the features of higher incidence in the service level of the road. The results achieved both in the international database and in the proposed application demonstrate the applicability of the proposed method.

This article deals with the conformable double Laplace transforms and their some properties with examples and also the existence Condition for the conformable double Laplace transform is studied. Finally, in order to obtain the solution of nonlinear fractional problems, we present a modified conformable double Laplace that we call conformable double Laplace decomposition methods (CDLDM). Then, we apply it to solve, Regular and singular conformable fractional coupled burgers equation illustrate the effectiveness of our method some examples are given.

We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}

Let $\Gamma_{\fbox{n}}(k)$ denote $(k-1)!$, where $n \in \{3,\ldots,14\}$ and $k \in \{2\} \cup \left\{2^{\textstyle 2^{n-3}}+1, 2^{\textstyle 2^{n-3}}+2, 2^{\textstyle 2^{n-3}}+3, \ldots\right\}$. For an integer $n \in \{3,\ldots,14\}$, let $\Sigma_n$ denote the following statement: if a system of equations ${\mathcal S} \subseteq \{\Gamma_{\fbox{n}}(x_i)=x_k:~i,k \in \{1,\ldots,n\}\} \cup \{x_i \cdot x_j=x_k:~i,j,k \in \{1,\ldots,n\}\}$ has only finitely many solutions in positive integers $x_1,\ldots,x_n$, then each such solution $(x_1,\ldots,x_n)$ satisfies $x_1,\ldots,x_n \leqslant 2^{\textstyle 2^{n-2}}$. The statement $\Sigma_6$ proves the following implication: if the equation $x(x+1)=y!$ has only finitely many solutions in positive integers $x$ and $y$, then each such solution $(x,y)$ belongs to the set $\{(1,2),(2,3)\}$. The statement $\Sigma_6$ proves the following implication: if the equation $x!+1=y^2$ has only finitely many solutions in positive integers $x$ and $y$, then each such solution $(x,y)$ belongs to the set $\{(4,5),(5,11),(7,71)\}$. The statement $\Sigma_9$ implies the infinitude of primes of the form $n^2+1$. The statement $\Sigma_9$ implies that any prime of the form $n!+1$ with $n \geqslant 2^{\textstyle 2^{9-3}}$ proves the infinitude of primes of the form $n!+1$. The statement $\Sigma_{14}$ implies the infinitude of twin primes. The statement $\Sigma_{16}$ implies the infinitude of Sophie Germain primes. A modified statement $\Sigma_7$ implies the infinitude of Wilson primes.

An SIRS (Susceptible–Infected–Removed-Susceptible) mathematical model for the transmission dynamics of the Transfusion–Transmitted Malaria (TTM) model with optimal control pair u₁(t) and u₂(t) was developed and studied in this research work. The model Transfusion–Transmitted Malaria disease–free equilibrium and endemic equilibriums points were determined. The model exhibited two equilibriums; disease-free and endemic equilibrium. It is shown that the disease–free equilibrium was locally asymptotically stable if the associated basic reproduction numbers R₀ is less than unity while the disease persists if R₀ is greater than unity. The global stability of the Transfusion–Transmitted Malaria model at the disease-free equilibrium was established using the comparison method. The optimality system was derived and an optimal control model of blood screening and drug treatment for the Transfusion–Transmitted Malaria model was investigated. Conditions for the optimal control were considered using Pontryagin’s Maximum Principle and solved numerically using the Forward and Backward Finite Difference Method (FBDM). Numerical results obtained are in perfect agreement with our analytical results.

The violation of privacy, others people or personal, is a very current problem, which concerns not only on the web but also in private life. In the years 1990 it was expected that nowadays, that any routine operation was carried out "manually", and it would be performed through mobile phones or personal computers. The problem pertains the distribution network that allows to share and bring together information and as result the network becomes unsafe, if subjected to attacks. Nowaday we put personal information on web because otherwise we are seen as “weak”. This work aims to measure and analyze how much information are shared by users of a pre-established social network and it is carried out through a set of algorithms techniques of machine learning.

We investigate the exact travelling wave solutions of the Tzitzéica-Dodd–Bullough–Mikhailov (TDBM) and Tzitzéica-type (TT) equations, appear in nonlinear optics, using simple ansatz approach. We use the Painlevé and traveling wave transformations to convert the mentioned nonlinear equations into nonlinear ordinary differential equations. Then, the simple ansatz approach has been employed to procure wave solutions, in terms of bright, singular soliton and trigonometric functions, for the Tzitzéica-Dodd–Bullough–Mikhailov (TDBM) and Tzitzéica-type (TT) equations. The study shows that the simple ansatz approach is straightforward and easy to implement for solving nonlinear problems.

As e-commerce services and Internet technology have rapidly developed in recent years, many services and applications integrating these technologies can now be completed online. These commercial activities include online auctions, online ticketing and online payments. The client shops from the store online, andthe store delivers the goods to the client. The goods can be divided into digital products without entities, as well as actual entities. If it is a physical product, the store will deliver the package to the client through itslogistics. However, there have been many cases of switched goods purchased by clients in recent years. Earlier, some scholars proposed a security mechanism with a subliminal channel for E-cash and digital content. Only the sender and the receiver would know that the secret information was hidden in the signature. So the privacy of this subliminal message couldbe ensured. We apply this concept to the logistics environment to design secure logistics architecture with subliminal messages. The client can check the subliminal message of the received package, and know whether the package has been switched by malicious people. In addition, the proposed scheme also applies sensor technology;the client can check the GPS location, the temperature and humidity at any time during the delivery process. So intelligent logisticswouldthereby be achieved. This paper proposes an intelligent and secure package sensoring logistics system based on a subliminal channel. The proposed architecture uses the related mechanisms tosolve the problems of a logistics system, including how to achieve mutual authentication, data integrity, anti-switch package, package location and status tracing, resisting replay attacks, forward and backward secrecy, and non-repudiation issues.

Security is a major topic in recent researchers, and finding new methods deliver was the motivations for this research to emphasize and as an awareness to browsers developers to handle images with more care and to enhance exploit detection technology in the browser, as this paper proves that hackers now can attack users with just an image.

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another denitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

We introduce a new variation on the domination theme which we call nikfar domination as reducing waste of time in transportation planning. We determine the nikfar domination number  v for several classes of fuzzy graphs. The bounds is obtained for it. We prove both of the Vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for nikfar domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. Finally, we discuss about nikfar dominating set of a fuzzy tree by using the bridges and -strong edges equivalence.

This research proposed in this paper focuses on gathering evidence from devices with Windows 10 operating systems in order to discover and collect artifacts left by cloud storage applications that suggest their use even after the deletion of the Google client application. We show where and what type of data remnants can be found using our analysis which can be used as evidence in a digital forensic investigations.

Fast 3D reconstruction with semantic information on road scenes is of great requirements for autonomous navigation. It involves issues of geometry and appearance in the field of computer vision. In this work, we propose a method of fast 3D semantic mapping based on the monocular vision. At present, due to the inexpensive price and easy installation, monocular cameras are widely equipped on recent vehicles for the advanced driver assistance and it is possible to acquire semantic information and 3D map. The monocular visual sequence is used to estimate the camera pose, calculate the depth, predict the semantic segmentation, and finally realize the 3D semantic mapping by combination of the techniques of localization, mapping and scene parsing. Our method recovers the 3D semantic mapping by incrementally transferring 2D semantic information to 3D point cloud. And a global optimization is explored to improve the accuracy of the semantic mapping in light of the spatial consistency. In our framework, there is no need to make semantic inference on each frame of the sequence, since the mesh data with semantic information is corresponding to sparse reference frames. It saves amounts of the computational cost and allows our mapping system to perform online. We evaluate the system on naturalistic road scenes, e.g., KITTI and observe a significant speed-up in the inference stage by labeling on the mesh.

Supplier selection is one of the most important multi criteria decision making (MCDM) problems for decision makers in competitive market. Organizations of today’s world are seeking new ways to reduce negative effects of their organizations to the environment and to reach a greener system. At this point, green supplier selection concept has gained great importance with its ability on incorporating environmental or green criteria into the classical supplier selection practices. Therefore, in this study, it is aimed at proposing a multi-phase MCDM model based on Best-Worst Method (BWM) and interval type-2 fuzzy technique for order preference by similarity to ideal solution (TOPSIS). A case study in a plastic injection molding facility in Turkey is performed to show the applicability of the proposed integrated methodology. The paper ensures insights into the decision making, methodology, and managerial implications. Results of the case study are examined and suggestions for future research are provided.

The authors intend to establish new oscillation criteria for a class of generalized third order functional difference equation of the form \begin{equation}{\label{eq01}} \Delta_{\ell}\left(a_2(n)\left[\Delta_{\ell}\left(a_1(n)\left[\Delta_{\ell}z(n)\right]^{\beta_1}\right)\right]^{\beta_2}\right)+q(n)f(x(g(n)))=0, ~~n\geq n_0, \end{equation} where $z(n)=x(n)+p(n)x(\tau(n))$. We also present sufficient conditions for the solutions to converges to zero. Suitable examples are presented to validate our main results.

Reverse-order laws for generalized inverses of matrix products is a classic object of study in the theory of generalized inverses. One of the well-known reverse-order laws for a matrix product AB is (AB)^(i,...,j) = B^(i,...,j)A^(i,...,j), where (·)^i,...,j denotes an {i,...,j}-generalized inverse of matrix. Because {i,...,j}-generalized inverse of a general matrix is not necessarily unique, the relationships between both sides of the reverse-order law can be divided into four situations for consideration. In this article, we first introduce a linear mixed model y = ABβ + Aγ + ε, present two least-squares  methodologies to estimate the fixed parameter vector in the model, and describe the connections between the two least-squares estimators and the reverse-order laws for generalized inverses of the matrix product AB. We then prepare some valued matrix analysis tools, including a general theory on linear or nonlinear matrix identities, a group of expansion formulas for calculating ranks of block matrices, two groups of explicit formulas for calculating the maximum and minimum ranks of B^(i,...,j)A^(i,...,j), as well as necessary and sufficient conditions for B^(i,...,j)A^(i,...,j) to be invariant with respect to the choice of A^(i,...,j) and B^(i,...,j). We then present a unied approach to the 512 set inclusion problems {(AB)^(i,...,j) ⊇ {B^(i,...,j)A^(i,...,j)}for the eight commonly-used types of generalized inverses of A, B, and AB using the block matrix representation method (BMRM), matrix equation method (MEM), and matrix rank method (MRM), where {(·)^(i,...,j)} denotes the collection of all {i,...,j}-generalized inverse of a matrix.

A method of solution to solve the compressible unsteady 3D Navier-Stokes Equations in cylindrical co-ordinates coupled to the continuity equation in cylindrical coordinates is presented in terms of an additive solution of the three principle directions in the radial, azimuthal and z directions of flow. A dimensionless parameter is introduced whereby in the large limit case a method of solution is sought for in the boundary layer of the tube. A reduction to a single partial differential equation is possible and integral calculus methods are applied for the case of a body force directed to the centre of the tube to obtain an integral form of the Hunter-Saxton equation. Also an extension for a more general body force is shown where in addition there is a rotational force applied.

Indoor navigation systems must deal with absence of GPS signals, since they are only available in outdoor environments. Therefore, indoor systems have to rely upon other techniques for positioning users. Recently various indoor navigation systems have been designed and developed to help visually impaired people. In this paper an overview of some existing indoor navigation systems for visually impaired people are presented and they are compared from different perspectives. The evaluated techniques are ultrasonic systems, RFID-based solutions, computer vision aided navigation systems, ans smartphone-based applications.

Digital Evidence is considered as an important type of evidence in many legal cases. Many legislations have dedicated laws to the collection, handling and admissibility of digital evidence. New technologies and new devices are rapidly being developed, which creates new sources of digital evidence. This presents a challenge to law enforcement agencies and digital investigators to stay up to date with the rapid development in the digital field. This paper discusses a relatively new source of digital evidence which is the evidence extracted from Wearable devices. A Fitbit fitness tracker is one of the most common wearable devices used by many people today. This paper presents a case study whereby data extracted from a Fitbit was used as a digital evidence. The admissibility and the challenges of using Wearables as digital evidence is also discussed.

This paper establishes a real integral representation of the reciprocal $\Gamma$ function in terms of a regularized hypersingular integral. The equivalence with the usual complex representation is demonstrated. A regularized complex representation along the usual Hankel path is derived.

The manuscript surveys the special functions of the Fox-Wright type. These functions are generalizations of the hypergeometric functions. Notable representatives of the type are the Mittag-Leffler functions and the Wright function. The integral representations of such functions are given and the conditions under which these function can be represented by simpler functions are demonstrated. The connection with generalized fractional differential and integral operators is demonstrated and discussed.

In the paper, a fully discrete compact difference scheme with $O(\tau^{2}+h^{4})$ precision is established by considering the numerical approximation of the one-dimensional Allen-Cahn equation. The numerical solutions satisfy discrete maximum principle under reasonable step ratio and time step constraint is proved. And the energy stability for the fully discrete scheme is investigated. An example is finally presented to show the effectiveness of scheme.

The aim of this article is to extend the local as well as the semi-local convergence analysis of multi-point iterative methods using center Lipschitz conditions in combination with our idea, of the restricted convergence region. It turns out that this way a finer convergence analysis for these methods is obtained than in earlier works and without additional hypotheses. Numerical examples favoring our technique over earlier ones completes this article.

We propose a deep-learning approach for the joint MIMO detection and channel decoding problem. Conventional MIMO receivers adopt a model-based approach for MIMO detection and channel decoding in linear or iterative manners. However, due to the complex MIMO signal model, the optimal solution to the joint MIMO detection and channel decoding problem (i.e., the maximum likelihood decoding of the transmitted codewords from the received MIMO signals) is computationally infeasible. As a practical measure, the current model-based MIMO receivers all use suboptimal MIMO decoding methods with affordable computational complexities. This work applies the latest advances in deep learning for the design of MIMO receivers. In particular, we leverage deep neural networks (DNN) with supervised training to solve the joint MIMO detection and channel decoding problem. We show that DNN can be trained to give much better decoding performance than conventional MIMO receivers do. Our simulations show that a DNN implementation consisting of seven hidden layers can outperform conventional model-based linear or iterative receivers. This performance improvement points to a new direction for future MIMO receiver design.

We give an exact mathematical construction of a spacelike order $<$, which is dual to the standard chronological order $\ll$ in the $n$-dimensional Minkowski space $M^n$, a construction that can be extended to any curved spacetime, and we discuss its geometrical as well as its topological implications.

In this paper we present a review of recent developments in AI towards the possibility of an artificial intelligence equals that of human intelligence. AI technology has always shown a stepwise increase in its capacity and complexity. The last step took place several years ago, with the increased progress in deep neural network technology. Each such step goes hand in hand with our understanding of ourselves and our understanding of human cognition. Indeed, AI was always about the question of understanding human nature. AI percolates into our lives, changing our environment. We believe that the next few steps in AI technology, and in our understanding of human behavior, will bring about much more powerful machines, flexible enough to resemble human behavior. In this context, there are two research fields: Artificial Social Intelligence (ASI) and General Artificial Intelligence (AGI). The authors also allude to one of the main challenges for AI, embodied cognition, and explain how it can viewed as an opportunity for further progress in AI research.

This paper presents a novel approach for semantic segmentation of building roof in dense urban environment with Deep Convolution Neural Network (DCNN) using imagery acquired by a Chinese Very High Resolution (VHR) satellite mission, i.e. GaoFen-2 (GF-2). To provide an operational end-to-end work flow for accurate build roof mapping with feature extraction as well as image segmentation, a fully convolutional DCNN with both convolutional and deconvolutional layers is designed to perform the VHR image analysis for labeling pixels. Since the diverse urban patterns and building styles in large areas, sample image data sets of building roof and non-building roof are collected over different metropolitan regions in China. We selected typical cities with dense urban environment in each metropolitan region as study areas for collecting training and test samples. High performance cluster with GPU-mounted workstations is employed to perform the model training and optimization. With the building roof samples collected over different cities, the predictive model with multiple NN layers is developed for building roof labeling. The validation of the building roof map shows that the overall accuracy(OA) and the mean Intersection Over Union( mIOU) of DCNN based segmentation are 94.67%, 0.85 respectively, while CRF-refined segmentation achieved OA of 94.69% and mIOU of 0.83. The results suggest that the proposed approach is a promising solution for building roof mapping with VHR images over large areas across different urban and building patterns. With the operational acquisition of GF2 VHR imagery, it is expected to develop an automated pipeline for operational built-up area monitoring and timely update of building roof map over large areas.

Information theory is widely used in various disciplines, and effective calculation of Shannon mutual information is typically not an easy task for many practical applications, including problems of neural population coding in computational and theoretical neuroscience. Asymptotic formulas based on Fisher information may provide accurate approximations to mutual information but this approach is restricted to continuous variables because the calculation requires derivatives with respect to the encoded variables. In this paper, we consider information-theoretic bounds and approximations based on Kullback-Leibler divergence and Rényi divergence. We propose several information metrics to approximate Shannon mutual information in the context of neural population coding, and these asymptotic formulas hold true for discrete variables as there is no requirement for differentiability. In particular, one of our approximation formulas has consistent performance and good accuracy regardless of whether the encoded variables are discrete or continuous. We performed numerical simulations and confirmed that our approximation formulas were highly accurate for approximating mutual information between the discrete variables or stimuli and the responses of a large neural population. These approximation formulas may potentially bring convenience to the applications of information theory to many practical and theoretical problems.

The present reality about the Nigerian economy calls for investment and development in the non-oil sector. This becomes necessary as a result of fall in the oil price in the global market. This paper examined the Bayesian Vector Autoregression (BVAR) modeling and forecasting of the dynamic interrelationship between Economic growth and revenue from the oil and non-oil sectors in Nigeria. To achieve this, annual data on Gross Domestic Product (GDP), revenue from oil and non-oil sectors were collected from Central Bank of Nigeria (CBN) bulletin, the sample from 1981 to 2008 was used for analysis, while sample from 2009 to 2014 was used for model validation. Six (6) versions of Sims-Zha BVAR models were compared for out-of-sample forecast, the result revealed the superiority of the BVAR6 model over the other BVAR models. Lastly, evidence from the decomposition forecast errors revealed that revenue of oil sector contributed 7.69% to GDP while revenue from non-oil sector contributed 0.12% to GDP in Nigeria. This paper therefore recommended that the present government should encourage investment that is geared toward development in the non-oil sector, of which it has the capacity to improve the Economic growth of the Nigerian economy.

Exact and soliton type solutions have great importance in propagation of surface waves, fluid dynamics, optics, and many other elds of nonlinear sciences. In this study, the explicit and exact soliton type solutions for two space-time fractional Equal- Width (FEW) equations with conformable derivative are procured via the hyperbolic function approach. The wave type solutions are represented in some hyperbolic and trigonometric functions.

This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.

This study employed the Fully Modified Ordinary Least Squares (FMOLS) and the Error Correction Model (ECM) to investigate the long-run and short-run determinants of unemployment rate in Nigeria. To achieve this annual data on unemployment rate, inflation rate, interest rate, exchange rate and population growth from 1981 to 2016 was collected from Central Bank Statistical Bulletins and the World Bank website. The ADF test revealed that the macroeconomic variables are stationary at first difference while the Cointegration test revealed that the variables are cointegrated. Using unemployment rate as dependent variable, the FMOLS model revealed that exchange rate and population growth are positively significantly related to unemployment rate, interest rate and inflation rate were negatively related to unemployment rate but only interest rate was significant. The short run relationship revealed that the coefficient of the ecm(-1) is negative and statistically significant at 5% level indicating that the system corrects its previous period disequilibrium at the speed of 48.93% yearly. This study concludes that high exchange rate and population growth can lead to increase in unemployment rate in Nigeria while the government should develop the industrial sector and non-oil sector in order to generate employment and boost export in Nigeria.

DGJ (Daftardar-Gejii-Jafaris) method is used to obtain numerical solution of the third order fractional differential equation. Providing the DGJ method converges, the approximate solution is a good and effective numerical result which is close to the exact solution or the exact solution. For this,the examples of the explaning the method are presented. The proposed method is implemented for the approximation solution of the third order nonlinear fractional partial differential equations. The method was shown to be unsuitable and inconsistent for an example of a nonlinear fractional partial differential equation depend on initial-boundary value conditions. The fact that these numerical results are not consistent can be explained by the fact that the method is not convergent.

The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

Recent state-of-the-art scene text recognition methods have primarily focused on horizontal text in images. However, in several Asian countries, including China, large amounts of text in signs, books, and TV commercials are vertically directed. Because the horizontal and vertical texts exhibit different characteristics, developing an algorithm that can simultaneously recognize both types of text in real environments is necessary. To address this problem, we adopted the direction encoding mask (DEM) and selective attention network (SAN) methods based on supervised learning. DEM contains directional information to compensate in cases that lack text direction; therefore, our network is trained using this information to handle the vertical text. The SAN method is designed to work individually for both types of text. To train the network to recognize both types of text and to evaluate the effectiveness of the designed model, we prepared a new synthetic vertical text dataset and collected an actual vertical text dataset (VTD142) from the Web. Using these datasets, we proved that our proposed model can accurately recognize both vertical and horizontal text and can achieve state-of-the-art results in experiments using benchmark datasets, including the street view test (SVT), IIIT-5k, and ICDAR. Although our model is relatively simple as compared to its predecessors, it maintains the accuracy and is trained in an end-to-end manner.

In this paper, we propose a novel approach of video skimming by exploiting the fusion of video temporal information and keyword information representation extracted from multi-model video information including audio, text and visual indices. In addition, we introduce the brand-safe filtering and sentiment analysis in order to only reserve the user-friendly content in the video skim. In the experiment by using the videos from YouTube-8M dataset, we have proved that the semantic conservation in the video skim from the proposed approach highly outperforms the approaches by only partial  information of the video in conserving the semantic content of the video.

VANET networks are a class of peer-to-peer wireless networks that are used to organize communication between cars (V2V), cars and infrastructure (V2I) and between cars and other types of nodes (V2X). These networks are based on the DSRC, 802.11 standards and are mainly intended for organizing the exchange of various types of messages, mainly emergency ones, to prevent road accidents or alert when road accident occur, or control the priority of the driveway. Initially it was assumed that cars would only interact with each other, but later, with the advent of the concept of Internet of things (IoT). Researchers began to analyze connectivity with other devices, which in general will allow to combine various road users and other devices that can used in the creation of intelligent transport infrastructure in a single smart city management system. Infrastructure is necessary for the provision of services, monitoring and management of the VANET network. As infrastructure objects it is proposed to use stationary objects of Roadside unit (RSU). The aim of this paper is to analyze the use of mobile edge computing to decrease the load to the base station and latency between RSU clouds and provide a real experiment using software defined networking and mobile edge computing for RSU.

In this paper, we propose the set-membership quaternion normalized least-mean-square (SM-QNLMS) algorithm. For this purpose, first, we review the quaternion least-mean-square (QLMS) algorithm, then go into the quaternion normalized least-mean-square (QNLMS) algorithm. By having the QNLMS algorithm, we propose the SM-QNLMS algorithm in order to reduce the update rate of the QNLMS algorithm and avoid updating the system parameters when there is not enough innovation in upcoming data. Moreover, the SM-QNLMS algorithm, thanks to the time-varying step-size, has higher convergence rate as compared to the QNLMS algorithm. Finally, the proposed algorithm is utilized in wind profile prediction and quaternionic adaptive beamforming. The simulation results demonstrate that the SM-QNLMS algorithm outperforms the QNLMS algorithm and it has higher convergence speed and lower update rate.

Identifying group movement patterns of crowds and understanding group behaviors is valuable for urban planners, especially when the groups are special such as tourist groups. In this paper, we present a framework to discover tourist groups and investigate the tourist behaviors using mobile phone call detail records (CDRs). Unlike GPS data, CDRs are relatively poor in spatial resolution with low sampling rates, which makes it a big challenge to identify group members from thousands of tourists. Moreover, since touristic trips are not on a regular basis, no historical data of the specific group can be used to reduce the uncertainty of trajectories. To address such challenges, we propose a method called group movement pattern mining based on similarity (GMPMS) to discover tourist groups. To avoid large amounts of trajectory similarity measurements, snapshots of the trajectories are firstly generated to extract candidate groups containing co-occurring tourists. Then, considering that different groups may follow the same itineraries, additional traveling behavioral features are defined to identify the group members. Finally, with Hainan province as an example, we provide a number of interesting insights of travel behaviors of group tours as well as individual tours, which will be helpful for tourism planning and management.

The paper is devoted to the investigation of regional observability with constraints on the state of semilinear parabolic systems. The purpose is to reconstruct the initial state between two prescribed functions only on an internal subregion $\omega$ of the system evolution domain $\Omega$. The proofs use two approaches, the subdifferential and HUM approach. Finally, a numerical example is provided to verify the effectiveness of our theory results.

Total Nigeria Plc is a Marketing and Services subsidiary of Total; a multinational energy company operating in more than 130 countries and committed to providing sustainable products and services for its customers. For over 50 years, Total Nigeria  Plc  has  remained  the  leader  in  the  downstream  sector  of  the  Nigerian  oil  and  gas  industry. This study investigated the volatility of the stock price of Total Petroleum Nigeria plc using nine (9) GARCH models namely sGARCH, gjrGARCH, eGARCH, iGARCH, aPARCH, TGARCH, NGARCH, NAGARCH and AVGARCH. We also investigated the Value-at-Risk (VaR) and Backtesting of the Models. The aim actually of this study is to boost the confidence of the shareholders and investors of the Total Nigeria plc. To achieve this, daily stock price for Total petroleum Nigeria plc from secondary was collected from January 2^nd 2001 to May 8^th 2017. . The study used both normal and student t innovations, using Akaike Information Criterion (AIC) to select the best model, for normal innovations for log returns and cleansed log returns of Total plc, the eGARCH and sGARCH models performed best respectively, while NGARCH model performed best for student t innovation for both log returns and cleansed returns of Total plc. The persistence of the models are stable except in few cases where iGARCH, eGARCH where not stable. Also for student t innovation, the sGARCH and gjrGARCH fails to converge. The mean-reverting number of day for the returns of Total Nigeria plc differs from model to model. Evidence from the VaR Analysis revealed from the selected models revealed that the Risk of VaR losses is high at 99% confidence level, slightly high at 95% confidence level and better at 90% confidence level. Although The Duration-Based Tests of independence conducted revealed that the models are correctly specified since in all cases the null hypotheses were accepted. This means that the probability of an exception on any day did not depends on the outcome of the previous day. Finally, both the unconditional (Kupiec) and conditional (Christoffersen) coverage tests for the correct number of exceedances for both Total stock returns and cleansed returns. The tests revealed rejection of the models at 1% level of significance. This confirms that unconditional (Kupiec) and conditional (Christoffersen) coverage tests for the correct number of exceedances are reliable compared to the Duration-Based Tests of independence. Therefore we recommend that shareholders and investors in Total Nigeria plc are to remain and continue to investment in Total Nigeria plc because if there is any form of losses, the price of the stock has the potentials to improve in the future. Again, though the risk is high at 99% confidence level, this in line with the financial theory that states that an asset with high expected risk would pay higher return on the average.

A new approach is presented to defining the amount of information, in which information is understood as the data about a finite set as a whole, whereas the average length of an integrative code of elements serves as a measure of information. We obtain a formula for the syntropy of reflection, that is, the information that two intersecting finite sets reflect about each other. The specificities of reflection of discrete systems through the combination of their parts are considered, and it is shown that the additive syntropy and entropy of reflection are measures of structural order and chaos. Three information laws have been established: the law of conservation of the sum of chaos and order; information law of reflection; the law of conservation and transformation of information. An assessment of the structural organization and the level of development of discrete systems is presented. It is shown that various measures of information are structural characteristics of integrative codes of elements of discrete systems. The conclusion is made that, from the informational-genetic positions, the synergetic theory of information is primary in relation to the Hartley-Shannon information theory. In the appendix we consider the asymmetry of the mutual reflection of finite sets and the proportionality of arbitrary quantities.

Due to an increase in the number of image achieves, Content-Based Image Retrieval (CBIR) has gained attention for research community of computer vision. The image visual contents are represented in a feature space in the form of numerical values that is considered as a feature vector of image. Images belonging to different classes may contain the common visuals and shapes that can result in the closeness of computed feature space of two different images belonging to separate classes. Due to this reason, feature extraction and image representation is selected with appropriate features as it directly affects the performance of image retrieval system. The commonly used visual features are image spatial layout, color, texture and shape. Image feature space is combined to achieve the discriminating ability that is not possible to achieve when the features are used separately. Due to this reason, in this paper, we aim to explore the  low-level feature combination that are based on color and shape features. We selected color moments and color histogram to represent color while shape is represented by using invariant moments. We selected this combination, as these features are reported intuitive, compact and robust for image representation. We evaluated the performance of our proposed research by using the Corel, Coil and Ground Truth (GT) image datasets. We evaluated the proposed low-level feature fusion by calculating the precision, recall and time required for feature extraction. The precision, recall and feature extraction values obtained from the proposed low-level feature fusion outperforms the existing research of CBIR.

The interpretation of land use and land cover (LULC) is an important issue in the fields of high-resolution remote sensing (RS) image processing and land resource management. Fully training a new or existing convolutional neural network (CNN) architecture for LULC classification requires a large amount of remote sensing images. Thus, fine-tuning a pre-trained CNN for LULC detection is required. To improve the classification accuracy for high resolution remote sensing images, it is necessary to use another feature descriptor and to adopt a classifier for post-processing. A fully connected conditional random fields (FC-CRF), to use the fine-tuned CNN layers, spectral features, and fully connected pairwise potentials, is proposed for image classification of high-resolution remote sensing images. First, an existing CNN model is adopted, and the parameters of CNN are fine-tuned by training datasets. Then, the probabilities of image pixels belong to each class type are calculated. Second, we consider the spectral features and digital surface model (DSM) and combined with a support vector machine (SVM) classifier, the probabilities belong to each LULC class type are determined. Combined with the probabilities achieved by the fine-tuned CNN, new feature descriptors are built. Finally, FC-CRF are introduced to produce the classification results, whereas the unary potentials are achieved by the new feature descriptors and SVM classifier, and the pairwise potentials are achieved by the three-band RS imagery and DSM. Experimental results show that the proposed classification scheme achieves good performance when the total accuracy is about 85%.

Hidden markov models are a very useful tool in the modelling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden markov model to analyze the underlying structure of an ancient and complex manuscript, known as Voynich's manuscript, that remains still undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscript we train the network by means of the $\alpha$ and $\beta$-pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices in order to compare with known languages concerning the frequency of consonant and vowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.

The Station logo is a way for a TV station to claim copyright, which can realize the analysis and understanding of the video by the identification of the station logo, so as to ensure that the broadcasted TV signal will not be illegally interfered. In this paper, we design a station logo detection method based on Convolutional Neural Network by the characteristics of the station, such as small scale-to-height ratio change and relatively fixed position. Firstly, in order to realize the preprocessing and feature extraction of the station data, the video samples are collected, filtered, framed, labeled and processed. Then, the training sample data and the test sample data are divided proportionally to train the station detection model. Finally, the sample is tested to evaluate the effect of the training model in practice. The simulation experiments prove its validity.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.

Cognitive neuroscience is the study of how the human brain functions on tasks like decision making, language, perception and reasoning. Deep learning is a class of machine learning algorithms that use neural networks. They are designed to model the responses of neurons in the human brain. Learning can be supervised or unsupervised. Ngram token models are used extensively in language prediction. Ngrams are probabilistic models that are used in predicting the next word or token. They are a statistical model of word sequences or tokens and are called Language Models or Lms. Ngrams are essential in creating language prediction models. We are exploring a broader sandbox ecosystems enabling for AI. Specifically, around Deep learning applications on unstructured content form on the web.

Cryptocurrencies like Bitcoin rely on a proof-of-work system to validate transactions and prevent attacks or double-spending. A new proof-of-work is introduced which seems to be the first number theoretic proof-of-work unrelated to primes: it is based on a new metric associated to the Collatz algorithm whose natural generalization is algorithmically undecidable: the inflation propensity is defined as the cardinality of new maxima in a developing Collatz orbit. It is numerically verified that the distribution of inflation propensity slowly converges to a geometric distribution of parameter $0.714 \approx \frac{(\pi - 1)}{3}$ as the sample size increases. This pseudo-randomness opens the door to a new class of proofs-of-work based on congruential graphs.

This paper has two major parts. In the first part histogram equalization for the image enhancement was implemented without using the built-in function in MATLAB. Here, at first, a color image of a rat was chosen and the image was transformed into a grayscale image. After this conversion, histogram equalization was implemented on the grayscale image. Later on, in the same image for each RGB channel, histogram equalization was implemented to observe the effect of histogram equalization on each channel. In the end, the histogram equalization was implemented to this specific color image of a rat. In the second part, for the grayscale image in part 1, the desired histogram of another colored image of a rat was introduced and histogram specification was implemented on the original colored image.

We show that given a Lie superalgebra and an element of its dual space one can construct the 3-Lie superalgebra. We apply this approach to Lie superalgebra of (m,n)-block matrices taking supertrace of a matrix as the element of dual space. Then we also apply this approach to commutative superalgebra and the Lie superalgebra of its derivations to construct 3-Lie superalgebra. The graded Lie brackets are constructed by means of a derivation and involution of commutative superalgebra, and we use them to construct 3-Lie superalgebras.

It is a common practice to detect outliers in a financial time series in order to avoid the adverse effect of additive outliers. This paper investigated the performance of GARCH family models (sGARCH; gjrGARCH; iGARCH; TGARCH and NGARCH) in the presence of different sizes of outliers (small, medium and large) for different time series lengths (250, 500, 750, 1000, 1250 and 1500)  using root mean square error (RMSE) and mean absolute error (MAE) to adjudge the models. In a simulation iteration of 1000 times in R environment using rugarch package, results revealed that for small size of outliers, irrespective of the length of time series, iGARCH dominated, for medium size of outliers, it was sGARCH and gjrGARCH that dominated irrespective of time series length, while for large size of outliers, irrespective of time series length, gjrGARCH dominated. The study further leveled that in the presence of additive outliers on time series analysis, both RMSE and MAE increased as the time series length increased.

In this paper, we study sums of finite products of Chebyshev polynomials of the first kind and Lucas polynomials and represent each of them in terms of Chebyshev polynomials of all kinds. Here the coefficients involve terminating hypergeometric functions ₂F₁ and these representations are obtained by explicit computations.

A new requirement for the manufacturing companies in Industry 4.0 is to be flexible with respect to changes in demands, requiring them to react rapidly and efficiently on the production capacities. Together with the trend to use Service-Oriented Architectures (SOA), this requirement induces a need for agile collaboration among supply chain partners, but also between different divisions or branches of the same company. In order to address this collaboration challenge, we~propose a novel pragmatic approach for the process analysis, implementation and execution. This~is achieved through sets of semantic annotations of business process models encoded into BPMN 2.0 extensions. Building blocks for such manufacturing processes are the individual available services, which are also semantically annotated according to the Everything-as-a-Service (XaaS) principles and stored into a common marketplace. The optimization of such manufacturing processes combines pattern-based semantic composition of services with their non-functional aspects. This is achieved by means of Quality-of-Service (QoS)-based Constraint Optimization Problem (COP) solving, resulting in an automatic implementation of service-based manufacturing processes. The produced solution is mapped back to the BPMN 2.0 standard formalism by means of the introduced extension elements, fully detailing the enactable optimal process service plan produced. This approach allows enacting a process instance, using just-in-time service leasing, allocation of resources and dynamic replanning in the case of failures. This proposition provides the best compromise between external visibility, control and flexibility. In this way, it provides an optimal approach for business process models' implementation, with a full service-oriented taste, by implementing user-defined QoS metrics, just-in-time execution and basic dynamic repairing capabilities. This paper presents the described approach and the technical architecture and depicts one initial industrial application in the manufacturing domain of aluminum forging for bicycle hull body forming, where the advantages stemming from the main capabilities of this approach are sketched.

Consider a uniquely ergodic $C^*$-dynamical system ba\-sed on a unital $*$-endomorphism $\Phi$ of a $C^*$-algebra. We prove the uniform convergence of Cesaro averages $\frac1{n}\sum_{k=0}^{n-1}\lambda^{-n}\Phi(a)$ for all values $\lambda$ in the unit circle which are not eigenvalues corresponding to "measurable non continuous" eigenfunctions. This result generalises the analogous one in commutative ergodic theory presented in [19], which turns out to be a combination of the Wiener-Wintner Theorem (cf. [22]) and the uniformly convergent ergodic theorem of Krylov and Bogolioubov (cf. [15]).

In previous studies we used Laurent Schwartz’ theory of distributions to rigorously introduce discretizations and periodizations on tempered distributions. These results are now used in this study to derive a validity statement for four interlinking formulas. They are variants of Poisson’s Summation Formula and connect four commonly defined Fourier transforms to one another, the integral Fourier transform, the Discrete-Time Fourier Transform (DTFT), the Discrete Fourier Transform (DFT) and the Integral Fourier transform for periodic functions—used to analyze Fourier series. We prove that under certain conditions, these four Fourier transforms become particular cases of the Fourier transform in the tempered distributions sense. We first derive four interlinking formulas from four definitions of the Fourier transform pure symbolically. Then, using our previous results, we specify three conditions for the validity of these formulas in the tempered distributions sense.

This paper proposes a method for recognizing audio events in urban environments that combines handcrafted audio features with a deep learning architectural scheme (Convolutional Neural Networks, CNNs), which has been trained to distinguish between different audio context classes. The core idea is to use the CNNs as a method to extract context-aware deep audio features that can offer supplementary feature representations to any soundscape analysis classification task. Towards this end, the CNN is trained on a database of audio samples which are annotated in terms of their respective "scene" (e.g. train, street, park), and then it is combined with handcrafted audio features in an early fusion approach, in order to recognize the audio event of an unknown audio recording. Detailed experimentation proves that the proposed context-aware deep learning scheme, when combined with the typical handcrafted features, leads to a significant performance boosting in terms of classification accuracy. The main contribution of this work is the demonstration that transferring audio contextual knowledge using CNNs as feature extractors can significantly improve the performance of the audio classifier, without need for CNN training (a rather demanding process that requires huge datasets and complex data augmentation procedures).

By generalizing the notion of pointwise 1-type Gauss map, the generalized 1-type Gauss map has been recently introduced. Without any assumption, we classified all possible ruled surfaces with generalized 1-type Gauss map in a 3-dimensional Minkowski space. In particular, null scrolls do not have the proper generalized 1-type Gauss map. In fact, it is harmonic.

In this paper, Lie symmetry and Painlevé Techniques are applied to the SIRD (Susceptible, Infected, Recovered and Dead) model. A demonstration of the integrability of the model is provided to present an exact solution. The study revealed that nonlinear system passes Painlevé test and does not possesses complex chaotic behaviour. However, the system fails to pass the Painlevé test while constraints reach values equivalent to the corresponding complex chaotic behaviour. The two-dimensional Lie symmetry algebra and the commutator table of the infinitesimal generators are obtained. Lie symmetry analysis serves to linearize the nonlinear system and find the corresponding invariant solution.

The goal of VAR or BVAR is the characterization of the dynamics and endogenous relationships among time series. Also the VAR models are known for their applications to forecasting and policy analysis. This paper compare the performance of VAR and Sims-Zha Bayesian VAR models when the multiple time series are jointly influenced by different levels of collinearity and autocorrelation in the short term (T=16, 32, 64 and 128). Five levels (-0.9,-0.5, 0,+0.5,+0.9) of collinearity and autocorrelation were considered and the results from the simulation study revealed that VAR(2) model dominated for no and moderate levels of autocorrelation (-0.5, 0, +0.5) irrespective of the collinearity level except in few cases when T=16. While the BVAR models dominated for high autocorrelation levels (-0.9 and +0.9) irrespective of the collinearity level except in few cases when T=128. The performance of the models varies at different levels of the collinearity and autocorrelated error, and also varies with the short term periods. Furthermore, the values of the RMSE and MAE criteria decrease as a result of increase in the time series length. In conclusion, the performance of the forecasting models depend on the time series data structure and the time series length. It is therefore recommended that the data structure and series length should be considered in using an appropriate model for forecasting.

The digital society is an outcome of the Internet which has nearly made everything connected and accessible no matter where or when. Nevertheless, despite the fact that conventional IP networks are complicated and very hard to manage, they are still widely adopted. The already established policies make the network configuration/reconfiguration a complex process that reacts to errors, load, and modifications. The prevailing networks are vertically integrated which makes things more and more complicated: Data planes and control are strapped together. Software-defined networking is a model that is meant to solve this issue by splitting the vertical integration and detaching the network’s control logic from the implicit routers and switches; this could be achieved by reinforcing centralization of network control and making the network programmable. In this work, we worked to implement MPLS networks with SDN, to enhance the traffic engineering over the network, and to minimize the network delay and latency, with minimum cost using three of the different SDN networks. The experiment results showed the advantage of the proposed approach for reducing the network delay, comparing with previous studies. Where the average of network delay in our approach reaches to 3.01 milliseconds.

Based on previous research results, we propose a new preprocessing HSS iteration method (PHSS) for the generalized Lyapunov equation. At the same time, the corresponding inexact PHSS algorithm (IPHSS) is given from the angle of application. All the new methods presented in this paper have given the corresponding convergence proof. The numerical experiments are carried out to compare the new method with the existing methods, and the improvement effect is obvious. The feasibility and effectiveness of the proposed method are proved from two aspects of theory and calculation.

This is the fourth part of [6] on the existence of K¨ahler Einstein metrics of the general type I almost homogeneous manifolds of cohomogeneity one. We actually carry out all the results in [8] to the type I cases. In part II [14], we obtained a lot of new K¨ahler-Einstein manifolds as well as Fano manifolds without K¨ahler-Einstein metrics. In particular, by applying Theorem 15 therein, we have complete results in the Theorems 3 and 4 in that paper. However, we only have some partial results in Theorem 5 there. In this note, we shall give a report of recent progress on the Fano manifolds Nn,m when n > 15 and N′n,m when n > 4. We actually give two nice pictures for these two classes of manifolds. See our Theorems 1 and 2 in the last section. Moreover, we post two conjectures. Once we could solve these two conjectures, the question for these two classes of manifolds would be completely solved. With applying our results to the canonical circle bundles we also obtain Sasakian manifolds with or without Sasakian-Einstein metrics. That also give some open Calabi-Yau manifolds.

Software defect prediction is an important means to guarantee software quality. Because there are no sufficient historical data within a project to train the classifier, cross-project defect prediction (CPDP) has been recognized as a fundamental approach.  However, traditional defect prediction methods using feature attributes to represent samples, which can not avoid negative transferring, may result in poor performance model in CPDP. This paper proposes a multi-source cross-project defect prediction method based on dissimilarity space ( DM-CPDP). This method first uses the density-based clustering method to construct the prototype set with the cluster center of samples in the target set. Then, the arc-cosine kernel is used to form the dissimilarity space, and in this space the training set is obtained with the earth mover’s distance (EMD) method. For the unlabeled samples converted from the target set, the KNN algorithm is used to label those samples. Finally, we use TrAdaBoost method to establish the prediction model.  The experimental results show that our approach has better performance than other traditional CPDP methods.