Search

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 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]

Abstract: In the framework of dependent risks it is a crucial task for risk management purposes to quantify the probability that the aggregated risk exceeds some large value . Motivated by Asmussen et al. (2011) [1] in this paper we introduce a modified Asmussen–Kroese estimator for simulation of the rare event that the aggregated risk exceeds . We show that in the framework of log-Gaussian risks our novel estimator has the best possible performance i.e., it has asymptotically vanishing relative error. For the more general class of log-elliptical risks with marginal distributions in the Gumbel max-domain of attraction we propose a modified Rojas-Nandayapa estimator of the rare events of interest, which for specific importance sampling densities has a good logarithmic performance. Our numerical results presented in this paper demonstrate the excellent performance of our novel Asmussen–Kroese algorithm. [Copyright &y& Elsevier]

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]

SUMMARY In this paper, we introduce the so-called symplectic discrete singular convolution differentiator (SDSCD) method for structure-preserving modelling of elastic waves. In the method presented, physical space is discretized by the DSCD, whereas an explicit third-order symplectic scheme is used for the time discretization. This approach uses optimization and truncation to form a localized operator. This preserves the fine structure of the wavefield in complex media and avoids non-causal interaction when parameter discontinuities are present in the medium. Theoretically, the approach presented is a structure-preserving algorithm. Also, some numerical experiments are shown in this paper. Elastic wavefield modelling experiments on a laterally heterogeneous medium with high parameter contrasts demonstrate the superior performance of the SDSCD for suppression of numerical dispersion. Long-term computational experiments exhibit the remarkable capability of the approach presented for long-time simulations. Promising numerical results suggest the SDSCD is suitable for high-precision and long-time numerical simulations, as it has structure-preserving property and it can suppress effectively numerical dispersion when coarse grids are used. [ABSTRACT FROM AUTHOR]

Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Optimal joint bandwidth and power allocation strategies for wireless multi-user networks with and without relaying are proposed in this paper for 1) the maximization of the sum capacity of all users; 2) the maximization of the worst user capacity; and 3) the minimization of the total power consumption of all users. It is shown that the proposed allocation problems are convex and, therefore, can be solved efficiently. Moreover, joint bandwidth and power allocation for admission control is considered. A suboptimal greedy search algorithm is developed to solve the admission control problem efficiently. Instructive analysis of the greedy search shows that it can achieve good performance, and the condition under which the greedy search is optimal is derived. The formal and in-depth analysis of the greedy search algorithm presented in this paper can serve as a benchmark for analyzing similar algorithms in other applications. The performance improvements offered by the proposed optimal joint bandwidth and power allocation are demonstrated by simulations. The advantages of the suboptimal greedy search algorithm for admission control are also shown in numerical results. [ABSTRACT FROM PUBLISHER]

Abstract: Lines of curvature are important intrinsic characteristics of a curved surface used in a wide variety of geometric analysis and processing. Although their differential attributes have been examined in detail, their global geometric distribution and topological pattern are very difficult to compute over the whole surface because of umbilical points and unstable numerical computation. No studies have yet been carried out on this problem, especially for an implicit surface. In this paper, we present a scheme for computing and visualizing the lines of curvature defined on an implicit surface. A key structure is introduced, conveying significant structure information about lines of curvature to facilitate their investigation, rather than computing their whole net. Our current framework is confined to a collection of manageable structures, consisting of algorithms to locate some seed umbilical points, to compute the lines of curvature through them, and finally to assemble this structure. The numerical implementations are provided in detail and a novel evaluation function measuring the violation of umbilical points in an implicit surface, i.e. indicating how much a point is to be umbilical, is also presented. This paper is the continuation of [Che, W.J., Paul, J.-C., Zhang, X.P., 2007. Lines of curvature and umbilical points for implicit surfaces. Computer Aided Geometric Design 24 (7), 395–409]. [Copyright &y& Elsevier]

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, 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]

In this paper we propose a numerical procedure for the prediction of capillary forces in polydisperse granular assemblies at a degree of moisture content that corresponds to the so-called pendular regime. The capillary force model is adopted within the Laplace-Young framework with a toroidal approximation of the liquid bridge geometry. Governing equations are first derived in a form that highlights the role of intrinsic parameters such as inter-particle separation distance, ratio of particle radii and liquid volume. A proper scaling of these equations is adopted so that the solution applies to any particle pair configuration. Numerical integration algorithms are provided in a way that facilitates implementations in macroscopic procedures for computer simulations. A qualitative evaluation is undertaken to highlight model predictions of the effects on capillary force of various intrinsic parameters that characterise the particle pair and liquid bridge. The model is validated against the experimental results provided by Willet et al. (Langmuir 16:9396-9405, ) for a wide range of liquid volumes and particle-pair polydispersity. [ABSTRACT FROM AUTHOR]

