This page has only limited features, please log in for full access.

Unclaimed
Wanlei Zhou
School of Information Technology, Deakin University, Australia. s:

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Book
Published: 01 January 2019 in Advances in Information Security
Reads 0
Downloads 0

This book covers and makes four major contributions: 1) analyzing and surveying the pros and cons of current approaches for identifying rumor sources on complex networks; 2) proposing a novel approach to identify rumor sources in time-varying networks; 3) developing a fast approach to identify multiple rumor sources; 4) proposing a community-based method to overcome the scalability issue in this research area. These contributions enable rumor source identification to be applied effectively in real-world networks, and eventually diminish rumor damages, which the authors rigorously illustrate in this book. In the modern world, the ubiquity of networks has made us vulnerable to various risks. For instance, viruses propagate throughout the Internet and infect millions of computers. Misinformation spreads incredibly fast in online social networks, such as Facebook and Twitter. Infectious diseases, such as SARS, H1N1 or Ebola, have spread geographically and killed hundreds of thousands people. In essence, all of these situations can be modeled as a rumor spreading through a network, where the goal is to find the source of the rumor so as to control and prevent network risks. So far, extensive work has been done to develop new approaches to effectively identify rumor sources. However, current approaches still suffer from critical weaknesses. The most serious one is the complex spatiotemporal diffusion process of rumors in time-varying networks, which is the bottleneck of current approaches. The second problem lies in the expensively computational complexity of identifying multiple rumor sources. The third important issue is the huge scale of the underlying networks, which makes it difficult to develop efficient strategies to quickly and accurately identify rumor sources. These weaknesses prevent rumor source identification from being applied in a broader range of real-world applications. This book aims to analyze and address these issues to make rumor source identification more effective and applicable in the real world. The authors propose a novel reverse dissemination strategy to narrow down the scale of suspicious sources, which dramatically promotes the efficiency of their method. The authors then develop a Maximum-likelihood estimator, which can pin point the true source from the suspects with high accuracy. For the scalability issue in rumor source identification, the authors explore sensor techniques and develop a community structure based method. Then the authors take the advantage of the linear correlation between rumor spreading time and infection distance, and develop a fast method to locate the rumor diffusion source. Theoretical analysis proves the efficiency of the proposed method, and the experiment results verify the significant advantages of the proposed method in large-scale networks. This book targets graduate and post-graduate students studying computer science and networking. Researchers and professionals working in network security, propagation models and other related topics, will also be interested in this book.

ACS Style

Jiaojiao Jiang; Sheng Wen; Bo Liu; Shui Yu; Yang Xiang; Wanlei Zhou. Malicious Attack Propagation and Source Identification. Advances in Information Security 2019, 1 .

AMA Style

Jiaojiao Jiang, Sheng Wen, Bo Liu, Shui Yu, Yang Xiang, Wanlei Zhou. Malicious Attack Propagation and Source Identification. Advances in Information Security. 2019; ():1.

Chicago/Turabian Style

Jiaojiao Jiang; Sheng Wen; Bo Liu; Shui Yu; Yang Xiang; Wanlei Zhou. 2019. "Malicious Attack Propagation and Source Identification." Advances in Information Security , no. : 1.

Journal article
Published: 01 January 2018 in Computer Systems Science and Engineering
Reads 0
Downloads 0
ACS Style

Tianqing Zhu; Mengmeng Yang; Ping Xiong; Yang Xiang; Wanlei Zhou. An Iteration-Based Differentially Private Social Network Data Release. Computer Systems Science and Engineering 2018, 33, 61 -69.

AMA Style

Tianqing Zhu, Mengmeng Yang, Ping Xiong, Yang Xiang, Wanlei Zhou. An Iteration-Based Differentially Private Social Network Data Release. Computer Systems Science and Engineering. 2018; 33 (2):61-69.

Chicago/Turabian Style

Tianqing Zhu; Mengmeng Yang; Ping Xiong; Yang Xiang; Wanlei Zhou. 2018. "An Iteration-Based Differentially Private Social Network Data Release." Computer Systems Science and Engineering 33, no. 2: 61-69.

Conference paper
Published: 09 December 2017 in Computer Vision
Reads 0
Downloads 0

