Search

Due to the fact that many classical numerical methods have not yet mature quantum counterparts, quantum circuit design is very important in quantum image processing. In this paper, using the novel enhanced quantum representation (NEQR) model, an image encryption algorithm based on Feistel structure is carried out in quantum computer by giving the encryption quantum circuits. First, the modified Feistel structure for image encryption is proposed. It is a 128-bit block cipher and requires 16-bit subkeys to encrypt the image, and it is a mixture of Feistel and substitution–permutation network; then, the detailed quantum circuits design of the encryption algorithm are given. Through numerical simulation and analysis, it is verified that the proposed quantum image encryption algorithm is effective and can resist statistical attacks effectively. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive generalised function projective synchronisation scheme of fractional-order chaotic systems with different dimensions and orders and fully unknown parameters is presented. On the basis of the Lyapunov method of fractional-order systems, a stability theorem of the fractional-order system with non-identical orders is proven. Using the fractional-order controller and adaptive control theory, sufficient conditions for synchronisation and unknown parameters update rules are obtained. Theoretical analysis and numerical simulations are provided to verify the validity of the proposed scheme. Moreover, synchronisation results are applied to secure communication via modified chaotic masking (MCM) method. The unpredictability of the scaling function matrix and the use of fractional-order systems with different orders can increase the security of the cryptosystem. The security analysis shows that the introduced algorithm has large key space, high sensitivity to encryption keys, higher security and the acceptable encryption speed. [ABSTRACT FROM AUTHOR]

• The improved PSO was employed to calibrating the micro-parameters. • Different combinations of micro-parameters of DEM model can be obtained. • More macro-parameters should be used to calibrate the micro-parameters of DEM model. The discrete element method (DEM) is commonly used for simulating the mechanical characteristics of rock materials; however, constructing a DEM model requires the specification of a number of microparameters. In this paper, to obtain the microparameters of the DEM model, the improved particle swarm optimization (PSO) calibration method was presented. Based on numerical simulation examples, the new approach is considered valid for calibrating the microparameters of the DEM model. Moreover, it is concluded that different sets of microparameters can be determined when few macroparameters are used, which indicates that the empirical formula between microparameters and macroparameters is not reliable. From the analysis of the numerical simulation results, it is suggested that more macroparameters should be used to calibrate the microparameters of the DEM model, and the corresponding numerical simulation results could be more reliable; otherwise, the generated numerical model may not accurately simulate the mechanical characteristics of rock materials. [ABSTRACT FROM AUTHOR]

This study deals with a narrow escape problem, a well-know difficult problem of evaluating the probability for a diffusing particle to reach a small part of a boundary far away from the starting position of the particle. A direct simulation of the diffusion trajectories would take an enormous computer simulation time. Instead, we use a different approach which drastically improves the efficiency of the diffusion trajectory tracking algorithm by introducing an artificial drift velocity directed to the target position. The method can be efficiently applied to solve narrow escape problems for domains of long extension in one direction which is the case in many practical problems in biology and chemistry. The algorithm is meshless both in space and time, and is well applied to solve high-dimensional problems in complicated domains. We present in this paper a detailed numerical analysis of the method for the case of a rectangular parallelepiped. Both stationary and transient diffusion problems are handled. [ABSTRACT FROM AUTHOR]

This paper is devoted to the terrain aided navigation (TAN) systems based on the state estimation algorithms. In particular, the emphasis is laid on the design of the Bayesian Rao–Blackwellized point-mass filter for nonlinear state-space models of a specific structure typically used in the terrain aided navigation. The proposed filter preserves advantages of the point-mass filter, including the high estimation accuracy, robust initialization, deterministic nature of the algorithm, and predictable computational complexity, while the computational complexity is significantly reduced. The performance of the Rao–Blackwellized point-mass filter is illustrated using a simulated numerical example and a TAN system based on the real data. [ABSTRACT FROM AUTHOR]