Abstract: Rapid advances in sensor technology and wireless communications have led to the development of wireless sensor networks (WSNs). However, the sensor nodes in WSNs have a finite lifetime since it is often impractical, or even impossible, to recharge their batteries once they have been deployed. When the energy of a sensor node has been fully consumed, it can play no further role within the WSNs. In an attempt to prolong the lifetime of WSNs, various schemes have been proposed. This paper proposed a lifetime-extension under uniform distribution (LEUD) scheme which not only prolongs the lifetime of WSNs, but also optimizes its performance by maximizing the total number of active regions within the networks. To evaluate the effectiveness of our scheme, we chose three uniform distribution algorithms with LEUD to analyze and compared the performance of our scheme. Numerical simulations are performed which demonstrate that when the deployed sensor nodes have an equal initial energy and are distributed uniformly within the networks, LEUD provides an improved networks performance. [Copyright &y& Elsevier]

In this paper, we present a dynamic refinement algorithm for the smoothed particle Hydrodynamics (SPH) method. An SPH particle is refined by replacing it with smaller daughter particles, which positions are calculated by using a square pattern centered at the position of the refined particle. We determine both the optimal separation and the smoothing distance of the new particles such that the error produced by the refinement in the gradient of the kernel is small and possible numerical instabilities are reduced. We implemented the dynamic refinement procedure into two different models: one for free surface flows, and one for post-failure flow of non-cohesive soil. The results obtained for the test problems indicate that using the dynamic refinement procedure provides a good trade-off between the accuracy and the cost of the simulations. [ABSTRACT FROM AUTHOR]

Abstract: In a numerical simulation using the finite element method, the mesh has to be fine enough to guarantee the accuracy of the solution. However, a uniformly fine mesh will usually imply a more expensive computation. Mesh adaptation offers an effective compromise, combining a fine mesh with a low computational cost. The h-refinement consists in sub-dividing some meshes, where necessary due to numerical analysis. Some difficulties occur at the interface between two zones with different levels of refinement, if a conformal mesh is required. To maintain the compatibility, the refinement is performed by specific operations. These operations are simple, using triangles or tetrahedra, but are much more complex with a hexahedral mesh. This paper deals with conformal mesh refinement with hexahedra. A new method, which implies the use of tetrahedra and pyramids to connect the zones of different levels of refinement, is proposed. The details of the algorithm used to generate those meshes are presented. This new technique allows h-refinement to be used in numerical simulations based on hexahedra with a conformal finite element method. Finally, some numerical applications show the relevance of this technique in mechanical computation. [Copyright &y& Elsevier]

Abstract: We revisit in this paper the theory of axisymmetric vortex rings in an ideal fluid. The boundary separating the vortex ring from the external (potential) flow is assumed of elliptic shape. For a given distribution of vorticity in the vortex core, we theoretically put into evidence the critical parameter for the existence of non-trivial solutions, thus confirming the numerical observation of Durst et al. [ZAMP 32 (1981) 156]. A sharp estimation of the critical threshold is analytically derived. Theoretical predictions are confirmed by numerical simulations using finite elements. A new numerical algorithm is presented and shown to display better performances compared to previous published algorithms using finite differences. The convergence of the iterative algorithm is proved using the theory of elliptic partial differential equations with discontinuous nonlinearities. [Copyright &y& Elsevier]

The one-sample-per-person problem has become an active research topic for face recognition in recent years because of its challenges and significance for real-world applications. However, achieving relatively higher recognition accuracy is still a difficult problem due to, usually, too few training samples being available and variations of illumination and expression. To alleviate the negative effects caused by these unfavorable factors, in this paper we propose a more accurate spectral feature image-based 2DLDA (two-dimensional linear discriminant analysis) ensemble algorithm for face recognition, with one sample image per person. In our algorithm, multi-resolution spectral feature images are constructed to represent the face images; this can greatly enlarge the training set. The proposed method is inspired by our finding that, among these spectral feature images, features extracted from some orientations and scales using 2DLDA are not sensitive to variations of illumination and expression. In order to maintain the positive characteristics of these filters and to make correct category assignments, the strategy of classifier committee learning (CCL) is designed to combine the results obtained from different spectral feature images. Using the above strategies, the negative effects caused by those unfavorable factors can be alleviated efficiently in face recognition. Experimental results on the standard databases demonstrate the feasibility and efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Abstract: The high advanced techniques in parallel computing can be employed for a better understanding of groundwater flow fluids. Generally, the geological media are very heterogeneous and contain complex structures. Decomposing these structures into, approximately, equivalent sub-structures for a load-balancing is a major challenge. This paper proposes and analyses a new algorithm to simulate parallel flow fluid in such complex media. Fully parallel software is developed, and two well-known sparse linear solvers, based respectively on a multifrontal Cholesky factorization and an iterative structured multigrid method, are compared. The mixed finite element (MFE) method is used to discretize Darcy’s equation. Numerical examples are presented to show the efficiency and robustness of the algorithm proposed. [Copyright &y& Elsevier]

