Generally, predicting whether an item will be liked or disliked by active users, and how much an item will be liked, is a main task of collaborative filtering systems or recommender systems. Recently, predicting most likely bought items for a target user, which is a subproblem of the rank problem of collaborative filtering, became an important task in collaborative filtering. Traditionally, the prediction uses the user item co-occurrence data based on users’ buying behaviors. However, it is challenging to achieve good prediction performance using traditional methods based on single domain information due to the extreme sparsity of the buying matrix. In this paper, we propose a novel method called the preference transfer model for effective cross-domain collaborative filtering. Based on the preference transfer model, a common basis item-factor matrix and different user-factor matrices are factorized. Each user-factor matrix can be viewed as user preference in terms of browsing behavior or buying behavior. Then, two factor-user matrices can be used to construct a so-called ‘preference dictionary’ that can discover in advance the consistent preference of users, from their browsing behaviors to their buying behaviors. Experimental results demonstrate that the proposed preference transfer model outperforms the other methods on the Alibaba Tmall data set provided by the Alibaba Group.
Mesh parameterization is one of the fundamental operations in computer graphics (CG) and computeraided design (CAD). In this paper, we propose a novel local/global parameterization approach, ARAP++, for singleand multi-boundary triangular meshes. It is an extension of the as-rigid-as-possible (ARAP) approach, which stitches together 1-ring patches instead of individual triangles. To optimize the spring energy, we introduce a linear iterative scheme which employs convex combination weights and a fitting Jacobian matrix corresponding to a prescribed family of transformations. Our algorithm is simple, efficient, and robust. The geometric properties (angle and area) of the original model can also be preserved by appropriately prescribing the singular values of the fitting matrix. To reduce the area and stretch distortions for high-curvature models, a stretch operator is introduced. Numerical results demonstrate that ARAP++ outperforms several state-of-the-art methods in terms of controlling the distortions of angle, area, and stretch. Furthermore, it achieves a better visualization performance for several applications, such as texture mapping and surface remeshing.
Accurate head poses are useful for many face-related tasks such as face recognition, gaze estimation, and emotion analysis. Most existing methods estimate head poses that are included in the training data (i.e., previously seen head poses). To predict head poses that are not seen in the training data, some regression-based methods have been proposed. However, they focus on estimating continuous head pose angles, and thus do not systematically evaluate the performance on predicting unseen head poses. In this paper, we use a dense multivariate label distribution (MLD) to represent the pose angle of a face image. By incorporating both seen and unseen pose angles into MLD, the head pose predictor can estimate unseen head poses with an accuracy comparable to that of estimating seen head poses. On the Pointing’04 database, the mean absolute errors of results for yaw and pitch are 4.01? and 2.13?, respectively. In addition, experiments on the CAS-PEAL and CMU Multi-PIE databases show that the proposed dense MLD-based head pose estimation method can obtain the state-of-the-art performance when compared to some existing methods.
The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving this problem is that the function to be optimized is characterized by a multitude of local minima separated by high-energy barriers. The Wang-Landau (WL) sampling method, which is an improved Monte Carlo method, has been successfully applied to solve many optimization problems. In this paper we use the WL sampling method to optimize the layout of a satellite module. To accelerate the search for a global optimal layout, local search (LS) based on the gradient method is executed once the Monte-Carlo sweep produces a new layout. By combining the WL sampling algorithm, the LS method, and heuristic layout update strategies, a hybrid method called WL-LS is proposed to obtain a final layout scheme. Furthermore, to improve significantly the efficiency of the algorithm, we propose an accurate and fast computational method for the overlapping depth between two objects (such as two rectangular objects, two circular objects, or a rectangular object and a circular object) embedding each other. The rectangular objects are placed orthogonally. We test two instances using first 51 and then 53 objects. For both instances, the proposed WL-LS algorithm outperforms methods in the literature. Numerical results show that the WL-LS algorithm is an effective method for layout optimization of satellite modules.
X-ray pulsars offer stable, periodic X-ray pulse sequences that can be used in spacecraft positioning systems. A method using X-ray pulsars to determine the initial orbit of a satellite is presented in this paper. This method suggests only one detector to be equipped on the satellite and assumes that the detector observes three pulsars in turn. To improve the performance, the use of incremental phase in one observation duration is proposed, and the incremental phase is combined with the time difference of arrival (TDOA). Then, a weighted least squares (WLS) algorithm is formulated to calculate the initial orbit. Numerical simulations are performed to assess the proposed orbit determination method.
In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation (ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolution (OODE). The proposed algorithm is named IOODE with ‘I’ representing ICBA. OODE plans the trajectory in two parts: trajectory curve and acceleration profile. The best trajectory curve is picked from a set of candidate curves, where each curve is evaluated by solving a subproblem with the differential evolution (DE) algorithm. The more iterations DE performs, the more accurate the evaluation will become. Thus, we intelligently allocate the iterations to individual curves so as to reduce the total number of iterations performed. Meanwhile, the selected best curve is ensured to be one of the truly top curves with a high enough probability. Simulation results show that IOODE is 20% faster than OODE while maintaining the same performance in terms of solution quality. The computing budget allocation framework presented in this paper can also be used to enhance the efficiency of other candidate-curve-based planning methods.
We investigate the identification problems of a class of linear stochastic time-delay systems with unknown delayed states in this study. A time-delay system is expressed as a delay differential equation with a single delay in the state vector. We first derive an equivalent linear time-invariant (LTI) system for the time-delay system using a state augmentation technique. Then a conventional subspace identification method is used to estimate augmented system matrices and Kalman state sequences up to a similarity transformation. To obtain a state-space model for the time-delay system, an alternate convex search (ACS) algorithm is presented to find a similarity transformation that takes the identified augmented system back to a form so that the time-delay system can be recovered. Finally, we reconstruct the Kalman state sequences based on the similarity transformation. The time-delay system matrices under the same state-space basis can be recovered from the Kalman state sequences and input-output data by solving two least squares problems. Numerical examples are to show the effectiveness of the proposed method.
To improve maneuverability and stability of articulated vehicles, we design an active steering controller, including tractor and trailer controllers, based on linear quadratic regulator (LQR) theory. First, a three-degree-of-freedom (3-DOF) model of the tractor-trailer with steered trailer axles is built. The simulated annealing particle swarm optimization (SAPSO) algorithm is applied to identify the key parameters of the model under specified vehicle speed and steering wheel angle. Thus, the key parameters of the simplified model can be obtained according to the vehicle conditions using an online look-up table and interpolation. Simulation results show that vehicle parameter outputs of the simplified model and TruckSim agree well, thus providing the ideal reference yaw rate for the controller. Then the active steering controller of the tractor and trailer based on LQR is designed to follow the desired yaw rate and minimize their side-slip angle of the center of gravity (CG) at the same time. Finally, simulation tests at both low speed and high speed are conducted based on the TruckSim-Simulink program. The results show significant effects on the active steering controller on improving maneuverability at low speed and lateral stability at high speed for the articulated vehicle. The control strategy is applicable for steering not only along gentle curves but also along sharp curves.
Type-2 fuzzy controllers have been mostly viewed as black-box function generators. Revealing the analytical structure of any type-2 fuzzy controller is important as it will deepen our understanding of how and why a type-2 fuzzy controller functions and lay a foundation for more rigorous system analysis and design. In this study, we derive and analyze the analytical structure of an interval type-2 fuzzy controller that uses the following identical elements: two nonlinear interval type-2 input fuzzy sets for each variable, four interval type-2 singleton output fuzzy sets, a Zadeh AND operator, and the Karnik-Mendel type reducer. Through dividing the input space of the interval type-2 fuzzy controller into 15 partitions, the input-output relationship for each local region is derived. Our derivation shows explicitly that the controller is approximately equivalent to a nonlinear proportional integral or proportional differential controller with variable gains. Furthermore, by comparing with the analytical structure of its type-1 counterpart, potential advantages of the interval type-2 fuzzy controller are analyzed. Finally, the reliability of the analysis results and the effectiveness of the interval type-2 fuzzy controller are verified by a simulation and an experiment.