Smart car parking systems in smart cities aim to provide high-quality services to their users. The key to success for smart car parking systems is the ability to predict available car parking lots throughout the city at different times. Drivers can then select a suitable car parking location. However, the prediction process can be affected by many different factors in smart cities such as people mobility and car traffic. This study investigates the use of multi-source data (car parking data, pedestrian data, car traffic data) to predict available car parking in fifteen minute intervals. It explores the relationship between pedestrian volume and demand for car parking in specific areas. This data is then used to predict conditions on holidays and during special events, when the number of pedestrians dramatically increases. A Gradient Boosting Regression Trees (GBRT) is used for prediction. It is an ensemble method that can be more accurate than a single Regression Tree and Support Vector Regression. The probability of error for our model is 0.0291.

ACS Style

Walaa Alajali; Sheng Wen; Wanlei Zhou. On-Street Car Parking Prediction in Smart City: A Multi-source Data Analysis in Sensor-Cloud Environment. Computer Vision 2017, 641 -652.

AMA Style

Walaa Alajali, Sheng Wen, Wanlei Zhou. On-Street Car Parking Prediction in Smart City: A Multi-source Data Analysis in Sensor-Cloud Environment. Computer Vision. 2017; ():641-652.

Chicago/Turabian Style

Walaa Alajali; Sheng Wen; Wanlei Zhou. 2017. "On-Street Car Parking Prediction in Smart City: A Multi-source Data Analysis in Sensor-Cloud Environment." Computer Vision , no. : 641-652.

Journal article
Published: 01 July 2017 in Computer Networks
Reads 0
Downloads 0

We propose a secure RFID tag search protocol that ensures the security and privacy of the tags being searched. To our knowledge, not much work has been done in this area of RFID systems. Further, most of the current methods do not comply with the EPC standard as they use expensive hash operations or encryption schemes that cannot be implemented on resource-constrained, low-cost passive tags. Our work aims to fill this gap by proposing a protocol based on quadratic residues which requires the tags to perform only simple XOR, MOD and 128 bit PRNG operations, thus achieving compliance with EPC standards. Our protocol also addresses the vulnerabilities in the protocol proposed by Sundaresan et al. (2012) [1] which is not forward secure, and the weak message construction leading to incorrect tag authentication. We present a detailed security analysis to show that the proposed method achieves the required security properties and the simulation results show that the proposed method is scalable.

ACS Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Selwyn Piramuthu; Wanlei Zhou. A secure search protocol for low cost passive RFID tags. Computer Networks 2017, 122, 70 -82.

AMA Style

Saravanan Sundaresan, Robin Ram Mohan Doss, Selwyn Piramuthu, Wanlei Zhou. A secure search protocol for low cost passive RFID tags. Computer Networks. 2017; 122 ():70-82.

Chicago/Turabian Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Selwyn Piramuthu; Wanlei Zhou. 2017. "A secure search protocol for low cost passive RFID tags." Computer Networks 122, no. : 70-82.

Editorial
Published: 13 September 2016 in Entropy
Reads 0
Downloads 0

Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp) has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational problems on cryptography and security, practical technologies; applications and services for Ubi-comp including secure encryption techniques, identity and authentication; credential cloning attacks and countermeasures; switching generator with resistance against the algebraic and side channel attacks; entropy-based network anomaly detection; applied cryptography using chaos function, information hiding and watermark, secret sharing, message authentication, detection and modeling of cyber attacks with Petri Nets, and quantum flows for secret key distribution, etc.

ACS Style

James (Jong Hyuk) Park; Wanlei Zhou. Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing. Entropy 2016, 18, 334 .

AMA Style

James (Jong Hyuk) Park, Wanlei Zhou. Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing. Entropy. 2016; 18 (9):334.

Chicago/Turabian Style

James (Jong Hyuk) Park; Wanlei Zhou. 2016. "Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing." Entropy 18, no. 9: 334.

Journal article
Published: 01 June 2016 in Journal of Computer and System Sciences
Reads 0
Downloads 0