Abstract: In this paper, we present a max-plus algebraic modeling and control approach for cyclically operated high-throughput screening plants. In previous work an algorithm has been developed to determine the globally optimal solution of the cyclic scheduling problem. The obtained optimal schedule is modeled in a max-plus algebraic framework. The max-plus algebraic model can then be used to generate appropriate control actions to handle unexpected deviations from the predetermined cyclic operation during runtime. [Copyright &y& Elsevier]

A family of the block matching 3-D (BM3D) algorithms for various imaging problems has been recently proposed within the framework of nonlocal patchwise image modeling refid="ref1"/, refid="ref2"/. In this paper, we construct analysis and synthesis frames, formalizing BM3D image modeling, and use these frames to develop novel iterative deblurring algorithms. We consider two different formulations of the deblurring problem, i.e., one given by the minimization of the single-objective function and another based on the generalized Nash equilibrium (GNE) balance of two objective functions. The latter results in the algorithm where deblurring and denoising operations are decoupled. The convergence of the developed algorithms is proved. Simulation experiments show that the decoupled algorithm derived from the GNE formulation demonstrates the best numerical and visual results and shows superiority with respect to the state of the art in the field, confirming a valuable potential of BM3D-frames as an advanced image modeling tool. [ABSTRACT FROM AUTHOR]

In this paper, we derive an algorithm to solve the linear quadratic (LQ) optimal regulator problems. The new approach is based on efficient Legendre and Chebyshev formulae at the Chebyshev-Gauss-Lobatto points. The technique enjoys advantages of both the Legendre and Chebyshev approximations near the end points. To show the numerical behavior of the proposed method, the simulation results of an example are presented. [ABSTRACT FROM AUTHOR]

This paper presents a parallel algorithm to improve the quality of surface meshes representing models obtained from surface reconstruction, as well as models generated by the application of the Boolean and assembly operations to predefined primitives, such as spheres and blocks. The smooth surface approximation is generated in parallel, the faces are distributed evenly among the processors. Then, the surface mesh is divided into sections, which are refined first, and intersections for remeshing at the end. [ABSTRACT FROM PUBLISHER]

The simulation in real time of heterogeneous systems has to guarantee that the time integration of the equations of motion is always successfully completed within an a priori fixed sampling time interval. Therefore, numerical and/or physical substructures as well as numerical solution methods have to be adapted to the needs of real-time simulations. Monolithic stable numerical methods are implicit and cannot be easily used in real-time applications because of their iterative strategies necessary to solve the nonlinear corrector equations. As an alternative, in the present paper, we consider linearly implicit Rosenbrock-based L-stable real-time (LSRT) compatible algorithms with both two-stage and three-stage. Moreover, other linearly implicit structural integrators used nowadays to perform coupled simulations in real time are introduced too. Successively, typical properties of monolithic algorithms are shown when large time steps are employed. The loss of stability and the reduction of accuracy of these algorithms, when applied to coupled systems caused by kinematically closed loops, are analyzed in-depth through a split-inertia substructured system. In this respect, the benefits of the L-stability property are shown. Finally, the performance of the algorithms under investigation appears in a number of more realistic tests considering both nonstiff and stiff substructures. [ABSTRACT FROM AUTHOR]

A gate location is one of the most important design variables controlling the product quality of injection molding. In this paper, the numerical simulation of injection mold filling process is combined with the design optimization method to find the optimum gate location to achieve balanced flow. The objective function is expressed in terms of the difference between the maximum and minimum times of boundary filling. The coordinates of gate are chosen as design variables, and a constraint is employed to limit the clamp force lower than the reference value. The optimization problem is solved with the sequential linear programming algorithm, and design sensitivities are evaluated via the finite difference approximation. Finally, numerical examples are given to demonstrate the effect of proposed methods. [ABSTRACT FROM AUTHOR]