According to the application of range-free localization technology for wireless sensor networks (WSNs), an improved localization algorithm based on iterative centroid estimation is proposed in this paper. With this methodology, the centroid coordinate of the space enclosed by connected anchor nodes and the received signal strength indication (RSSI) between the unknown node and the centroid are calculated. Then, the centroid is used as a virtual anchor node. It is proven that there is at least one connected anchor node whose distance from the unknown node must be farther than the virtual anchor node. Hence, in order to reduce the space enclosed by connected anchor nodes and improve the location precision, the anchor node with the weakest RSSI is replaced by this virtual anchor node. By applying this procedure repeatedly, the localization algorithm can achieve a good accuracy. Observing from the simulation results, the proposed algorithm has strong robustness and can achieve an ideal performance of localization precision and coverage. [ABSTRACT FROM AUTHOR]

Plant-wide oscillation detection is an important task in the maintenance of large-scale industrial control systems, owing to the fact that in an interactive multi-loop environment oscillation generated in one loop may propagate to the different parts of the plant. In such a scenario, it is required that different loops oscillating due to a common cause and hence similar frequency may be grouped together. In this paper an adaptive method for plant-wide oscillation detection based on multivariate empirical mode decomposition (MEMD) along with a grouping algorithm is proposed. The method can identify multiple oscillation groups among different variables as well as variables with random noise only. The proposed method is also applicable to both non-linear and non-stationary time series where the techniques based on the conventional Fourier analysis are prone to errors. Within each group that oscillate due to a common cause, the method can also indicate the location of the probable root cause of oscillations. The efficacy of the proposed method is established with the help of both simulation and industrial case studies. [ABSTRACT FROM AUTHOR]

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. [ABSTRACT FROM AUTHOR]

Recommender systems use algorithms to provide users with product or service recommendations. Recently, these systems have been using machine learning algorithms from the field of artificial intelligence. However, choosing a suitable machine learning algorithm for a recommender system is difficult because of the number of algorithms described in the literature. Researchers and practitioners developing recommender systems are left with little information about the current approaches in algorithm usage. Moreover, the development of recommender systems using machine learning algorithms often faces problems and raises questions that must be resolved. This paper presents a systematic review of the literature that analyzes the use of machine learning algorithms in recommender systems and identifies new research opportunities. The goals of this study are to (i) identify trends in the use or research of machine learning algorithms in recommender systems; (ii) identify open questions in the use or research of machine learning algorithms; and (iii) assist new researchers to position new research activity in this domain appropriately. The results of this study identify existing classes of recommender systems, characterize adopted machine learning approaches, discuss the use of big data technologies, identify types of machine learning algorithms and their application domains, and analyzes both main and alternative performance metrics. [ABSTRACT FROM AUTHOR]

In string photovoltaic (PV) systems, the power–voltage (P–V) characteristic under partial shading conditions (PSC) displays multiple peaks requiring global maximum power point (GMPP) tracking (GMPPT) algorithms to identify the PV array GMPP. Several GMPPT algorithms scan wide voltage tracks to detect the GMPP, even larger than a P–V curve full scan. Moreover, many algorithms have been tested only for simple PSC that lead to three well distinct peaks at most. This paper initially presents a trapezoidal area, called the maximum power trapezium (MPT), in the P–V plane that contains all possible GMPPs for any PSC. Using the MPT and information about the minimum voltage difference between adjacent local peaks, a GMPPT algorithm is proposed, which tracks the GMPP of a string PV array under any severe PSC reducing its voltage track and so its tracking time. Simulation and experimental results show the superior performance of the proposed algorithm, in comparison to the state-of-art algorithms, in terms of tracking time, energy loss, and total voltage track during the search for the GMPP. [ABSTRACT FROM AUTHOR]

The block inverse iteration and block Newton’s methods proposed by the authors of this paper for computing invariant pairs of regular linear matrix pencils are generalized to the case of regular nonlinear matrix pencils. Numerical properties of the proposed methods are demonstrated with a typical quadratic eigenproblem. [ABSTRACT FROM AUTHOR]

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k− γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks). [ABSTRACT FROM AUTHOR]

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided. [ABSTRACT FROM AUTHOR]