GPS trajectory dataset with high sampling-rates is usually in large volume that challenges the processing efficiency. Most of the data points on trajectories are useless. This paper summarizes trajectories using stop points. We define a new concept of stay stability (i.e., time dividing distance or reciprocal of speed) between any two GPS points to detect stop points on individual trajectories. We propose a novel Mining Repeat Travel Behaviors Using Stop Regions (MRTBUSR) method. In MRTBUSR, a stop region is a popular region containing a certain number of close stop points that can be grouped into a cluster. We then retrieve common sequences of stop regions to denote repeat route patterns and further analyze the stop durations on a stop region to find repeat travel behaviors. The experiments on 20 labeled trajectories selected from GeoLife demonstrated the semantic effect, accuracy and near linear efficiency of our proposed method.

ACS Style

Guangyan Huang; Jing He; Wanlei Zhou; Guang-Li Huang; Limin Guo; Xiangmin Zhou; Feiyi Tang. Discovery of stop regions for understanding repeat travel behaviors of moving objects. Journal of Computer and System Sciences 2016, 82, 582 -593.

AMA Style

Guangyan Huang, Jing He, Wanlei Zhou, Guang-Li Huang, Limin Guo, Xiangmin Zhou, Feiyi Tang. Discovery of stop regions for understanding repeat travel behaviors of moving objects. Journal of Computer and System Sciences. 2016; 82 (4):582-593.

Chicago/Turabian Style

Guangyan Huang; Jing He; Wanlei Zhou; Guang-Li Huang; Limin Guo; Xiangmin Zhou; Feiyi Tang. 2016. "Discovery of stop regions for understanding repeat travel behaviors of moving objects." Journal of Computer and System Sciences 82, no. 4: 582-593.

Journal article
Published: 18 November 2015 in Web Intelligence
Reads 0
Downloads 0

Tagging recommender systems allow Internet users to annotate resources with personalized tags. The connection among users, resources and these annotations, often called a folksonomy, permits users the freedom to explore tags, and to obtain recommendations. Releasing these tagging datasets accelerates both commercial and research work on recommender systems. However, tagging recommender systems has been confronted with serious privacy concerns because adversaries may re-identify a user and her/his sensitive information from the tagging dataset using a little background information. Recently, several private techniques have been proposed to address the problem, but most of them lack a strict privacy notion, and can hardly resist the number of possible attacks. This paper proposes an private releasing algorithm to perturb users\u27 profile in a strict privacy notion, differential privacy, with the goal of preserving a user\u27s identity in a tagging dataset. The algorithm includes three privacy-preserving operations: Private Tag Clustering is used to shrink the randomized domain and Private Tag Selection is then applied to find the most suitable replacement tags for the original tags. To hide the numbers of tags, the third operation, Weight Perturbation, finally adds Laplace noise to the weight of tags. We present extensive experimental results on two real world datasets, De.licio.us and Bibsonomy. While the personalization algorithm is successful in both cases, our results further suggest the private releasing algorithm can successfully retain the utility of the datasets while preserving users\u27 identity

ACS Style

Tianqing Zhu; Gang Li; Yongli Ren; Wanlei Zhou; Ping Xiong. Privacy preserving data release for tagging recommender systems. Web Intelligence 2015, 13, 229 -246.

AMA Style

Tianqing Zhu, Gang Li, Yongli Ren, Wanlei Zhou, Ping Xiong. Privacy preserving data release for tagging recommender systems. Web Intelligence. 2015; 13 (4):229-246.

Chicago/Turabian Style

Tianqing Zhu; Gang Li; Yongli Ren; Wanlei Zhou; Ping Xiong. 2015. "Privacy preserving data release for tagging recommender systems." Web Intelligence 13, no. 4: 229-246.

Articles
Published: 01 September 2015 in International Journal of Parallel, Emergent and Distributed Systems
Reads 0
Downloads 0

Database query verification schemes provide correctness guarantees for database queries. Typically such guarantees are required and advisable where queries are executed on untrusted servers. This need to verify query results, even though they may have been executed on one’s own database, is something new that has arisen with the advent of cloud services. The traditional model of hosting one’s own databases on one’s own servers did not require such verification because the hardware and software were both entirely within one’s control, and therefore fully trusted. However, with the economical and technological benefits of cloud services beckoning, many are now considering outsourcing both data and execution of database queries to the cloud, despite obvious risks. This survey paper provides an overview into the field of database query verification and explores the current state of the art in terms of query execution and correctness guarantees provided for query results. We also provide indications towards future work in the area.

ACS Style

