Search

Your search keyword '"Yang, Guowu"' showing total 3 results
Start Over Author "Yang, Guowu" Topic search algorithms Publication Year Range Last 10 years
3 results on '"Yang, Guowu"'

1. A multiobjective scatter search algorithm for fault-tolerant NoC mapping optimisation.

Author

Le, Qianqi, Yang, Guowu, Hung, William N. N., Zhang, Xinpeng, and Fan, Fuyou

Subjects
*SEARCH algorithms, *FAULT location (Engineering), *NETWORKS on a chip, *MATHEMATICAL optimization, *SYSTEMS design, *MATHEMATICAL mappings, *RELIABILITY in engineering
Abstract

Mapping IP cores to an on-chip network is an important step in Network-on-Chip (NoC) design and affects the performance of NoC systems. A mapping optimisation algorithm and a fault-tolerant mechanism are proposed in this article. The fault-tolerant mechanism and the corresponding routing algorithm can recover NoC communication from switch failures, while preserving high performance. The mapping optimisation algorithm is based on scatter search (SS), which is an intelligent algorithm with a powerful combinatorial search ability. To meet the requests of the NoC mapping application, the standard SS is improved for multiple objective optimisation. This method helps to obtain high-performance mapping layouts. The proposed algorithm was implemented on the Embedded Systems Synthesis Benchmarks Suite (E3S). Experimental results show that this optimisation algorithm achieves low-power consumption, little communication time, balanced link load and high reliability, compared to particle swarm optimisation and genetic algorithm. [ABSTRACT FROM PUBLISHER]

Published
2014
Full Text
View/download PDF

2. A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature.

Author

Zhang, Juling, Yang, Guowu, Hung, William N. N., Wu, Jinzhao, and Zhu, Yixin

Subjects
*BOOLEAN functions, *BOOLEAN matrices, *MATHEMATICAL transformations, *DECOMPOSITION method, *SEARCH algorithms
Abstract

In this paper, we address an NPN Boolean matching algorithm. The proposed structural difference signature (SDS) of a Boolean function significantly reduces the search space in the Boolean matching process. The paper analyses the size of the search space from three perspectives: the total number of possible transformations, the number of candidate transformations and the number of decompositions. We test the search space and run time on a large number of randomly generated circuits and Microelectronics Center of North Carolina (MCNC) benchmark circuits with 7–22 inputs. The experimental results show that the search space of Boolean matching is greatly reduced and the matching speed is obviously accelerated. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

3. Privacy-preserving data search with fine-grained dynamic search right management in fog-assisted Internet of Things.

Author

Zhou, Rang, Zhang, Xiaosong, Wang, Xiaofen, Yang, Guowu, Wang, Hao, and Wu, Yulei

Subjects
*DATA privacy, *SEARCH algorithms, *INTERNET of things, *DATA encryption, *CLOUD computing
Abstract

• A new fog-assisted privacy-preserving IoT data search framework is proposed. • Fine-grained dynamic search right management at document level is designed. • Offline users' search key update is maintained in the data search system. • Two schemes on credible and semi-trusted fog nodes are constructed, respectively. Fog computing, as an assisted method for cloud computing, collects Internet of Things (IoT) data to multiple fog nodes on the edge of IoT and outsources them to the cloud for data search, and it reduces the computation cost on IoT nodes and provides fine-grained search right management. However, to provide privacy-preserving IoT data search, the existing searchable encryptions are very inefficient as the computation cost is too high for the resource-constrained IoT ends. Moreover, to provide dynamic search right management, the users need to be online all the time in the existing schemes, which is impractical. In this paper, we first present a new fog-assisted privacy-preserving IoT data search framework, where the data from each IoT device is collected by a fog node, stored in a determined document and outsourced to the cloud, the users search the data through the fog nodes, and the fine-grained search right management is maintained at document level. Under this framework, two searchable encryption schemes are proposed, i.e., Credible Fog Nodes assisted Searchable Encryption (CFN-SE) and Semi-trusted Fog Nodes assisted Searchable Encryption (STFN-SE). In CFN-SE scheme, the indexes and trapdoors are generated by the fog nodes, which greatly reduce the computation costs at the IoT devices and user ends, and fog nodes are used to support offline users' key update. In STFN-SE scheme, the semi-trusted fog nodes are used to provide storage of encrypted key update information to assist offline users' search right update. In both schemes, no re-encryption of the keywords is needed in search right updates. The performance evaluations of our schemes demonstrate the feasibility and high efficiency of our system. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results