Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency ...
详细信息
Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compression of the underlying constraint with c-tuples. Experimental evaluation show our algorithms are faster than many algorithms (STR2, STR2-C, STR3, STR3-C and MDDc) across a variety of benchmarks except for problems with small tables where complex data structures do not payoff.
This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic...
详细信息
ISBN:
(纸本)1901725340
This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilbert transform is applied to each component and get the phase and amplitude information. The proposed descriptors samples the phase angles information and amalgamates them into 10 overlap squares with 8-bin orientation histograms. The experiments show that the proposed descriptors are better than SIFT and other standard descriptors. Essentially, the Hilbert-Huang Transform based descriptors can belong to the class of phase-based descriptors. So it can provides a better way to overcome the illumination changes. Additionally, the Hilbert-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilbert-Huang transform.
The Diameter protocol is recommended by IETF as AAA (Authentication, Authorization and Accounting) protocol criterion for the next generation network, Because the IPv6 protocol will be widely applied in the intending ...
详细信息
Petri Nets is a powerful mathematical modeling tool for system description and analysis, with which we can describe the relationship among entities efficiently. The present thesis puts forward the modeling of the dist...
详细信息
To obtain the optimal partition of a data set, a hybrid clustering algorithm, PKPSO, based on PSO is proposed. In the proposed PKPSO the PSO algorithm is effectively integrated with the K means algorithm. Among the po...
详细信息
To obtain the optimal partition of a data set, a hybrid clustering algorithm, PKPSO, based on PSO is proposed. In the proposed PKPSO the PSO algorithm is effectively integrated with the K means algorithm. Among the population, selected candidate solutions are further optimized to improve the accuracy by the K-means algorithm. By analyzing the algorithm, the criterions for control parameters selection are determined. Partional clustering result by the proposed PKPSO is compared with that by PSO or by K-means algorithm, and results show that the global convergent property of PKPSO is better than that of the other algorithms. The PKPSO can not only overcome the shortcoming of local minimum trapping of the K-means, but also the solution precision and algorithm stability are better than that of the other two algorithm.
In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole syst...
详细信息
The current boom in the Internet of Things(IoT) is changing daily life in many ways, from wearable devices to connected vehicles and smart cities. We used to regard fog computing as an extension of cloud computing, bu...
详细信息
The current boom in the Internet of Things(IoT) is changing daily life in many ways, from wearable devices to connected vehicles and smart cities. We used to regard fog computing as an extension of cloud computing, but it is now becoming an ideal solution to transmit and process large-scale geo-distributed big data. We propose a Byzantine fault-tolerant networking method and two resource allocation strategies for IoT fog computing. We aim to build a secure fog network, called "SIoTFog," to tolerate the Byzantine faults and improve the efficiency of transmitting and processing IoT big data. We consider two cases, with a single Byzantine fault and with multiple faults, to compare the performances when facing different degrees of risk. We choose latency, number of forwarding hops in the transmission, and device use rates as the metrics. The simulation results show that our methods help achieve an efficient and reliable fog network.
To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSumWeight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ...
详细信息
Protein secondary structure prediction is still a challenging task in bioinformatics, especially for 8-state (Q8) classification. To address this problem, we have proposed a deep learning based model by integrating gr...
详细信息
As the conventional feature selection algorithms are prone to the poor running efficiency in largescale datasets with interacting features, this paper aims at proposing a novel rough feature selection algorithm whose ...
详细信息
As the conventional feature selection algorithms are prone to the poor running efficiency in largescale datasets with interacting features, this paper aims at proposing a novel rough feature selection algorithm whose innovation centers on the layered co-evolutionary strategy with neighborhood radius hierarchy. This hierarchy can adapt the rough feature scales among different layers as well as produce the reasonable decompositions through exploiting any correlation and interdependency among feature subsets. Both neighborhood interaction within layer and neighborhood cascade between layers are adopted to implement the interactive optimization of neighborhood radius matrix, so that both the optimal rough feature selection subsets and their global optimal set are obtained efficiently. Our experimental results substantiate the proposed algorithm can achieve better effectiveness, accuracy and applicability than some traditional feature selection algorithms.
暂无评论