Faizal Riaz-Ud-Din; Wanlei Zhou; Robin Ram Mohan Doss. Query verification schemes for cloud-hosted databases: a brief survey. International Journal of Parallel, Emergent and Distributed Systems 2015, 31, 543 -561.

AMA Style

Faizal Riaz-Ud-Din, Wanlei Zhou, Robin Ram Mohan Doss. Query verification schemes for cloud-hosted databases: a brief survey. International Journal of Parallel, Emergent and Distributed Systems. 2015; 31 (6):543-561.

Chicago/Turabian Style

Faizal Riaz-Ud-Din; Wanlei Zhou; Robin Ram Mohan Doss. 2015. "Query verification schemes for cloud-hosted databases: a brief survey." International Journal of Parallel, Emergent and Distributed Systems 31, no. 6: 543-561.

Journal article
Published: 09 January 2015 in IEEE Transactions on Computers
Reads 0
Downloads 0

In this paper, we propose a novel zero knowledge grouping proof protocol for RFID Systems. Over the years, several protocols have been proposed in this area but they are either found to be vulnerable to certain attacks or do not comply with the EPC Class 1 Gen 2 (C1G2) standard because they use hash functions or other complex encryption schemes. Also, the unique design requirements of grouping proofs have not been fully addressed by many. Our protocol addresses these important security and design gaps in grouping proofs. We present a novel approach based on pseudo random squares and quadratic residuosity to realize a zero knowledge system. Tag operations are limited to functions such as modulo (MOD), exclusive-or (XOR) and 128 bit Pseudo Random Number Generators (PRNG). These can be easily implemented on passive tags and hence achieves compliance with the EPC Global standard while meeting the security requirements.

ACS Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Wanlei Zhou. Zero Knowledge Grouping Proof Protocol for RFID EPC C1G2 Tags. IEEE Transactions on Computers 2015, 64, 1 -1.

AMA Style

Saravanan Sundaresan, Robin Ram Mohan Doss, Wanlei Zhou. Zero Knowledge Grouping Proof Protocol for RFID EPC C1G2 Tags. IEEE Transactions on Computers. 2015; 64 (10):1-1.

Chicago/Turabian Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Wanlei Zhou. 2015. "Zero Knowledge Grouping Proof Protocol for RFID EPC C1G2 Tags." IEEE Transactions on Computers 64, no. 10: 1-1.

Book chapter
Published: 01 January 2015 in Mobile Health
Reads 0
Downloads 0

Radio Frequency Identification (RFID) enables automatic identification of objects using radio waves. The identified objects can be in and out of the line of sight and there is no need for physical contact with them. RFID technology is deployed in a wide range of industries such as supply chain management, inventory control, farming (to track animals), e-Passports, the tracking of humans (in prisons and hospitals) and in healthcare [1]. The three key elements of an RFID system are the tags, readers and the backend server. Tags are devices physically attached to objects and readers (wired or mobile) recognize the presence of objects in its range.

ACS Style

Saravanan Sundaresan; Robin Doss; Wanlei Zhou. RFID in Healthcare – Current Trends and the Future. Mobile Health 2015, 5, 839 -870.

AMA Style

Saravanan Sundaresan, Robin Doss, Wanlei Zhou. RFID in Healthcare – Current Trends and the Future. Mobile Health. 2015; 5 ():839-870.

Chicago/Turabian Style

Saravanan Sundaresan; Robin Doss; Wanlei Zhou. 2015. "RFID in Healthcare – Current Trends and the Future." Mobile Health 5, no. : 839-870.

Journal article
Published: 15 December 2014 in Security and Communication Networks
Reads 0
Downloads 0
ACS Style

Xueqi Cheng; Jinhong Yuan; Ali Tajer; Aiqun Hu; Wanlei Zhou. Special issue on recent advances in network and information security-security and communication networks journal. Security and Communication Networks 2014, 8, 1 -1.

AMA Style

Xueqi Cheng, Jinhong Yuan, Ali Tajer, Aiqun Hu, Wanlei Zhou. Special issue on recent advances in network and information security-security and communication networks journal. Security and Communication Networks. 2014; 8 (1):1-1.

Chicago/Turabian Style

Xueqi Cheng; Jinhong Yuan; Ali Tajer; Aiqun Hu; Wanlei Zhou. 2014. "Special issue on recent advances in network and information security-security and communication networks journal." Security and Communication Networks 8, no. 1: 1-1.

