Author
Wallace K. S. Tang
Bio: Wallace K. S. Tang is an academic researcher from City University of Hong Kong. The author has contributed to research in topics: Chaotic & Attractor. The author has an hindex of 32, co-authored 138 publications receiving 4059 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization.
Abstract: In this paper, a fast chaos-based image encryption system with stream cipher structure is proposed. In order to achieve a fast throughput and facilitate hardware realization, 32-bit precision representation with fixed point arithmetic is assumed. The major core of the encryption system is a pseudo-random keystream generator based on a cascade of chaotic maps, serving the purpose of sequence generation and random mixing. Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization. The overall design of the image encryption system is to be explained while detail cryptanalysis is given and compared with some existing schemes.
425 citations
TL;DR: In this letter, a simple nonlinear state feedback controller is designed for generating hyperchaos from a three-dimensional autonomous chaotic system and is implemented experimentally via an electronic circuit.
Abstract: In this letter, a simple nonlinear state feedback controller is designed for generating hyperchaos from a three-dimensional autonomous chaotic system. The hyperchaotic system is not only demonstrated by computer simulations but also verified with bifurcation analysis, and is implemented experimentally via an electronic circuit.
419 citations
TL;DR: In this article, it is demonstrated that n-scroll attractors can be generated using a simple sine or cosine function and a guideline is given so that a different number of scrolls can be designed easily by modifying two variables in the function.
Abstract: A new approach for generating n-scroll attractors is introduced. It is demonstrated that n-scroll attractors can be generated using a simple sine or cosine function. A guideline is given so that a different number of scrolls can be designed easily by modifying two variables in the function. An electronic circuit is also designed for the implementation and the observation of a 9-scroll attractor is reported for the first time.
289 citations
TL;DR: An alternate model for rumor spreading over networks is suggested, in which two rumors with different probabilities of acceptance may propagate among nodes, and it is found that preferred rumor 1 is dominant in the network when the degree of nodes is high enough and/or when the network contains large clustered groups of nodes, expelling rumor 2.
Abstract: An alternate model for rumor spreading over networks is suggested, in which two rumors (termed rumor 1 and rumor 2) with different probabilities of acceptance may propagate among nodes. The propagation is not symmetric in the sense that when deciding which rumor to adopt, nodes always consider rumor 1 first. The model is a natural generalization of the well-known epidemic SIS (susceptible-infective-susceptible) model and reduces to it when some of the parameters of this model are zero. We find that preferred rumor 1 is dominant in the network when the degree of nodes is high enough and/or when the network contains large clustered groups of nodes, expelling rumor 2. However, numerical simulations on synthetic networks show that it is possible for rumor 2 to occupy a nonzero fraction of the nodes in many cases as well. Specifically, in the Watts-Strogatz small-world model a moderate level of clustering supports its adoption, while increasing randomness reduces it. For Erdos-Renyi networks, a low average degree allows the coexistence of the two types of rumors. In Barabasi-Albert networks generated with a low $m$, where $m$ is the number of links when a new node is added, it is also possible for rumor 2 to spread over the network.
195 citations
TL;DR: The proposed scheme is effective in achieving the expected chaos synchronization in the complex network and can be transformed to a linear matrix inequality and easily solved by a numerical toolbox.
Abstract: In this paper, a new approach for synchronization of complex dynamical networks is proposed based on state observer design. Unlike the common diagonally coupling networks, where full state coupling is typically needed between two nodes, here it is suggested that only a scalar coupling signal is required to achieve network synchronization. Some conditions for synchronization, in the form of an inequality, are established based on the Lyapunov stability theory, which can be transformed to a linear matrix inequality and easily solved by a numerical toolbox. Two typical dynamical network configurations, i.e., global coupling and nearest-neighbor coupling, with each node being a modified Chua's circuit, are simulated. It is demonstrated that the proposed scheme is effective in achieving the expected chaos synchronization in the complex network
160 citations
Cited by
More filters
TL;DR: A large-scale analysis of tweets reveals that false rumors spread further and faster than the truth, and false news was more novel than true news, which suggests that people were more likely to share novel information.
Abstract: We investigated the differential diffusion of all of the verified true and false news stories distributed on Twitter from 2006 to 2017. The data comprise ~126,000 stories tweeted by ~3 million people more than 4.5 million times. We classified news as true or false using information from six independent fact-checking organizations that exhibited 95 to 98% agreement on the classifications. Falsehood diffused significantly farther, faster, deeper, and more broadly than the truth in all categories of information, and the effects were more pronounced for false political news than for false news about terrorism, natural disasters, science, urban legends, or financial information. We found that false news was more novel than true news, which suggests that people were more likely to share novel information. Whereas false stories inspired fear, disgust, and surprise in replies, true stories inspired anticipation, sadness, joy, and trust. Contrary to conventional wisdom, robots accelerated the spread of true and false news at the same rate, implying that false news spreads more than the truth because humans, not robots, are more likely to spread it.
4,241 citations
TL;DR: A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Abstract: Complex networks arise in a wide range of biological and sociotechnical systems. Epidemic spreading is central to our understanding of dynamical processes in complex networks, and is of interest to physicists, mathematicians, epidemiologists, and computer and social scientists. This review presents the main results and paradigmatic models in infectious disease modeling and generalized social contagion processes.
3,173 citations
TL;DR: 5. M. Green, J. Schwarz, and E. Witten, Superstring theory, and An interpretation of classical Yang-Mills theory, Cambridge Univ.
Abstract: 5. M. Green, J. Schwarz, and E. Witten, Superstring theory, Cambridge Univ. Press, 1987. 6. J. Isenberg, P. Yasskin, and P. Green, Non-self-dual gauge fields, Phys. Lett. 78B (1978), 462-464. 7. B. Kostant, Graded manifolds, graded Lie theory, and prequantization, Differential Geometric Methods in Mathematicas Physics, Lecture Notes in Math., vol. 570, SpringerVerlag, Berlin and New York, 1977. 8. C. LeBrun, Thickenings and gauge fields, Class. Quantum Grav. 3 (1986), 1039-1059. 9. , Thickenings and conformai gravity, preprint, 1989. 10. C. LeBrun and M. Rothstein, Moduli of super Riemann surfaces, Commun. Math. Phys. 117(1988), 159-176. 11. Y. Manin, Critical dimensions of string theories and the dualizing sheaf on the moduli space of (super) curves, Funct. Anal. Appl. 20 (1987), 244-245. 12. R. Penrose and W. Rindler, Spinors and space-time, V.2, spinor and twistor methods in space-time geometry, Cambridge Univ. Press, 1986. 13. R. Ward, On self-dual gauge fields, Phys. Lett. 61A (1977), 81-82. 14. E. Witten, An interpretation of classical Yang-Mills theory, Phys. Lett. 77NB (1978), 394-398. 15. , Twistor-like transform in ten dimensions, Nucl. Phys. B266 (1986), 245-264. 16. , Physics and geometry, Proc. Internat. Congr. Math., Berkeley, 1986, pp. 267302, Amer. Math. Soc, Providence, R.I., 1987.
1,252 citations
TL;DR: It is proved that consensus tracking in the closed-loop multi-agent systems with a fixed topology having a directed spanning tree can be achieved if the feedback gain matrix and the coupling strength are suitably selected.
Abstract: Distributed consensus tracking is addressed in this paper for multi-agent systems with Lipschitz-type node dynamics. The main contribution of this work is solving the consensus tracking problem without the assumption that the topology among followers is strongly connected and fixed. By using tools from M-matrix theory, a class of consensus tracking protocols based only on the relative states among neighboring agents is designed. By appropriately constructing Lyapunov function, it is proved that consensus tracking in the closed-loop multi-agent systems with a fixed topology having a directed spanning tree can be achieved if the feedback gain matrix and the coupling strength are suitably selected. Furthermore, with the assumption that each possible topology contains a directed spanning tree, it is theoretically shown that consensus tracking under switching directed topologies can be achieved if the control parameters are suitably selected and the dwell time is larger than a positive threshold. The results are then extended to the case where the communication topology contains a directed spanning tree only frequently as the system evolves with time. Finally, some numerical simulations are given to verify the theoretical analysis.
705 citations
TL;DR: This work proposes an image cryptosystem employing the Arnold cat map for bit-level permutation and the logistic map for diffusion, demonstrating the superior security and high efficiency of this algorithm.
596 citations