in this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for...
详细信息
Micro Expression (ME) is the subtle facial expressions that people show when they express their inner feelings. To address the problem that micro-expression recognition is difficult and less accurate due to the small ...
详细信息
The traveling salesman problem(TSP), a typical non-deterministic polynomial(NP) hard problem, has been used in many engineering applications. As a new swarm-intelligence optimization algorithm, the fruit fly optimizat...
详细信息
The traveling salesman problem(TSP), a typical non-deterministic polynomial(NP) hard problem, has been used in many engineering applications. As a new swarm-intelligence optimization algorithm, the fruit fly optimization algorithm(FOA) is used to solve TSP, since it has the advantages of being easy to understand and having a simple implementation. However, it has problems, including a slow convergence rate for the algorithm, easily falling into the local optimum, and an insufficient optimization precision. To address TSP effectively, three improvements are proposed in this paper to improve FOA. First, the vision search process is reinforced in the foraging behavior of fruit flies to improve the convergence rate of FOA. Second, an elimination mechanism is added to FOA to increase the diversity. Third, a reverse operator and a multiplication operator are proposed. They are performed on the solution sequence in the fruit fly's smell search and vision search processes, respectively. In the experiment, 10 benchmarks selected from TSPLIB are tested. The results show that the improved FOA outperforms other alternatives in terms of the convergence rate and precision.
With the increasing proliferation of the Mobile Social Networks (MSN) and the Location Based Service (LBS), location privacy has attracted broad attention in recent years. Most researches have been done with the assum...
详细信息
An incremental method of feature selection based on mutual information, called incremental Max-Relevance, and Min-Redundancy (I-mRMR), is presented. I-mRMR is an incremental version of Max-Relevance, and Min-Redundanc...
详细信息
Genealogical knowledge graphs depict the relationships of family networks and the development of family histories. They can help researchers to analyze and understand genealogical data, search for genealogical descend...
详细信息
Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR...
详细信息
Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR） and Sim- Rank （SR） have emerged as the most popular and influen- tial link-based similarity measures. Recently, a novel link- based similarity measure, penetrating rank （P-Rank）, which enriches SR, was proposed. In practice, PPR, SR and P-Rank scores are calculated by iterative methods. As the number of iterations increases so does the overhead of the calcula- tion. The ideal solution is that computing similarity within the minimum number of iterations is sufficient to guaran- tee a desired accuracy. However, the existing upper bounds are too coarse to be useful in general. Therefore, we focus on designing an accurate and tight upper bounds for PPR, SR, and P-Rank in the paper. Our upper bounds are designed based on the following intuition： the smaller the difference between the two consecutive iteration steps is, the smaller the difference between the theoretical and iterative similar- ity scores becomes. Furthermore, we demonstrate the effec- tiveness of our upper bounds in the scenario of top-k similar nodes queries, where our upper bounds helps accelerate the speed of the query. We also run a comprehensive set of exper- iments on real world data sets to verify the effectiveness and efficiency of our upper bounds.
Deep learning has achieved significant progress in ship instance segmentation for synthetic aperture radar (SAR) im-ages. However, due to the challenges posed by inshore scenes, such as dense clustering, arbitrary arr...
详细信息
In order to fully utilize lesion features and vascular structure and solve the problem of class imbalance, diabetes retinopathy (DR) grading is modeled as a dual-stage task, and the prior-guided dual-stage diabetes re...
详细信息
Image transmission is one of the biggest challenges in wireless sensor networks because of the limited resource on sensor nodes. We proposed two image transmission schemes driven by reliability and real time considera...
详细信息
Image transmission is one of the biggest challenges in wireless sensor networks because of the limited resource on sensor nodes. We proposed two image transmission schemes driven by reliability and real time considerations in order to transfer JPEG images over Zigbee-based sensor networks. By adding two bytes counter in the header of data packet, we can easily solve the repeated data reception problem caused by retransmission mechanism in traditional Zigbees network layer. We proposed an efficient retransmission and acknowledgment mechanism in Zigbees application layer. By classifying different data reception response events, we can provide data packets with differential responses and ensure that image packets can be transferred quickly even with large maximum number of retransmission. Practical results show the effectiveness of our solutions to make image transmission over Zigbee-based sensor networks efficient.
暂无评论