Journal article
Published: 04 June 2014 in World Wide Web
Reads 0
Downloads 0

Streams of short text, such as news titles, enable us to effectively and efficiently learn the real world events that occur anywhere and anytime. Short text messages that are companied by timestamps and generally brief events using only a few words differ from other longer text documents, such as web pages, news stories, blogs, technical papers and books. For example, few words repeat in the same news titles, thus frequency of the term (i.e., TF) is not as important in short text corpus as in longer text corpus. Therefore, analysis of short text faces new challenges. Also, detecting and tracking events through short text analysis need to reliably identify events from constant topic clusters; however, existing methods, such as Latent Dirichlet Allocation (LDA), generates different topic results for a corpus at different executions. In this paper, we provide a Finding Topic Clusters using Co-occurring Terms (FTCCT) algorithm to automatically generate topics from a short text corpus, and develop an Event Evolution Mining (EEM) algorithm to discover hot events and their evolutions (i.e., the popularity degrees of events changing over time). In FTCCT, a term (i.e., a single word or a multiple-words phrase) belongs to only one topic in a corpus. Experiments on news titles of 157 countries within 4 months (from July to October, 2013) demonstrate that our FTCCT-based method (combining FTCCT and EEM) achieves far higher quality of the event's content and description words than LDA-based method (combining LDA and EEM) for analysis of streams of short text. Our method also visualizes the evolutions of the hot events. The discovered world-wide event evolutions have explored some interesting correlations of the world-wide events; for example, successive extreme weather phenomenon occur in different locations - typhoon in Hong Kong and Philippines followed hurricane and storm flood in Mexico in September 2013.

ACS Style

Guangyan Huang; Jing He; Yanchun Zhang; Wanlei Zhou; Hai Liu; Peng Zhang; Zhiming Ding; Yue You; Jian Cao. Mining streams of short text for analysis of world-wide event evolutions. World Wide Web 2014, 18, 1201 -1217.

AMA Style

Guangyan Huang, Jing He, Yanchun Zhang, Wanlei Zhou, Hai Liu, Peng Zhang, Zhiming Ding, Yue You, Jian Cao. Mining streams of short text for analysis of world-wide event evolutions. World Wide Web. 2014; 18 (5):1201-1217.

Chicago/Turabian Style

Guangyan Huang; Jing He; Yanchun Zhang; Wanlei Zhou; Hai Liu; Peng Zhang; Zhiming Ding; Yue You; Jian Cao. 2014. "Mining streams of short text for analysis of world-wide event evolutions." World Wide Web 18, no. 5: 1201-1217.

Journal article
Published: 01 June 2014 in Social Network Analysis and Mining
Reads 0
Downloads 0

Privacy preserving is an essential aspect of modern recommender systems. However, the traditional approaches can hardly provide a rigid and provable privacy guarantee for recommender systems, especially for those systems based on collaborative filtering (CF) methods. Recent research revealed that by observing the public output of the CF, the adversary could infer the historical ratings of the particular user, which is known as the KNN attack and is considered a serious privacy violation for recommender systems. This paper addresses the privacy issue in CF by proposing a Private Neighbor Collaborative Filtering (PriCF) algorithm, which is constructed on the basis of the notion of differential privacy. PriCF contains an essential privacy operation, Private Neighbor Selection, in which the Laplace noise is added to hide the identity of neighbors and the ratings of each neighbor. To retain the utility, the Recommendation-Aware Sensitivity and a re-designed truncated similarity are introduced to enhance the performance of recommendations. A theoretical analysis shows that the proposed algorithm can resist the KNN attack while retaining the accuracy of recommendations. The experimental results on two real datasets show that the proposed PriCF algorithm retains most of the utility with a fixed privacy budget

ACS Style

Tianqing Zhu; Gang Li; Lei Pan; Yongli Ren; Wanlei Zhou. Privacy preserving collaborative filtering for KNN attack resisting. Social Network Analysis and Mining 2014, 4, 1 -14.

AMA Style

Tianqing Zhu, Gang Li, Lei Pan, Yongli Ren, Wanlei Zhou. Privacy preserving collaborative filtering for KNN attack resisting. Social Network Analysis and Mining. 2014; 4 (1):1-14.

Chicago/Turabian Style

