In this paper, an efficient approach is proposed for loop-closure detection in robot visual SLAM. The method uses mutual information to measure similarity between current view and key frames in an appearance map, and evaluates candidate loop-closure locations in particle filter framework. Specially, the implementation of particle filter is accelerated through updating a set of weight vector of ...

In most online learning algorithms, the weights assigned to the misclassified examples (or support vectors) remain unchanged during the entire learning process. This is clearly insufficient since when a new misclassified example is added to the pool of support vectors, we generally expect it to affect the weights for the existing support vectors. In this paper, we propose a new online learning ...

Abstract The difficulty of endpoint determination in basic oxygen furnace (BOF) steelmaking lies achieving accurate real-time measurements carbon content and temperature. For the characteristics serious nonlinearity between process data, deep learning can perform excellent nonlinear feature representation for complex structural data. However, there is a drift phenomenon BOF steelmaking, existin...

We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the network is determined nonlocally, this approach can explain the generic nonlinear scaling between the strength and the degree of a node. We demonstrate by a ...

We propose a method to partition training vectors into clusters for a parallel implementation of Self-organizing Map (SOM) algorithm The proposed algorithm assigns a cluster to a processor such that, in updating weights, the neighborhoods of a winning node in a cluster do not overlap the neighboring nodes of some winning nodes in other clusters. It reduces the overheads caused by synchronizatio...

A topic detection model based on hierarchical clustering for Chinese microblog is proposed in this paper. In order to minimize the impact of noise, we optimize the feature selection and weight computation method and use a new scoring method to filter out those topic-unrelated tweets. We also give an improved topic detection algorithm which uses a new vector distance calculation method and cente...

Social networks are often studied as graphs, and detecting communities in a social network can be modeled as a seriously non linear optimization problem. Soft computing techniques have shown promising results for solving this problem. In this paper, we have proposed a new approach based on self organizing map to community detection. By using a proper weight updating scheme, a network can be org...

In the path minima problem on a tree, each edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem, where the edge weights can be updated, we give data structures that achieve optimal query time in the comparison and the RAM models. These structures also support inserting a node on an edge, inserting a leaf,...

The backpropagation learning algorithm for feedforward networks (Rumelhart et al. 1986) has recently been generalized to recurrent networks (Pineda 1989). The algorithm has been further generalized by Pearlmutter (1989) to recurrent networks that produce time-dependent trajectories. The latter method requires much more training time than the feedforward or static recurrent algorithms. Furthermo...

MC-CDMA is an attractive multi-access method for the next generation high-speed mobile communication systems. The uplink transmission performance is limited by the multi-access interference (MAI) from other users since all users share the same bandwidth. Adaptive antenna array can be used to suppress the MAI and to improve the uplink transmission performance. In this paper, we propose a frequen...