The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Expert finding is an important technique to obtain the user authority ranking in community question answering (CQA) websites. ZhihuRank is a topic-sensitive expert finding algorithm, which is based on both LDA and PageRank. Currently, with the amount of participants and documents increasing rapidly in CQA websites, how to parallel expert finding algorithms for big data analysis has received significant...
The paper mainly talks about the distributed optimal issue under the continuous-time high-order multi-agent system with event-triggered communication. Every agent possesses its local convex cost function only known by itself. and our aim is to minimize the sum of all the local cost functions and make the agents convergent to the optimal point through the communication between the agents. Utilizing...
In this paper, an efficient multi-mode CORDIC processing unit is implemented on a dynamically reconfigurable array. The array consists of 4×4 multi-functional Processing Elements (PEs). An efficient pipelined data-flow graph is proposed to implement to achieve a high data throughput and, in the same time, maximizing the resource utilization rate. The implementation results shows that, when compared...
In this paper, we propose a fast computational framework based on height functions descriptor for handling shape matching. To improve the efficiency, we utilize the strategy of heuristic search to reduce the large search space of dynamic programming (DP) algorithm between sample points of every two shapes during shape matching. Experiments on several public shape benchmarks(such as, MPEG-7 dataset,...
In this paper, a flocking algorithm with multi-leader tracking for multi-agent systems is presented, and a strategy for leaders choosing their nearby agents is proposed. It is supposed that only a certain number of agents can be accepted by each leader as followers. Leaders choose these followers by the distances between them and the capacity of followers accepted by leaders. With the presented flocking...
An improved ant colony algorithm is proposed in this paper for Traveling Salesman Problems (TSPs). In the process of searching, the ants are more sensitive to the optimal path because the inverse of distance among cities is chosen as the heuristic information, while a candidate list is used to limit the number of candidate city. The method of local and global dynamic phenomenon update is used in order...
In wireless sensor networks, the energy of nodes is limited. so designing efficient routing for reducing energy consumption is important. In this paper we proposed A Low Power Grid-based Cluster Routing Algorithm of Wireless Sensor Networks (LPGCRA). The characteristic of this algorithm is that the WSN is divided into different grids according to information of the node location, and then the nodes...
Natural properties of stochastic searching strategies and operations in metaheuristic algorithms have important influence on convergence performance of various metaheuristic algorithms. Through similarity analysis to two kinds of metaheuristic algorithms, exact heuristic algorithm based on branch-and-cut is put forward according to change trend of similarity between two arbitrary high-quality solutions...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.