Tianqing Zhu; Gang Li; Lei Pan; Yongli Ren; Wanlei Zhou. 2014. "Privacy preserving collaborative filtering for KNN attack resisting." Social Network Analysis and Mining 4, no. 1: 1-14.

Journal article
Published: 09 April 2014 in IEEE Transactions on Information Forensics and Security
Reads 0
Downloads 0

Several grouping proof protocols for RFID systems have been proposed over the years but they are either found to be vulnerable to certain attacks or do not comply with the EPC class-1 gen-2 (C1G2) standard because they use hash functions or other complex encryption schemes. Among other requirements, synchronization of keys, simultaneity, dependence, detecting illegitimate tags, eliminating unwanted tag processing, and denial-of-proof attacks have not been fully addressed by many. Our protocol addresses these important gaps by taking a holistic approach to grouping proofs and provides forward security, which is an open research issue. The protocol is based on simple (XOR) encryption and 128-bit pseudorandom number generators, operations that can be easily implemented on low-cost passive tags. Thus, our protocol enables large-scale implementations and achieves EPC C1G2 compliance while meeting the security requirements.

ACS Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Selwyn Piramuthu; Wanlei Zhou. A Robust Grouping Proof Protocol for RFID EPC C1G2 Tags. IEEE Transactions on Information Forensics and Security 2014, 9, 961 -975.

AMA Style

Saravanan Sundaresan, Robin Ram Mohan Doss, Selwyn Piramuthu, Wanlei Zhou. A Robust Grouping Proof Protocol for RFID EPC C1G2 Tags. IEEE Transactions on Information Forensics and Security. 2014; 9 (6):961-975.

Chicago/Turabian Style

Saravanan Sundaresan; Robin Ram Mohan Doss; Selwyn Piramuthu; Wanlei Zhou. 2014. "A Robust Grouping Proof Protocol for RFID EPC C1G2 Tags." IEEE Transactions on Information Forensics and Security 9, no. 6: 961-975.

Conference paper
Published: 01 January 2011 in Computer Vision
Reads 0
Downloads 0

Active Peer-to-Peer worms are great threat to the network security since they can propagate in automated ways and flood the Internet within a very short duration. Modeling a propagation process can help us to devise effective strategies against a worm’s spread. This paper presents a study on modeling a worm’s propagation probability in a P2P overlay network and proposes an optimized patch strategy for defenders. Firstly, we present a probability matrix model to construct the propagation of P2P worms. Our model involves three indispensible aspects for propagation: infected state, vulnerability distribution and patch strategy. Based on a fully connected graph, our comprehensive model is highly suited for real world cases like Code Red II. Finally, by inspecting the propagation procedure, we propose four basic tactics for defense of P2P botnets. The rationale is exposed by our simulated experiments and the results show these tactics are of effective and have considerable worth in being applied in real-world networks

ACS Style

Yini Wang; Sheng Wen; Wei Zhou; Wanlei Zhou; Yang Xiang. The Probability Model of Peer-to-Peer Botnet Propagation. Computer Vision 2011, 7016, 470 -480.

AMA Style

Yini Wang, Sheng Wen, Wei Zhou, Wanlei Zhou, Yang Xiang. The Probability Model of Peer-to-Peer Botnet Propagation. Computer Vision. 2011; 7016 ():470-480.

Chicago/Turabian Style

Yini Wang; Sheng Wen; Wei Zhou; Wanlei Zhou; Yang Xiang. 2011. "The Probability Model of Peer-to-Peer Botnet Propagation." Computer Vision 7016, no. : 470-480.

Conference paper
Published: 01 January 2008 in Computer Vision
Reads 0
Downloads 0

This tutorial introduces the challenges of modern security-related applications and the opportunities that multi-core technology brings. We envision that multi-core supported security applications will become the killer applications for next generation personal computers.

ACS Style

Wanlei Zhou; Yang Xiang. Using Multi-core to Support Security-Related Applications. Computer Vision 2008, 316 -317.

AMA Style

Wanlei Zhou, Yang Xiang. Using Multi-core to Support Security-Related Applications. Computer Vision. 2008; ():316-317.

Chicago/Turabian Style

Wanlei Zhou; Yang Xiang. 2008. "Using Multi-core to Support Security-Related Applications." Computer Vision , no. : 316-317.