In this paper, we consider performance analysis of the decentralized power method for the eigendecomposition of the sample covariance matrix based on the averaging consensus protocol. An analytical expression of the second order statistics of the eigenvectors obtained from the decentralized power method, which is required for computing the mean square error (MSE) of subspace-based estimators, is presented. We show that the decentralized power method is not an asymptotically consistent estimator of the eigenvectors of the true measurement covariance matrix unless the averaging consensus protocol is carried out over an infinitely large number of iterations. Moreover, we introduce the decentralized ESPRIT algorithm which yields fully decentralized direction-of-arrival (DOA) estimates. Based on the performance analysis of the decentralized power method, we derive an analytical expression of the MSE of DOA estimators using the decentralized ESPRIT algorithm. The validity of our asymptotic results is demonstrated by simulations. [ABSTRACT FROM PUBLISHER]

The construction of highly incoherent frames, sequences of vectors placed on the unit hyper sphere of a finite dimensional Hilbert space with low correlation between them, has proven very difficult. Algorithms proposed in the past have focused on minimizing the absolute value off-diagonal entries of the Gram matrix of these structures. Recently, a method based on convex optimization that operates directly on the vectors of the frame has been shown to produce promising results. This paper gives a detailed analysis of the optimization problem at the heart of this approach and, based on these insights, proposes a new method that substantially outperforms the initial approach and all current methods in the literature for all types of frames, with low and high redundancy. We give extensive experimental results that show the effectiveness of the proposed method and its application to optimized compressed sensing. [ABSTRACT FROM PUBLISHER]

In this paper, an optimal unbiased finite impulse response (OUFIR) filter is proposed as a linking solution between the unbiased FIR (UFIR) filter and the Kalman filter (KF). We first derive the batch OUFIR estimator to minimize the mean square error (MSE) subject to the unbiasedness constraint and then find its fast iterative form. It is shown that the OUFIR filter is full horizon (FH) and that its estimate converges to the KF estimate by increasing the horizon length N. As a special feature, we note that the FH OUFIR filter operates almost as fast as the KF. Several other critical properties of the OUFIR filter are illustrated based on simulations and practical applications. Similar to the UFIR filter, and contrary to the KF, the OUFIR filter is highly insensitive to the initial conditions. It has much better robustness than KF against temporary model uncertainties. Finally, the OUFIR filter allows for ignoring system noise, which is typically not well known to the engineer. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the coupling of reduced models for the simulation of structures involving localized geometrical details. Herein, we use the Arlequin method, originally designed to deal with multimodel and multiscale analyses of mechanical problems, to mix reduced models built using the proper generalized decomposition. Instead of solving the global coupled problem in a monolithic way, the LATIN strategy is used to propose a decoupled algorithm. The numerical examples demonstrate the feasibility of the approach and in particular its potentiality in terms of flexibility. [ABSTRACT FROM AUTHOR]

This paper presents a mesoscale analysis approach to investigate the dynamic response of the sand particulate system. Firstly, a 3D mesoscopic model is developed considering the randomness of sand particles in shape and distribution. Secondly, we put forward an analysis approach to model the mechanical behavior of dry sand under static and dynamic loadings. Simulations are conducted to validate the numerical model and the analysis approach. A good agreement is attained comparing with test data. The presented 3D model can realistically model the grain-level response of the dry sand particulate system under high strain rate loadings. Finally, applications are carried out in the domain of projectile penetration into the sand particulate system. The contact and friction between sand particles are taken into account using the contact algorithm. The effects of mesoscopic configurations (porosity, particle size, contact and friction coefficients) of the specimen are discussed numerically. Simulations focusing on the stress wave propagation, projectile penetration depth and instability are conducted. Results show that impact velocity of projectile is also an important factor for penetration behavior. Porosity, particle size and friction coefficients affect ballistic instability significantly. [ABSTRACT FROM AUTHOR]

In this paper, we present numerical and experimental study on beam steering with liquid-crystal optical phased array (LC-OPA) by means of stochastic parallel gradient descent (SPGD) algorithm. The numerical simulation, which is mainly based on the evolution of power-in-bucket (PIB), indicates that the beam steering strategy with LC-OPA is relatively robust, and the algorithm performs well most of the time. The results also reveal that the performance of SPGD algorithm is influenced by the order of Zernike polynomials, the radius of bucket and the steering angle. The order of Zernike polynomials and the radius of bucket are optimized to improve the accuracy and convergence of the algorithm. In a proof-of-concept experiment, the feasibility of the beam steering strategy with LC-OPA is demonstrated. [ABSTRACT FROM AUTHOR]