In this paper, we propose a low-complexity decision-directed channel-estimation scheme, which offers improved performance for space-frequency-block-coded orthogonal frequency-division multiplexing (SFBC-OFDM) systems under doubly selective (i.e., frequency selective and fast fading) channels. First, we propose a square-root-free inverse-QR-decomposition-based groupwise recursive (SIQR-GR) channel-estimation algorithm employing sequences of scaled Givens rotations. The proposed SIQR-GR scheme recursively processes data decisions corresponding to the SFBC groups within each OFDM block to improve system performance under doubly selective channels. Furthermore, the avoidance of square roots and the utilization of scaled Givens rotations ensure that the proposed SIQR-GR scheme is computationally efficient. Second, we derive semi-analytical expressions for the normalized mean square error (NMSE) performance of SIQR-GR and verify the accuracy of the NMSE analysis via numerical simulations. Finally, we provide performance and complexity comparisons between SIQR-GR and previously proposed schemes. These comparisons show an excellent performance-complexity tradeoff achieved by SIQR-GR over the previous solutions under various channel conditions. [ABSTRACT FROM AUTHOR]

This paper explores the use of kurtosis in synchronizing with a QPSK burst transmission. The start and end of the burst are a priori unknown and are detected without the use of pilot signals. After frame level synchronization, signal level synchronization is performed. The symbol timing, carrier frequency and carrier phase are recovered without the assistance of known symbols or synchronization words in the data stream, i.e. totally blind synchronization. The performance of frame, symbol and carrier synchronization algorithms is evaluated through computer simulations. [ABSTRACT FROM AUTHOR]

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]

Reconstruction of freeform surfaces from scattered coordinate data is a difficult problem encountered in many surface fitting and geometric modeling applications. Conventional tessellation and parametric surface fitting techniques are limited because they require prior knowledge about the connectivity between the sampled points. The method of surface reconstruction described in this paper exploits the learning capability of a self-organizing feature map (SOFM) to adaptively fit a deformable sphere to the unorganized 3D coordinate data. The learning algorithm automatically establishes the connectivity between the measured points by iteratively changing the topological relationships within the map. By incorporating additional constraints during the learning process it is possible to have the deformable map follow the shape of objects with surface holes and cavities. Several examples of freeform surfaces with varying levels of complexity are discussed in order to demonstrate the performance of the algorithm. [ABSTRACT FROM AUTHOR]

Recently, development of a numerical calculation of the head-related transfer function (HRTF) has been conducted using a computer model of a human head and the boundary element method. The reciprocity theorem is incorporated into the computational process in order to shorten the computational time, which is otherwise very long. On the other hand, another fast HRTF calculation method for any source position, which is realized by calculating factors independent of the source position in advance, has been suggested by the authors. Using this algorithm, the HRTF for any source position can be obtained in a few seconds with a common PC. The resulting HRTFs are more precise and are calculated faster than those by using the reciprocity theorem. However, speeding the process up even further is required in order to respond to a head movement and rotation or to moving sources during binaural sound reproduction. In this paper, a faster calculation method by incorporating a time domain operation into the authors’ previous algorithm is proposed. Additionally, the new formulation, which eliminates the extra computational time in the preprocess, is proposed. This method is shown to be faster than the previous ones, but there are some discrepancies at higher frequencies. [ABSTRACT FROM AUTHOR]

Modeling of tissue deformation is of great importance to virtual reality (VR)-based medical simulations. Considerable effort has been dedicated to the development of interactively deformable virtual tissues. In this paper, an efficient and scalable deformable model is presented for virtual-reality-based medical applications. It considers deformation as a localized force transmittal process which is governed by algorithms based on breadth-first search (BFS). The computational speed is scalable to facilitate real-time interaction by adjusting the penetration depth. Simulated annealing (SA) algorithms are developed to optimize the model parameters by using the reference data generated with the linear static finite element method (FEM). The mechanical behavior and timing performance of the model have been evaluated. The model has been applied to simulate the typical behavior of living tissues and anisotropic materials. Integration with a haptic device has also been achieved on a generic personal computer (PC) platform. The proposed technique provides a feasible solution for VR-based medical simulations and has the potential for multi-user collaborative work in virtual environment. [Copyright &y& Elsevier]

Abstract-Subspace-based estimation of multiple real-valued sine wave frequencies is considered in this paper. A novel data covariance model is proposed. In the proposed model, the dimension of the signal subspace equals the number of frequencies present in the data, which is half of the signal. subspace dimension for the conventional model. Consequently, an ESPRIT-like algorithm using the proposed data model is presented. The proposed algorithm is then extended for the case of complex-valued sine waves. Performance analysis of the proposed algorithms are also carried out. The algorithms are tested in numerical simulations. When compared with ESPRIT, the newly proposed algorithm results in a significant reduction in computational burden without any compromise in the accuracy. [ABSTRACT FROM AUTHOR]