In this paper, an optimal nonlinear feedback guidance algorithm with complex state and control constraints is developed for Mars powered decent. The analysis of the optimal control problem for Mars powered descent is undertaken firstly. Then based on the real-time sampling optimal feedback control theory, the Mars powered descent guidance (PDG) algorithm is designed and analysed. A practical method is also proposed to solve the problem of the initialization of the PDG algorithm. Numerical simulations are performed to evaluate the effectiveness of the proposed PDG algorithm. The effects of the sampling period and the prediction errors on landing errors are studied in the numerical simulations. The fuel consumption performances of the proposed PDG algorithm and the Apollo guidance algorithm are also studied and compared. The simulation results show that the less fuel consumption is obtained with the proposed PDG algorithm. Monte Carlo simulation verifies the high landing precision of the proposed PDG algorithm. [ABSTRACT FROM AUTHOR]

Markov chain Monte Carlo methods (MCMC) are essential tools for solving many modern-day statistical and computational problems; however, a major limitation is the inherently sequential nature of these algorithms. In this paper, we propose a natural generalization of the Metropolis-Hastings algorithm that allows for parallelizing a single chain using existing MCMC methods. We do so by proposing multiple points in parallel, then constructing and sampling from a finite-state Markov chain on the proposed points such that the overall procedure has the correct target density as its stationary distribution. Our approach is generally applicable and straightforward to implement. We demonstrate how this construction may be used to greatly increase the computational speed and statistical efficiency of a variety of existing MCMC methods, including Metropolis-Adjusted Langevin Algorithms and Adaptive MCMC. Furthermore, we show how it allows for a principled way of using every integration step within Hamiltonian Monte Carlo methods; our approach increases robustness to the choice of algorithmic parameters and results in increased accuracy of Monte Carlo estimates with little extra computational cost. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we design and analyze a Newton-like blind equalization algorithm for the APSK system. Specifically, we exploit the principle of minimum entropy deconvolution and derive a blind equalization cost function for APSK signals and optimize it using Newton׳s method. We study and evaluate the steady-state excess mean square error performance of the proposed algorithm using the concept of energy conservation. Numerical results depict a significant performance enhancement for the proposed scheme over well established blind equalization algorithms. Further, the analytical excess mean square error of the proposed algorithm is verified with computer simulations and is found to be in good conformation. [Copyright &y& Elsevier]

As a symmetric encryption algorithm, multiple-parameter fractional Fourier transform (MPFRFT) is proposed and applied to image encryption. The MPFRFT with two vector parameters has better security, which becomes the main technical means to protect information security. However, our study found that many keys of the MPFRFT are invalid, which greatly reduces its security. In this paper, we propose a new reformulation of MPFRFT and analyze it using eigen-decomposition-type fractional Fourier transform (FRFT) and weighted-type FRFT as basis functions, respectively. The results show that the effective keys are extremely limited. Furthermore, we analyze the extended encryption methods based on MPFRFT, which also have the security risk of key invalidation. Theoretical analysis and numerical simulation verify our point of view. Our discovery has important reference value for a class of generalized FRFT image encryption methods. [ABSTRACT FROM AUTHOR]

The phenomenon of self-locking can be found in many technical applications and common machine parts, such as screws, chocks, and funnels. Despite this, research into this topic is mostly limited to specific applications (e.g., worm gears, screws, kinematic chains). Current works with a general scope are rare. This paper addresses the analysis of self-locking in different, two-dimensional, multibody systems, and shall contribute towards a more general analysis. To elaborate on the characteristics of self-locking, the effect is first shown and explained using simple systems as examples. From these examples, an approach towards a generalized description of self-locking is proposed, which is used as a foundation for the development of two identification methods. The analysis of the self-locking mechanism in multibody systems is realized first through an analytical ansatz, and then using a numerical simulation of the examples shown. The analytical and numerical analyses of the systems deliver a criterion, and respectively an algorithm, which enables the identification of self-locked assemblies in different systems of multiple bodies. The algorithm is designed to identify self-locking during integration of the equations of motion, whereas the analytic criterion is formulated for static systems with known, increasing external loads. The results of the two analysis methods correspond very well for the given example systems, leading to the conclusion that both methods are equivalent and usable. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) [ABSTRACT FROM AUTHOR]