+publisher:"University of Adelaide" +contributor:("Shen, Hong")

University of Adelaide

1. Li, Yidong. Preserving privacy in data publishing and analysis.

Degree: 2011, University of Adelaide

► As data collection and storage techniques being greatly improved, data analysis is becoming an increasingly important issue in many business and academic collaborations that enhances… (more)

▼ As data collection and storage techniques being greatly improved, data analysis is becoming an increasingly important issue in many business and academic collaborations that enhances their productivity and competitiveness. Multiple techniques for data analysis, such as data mining, business intelligence, statistical analysis and predictive analytics, have been developed in different science, commerce and social science domains. To ensure quality data analysis, effective information sharing between organizations becomes a vital requirement in today’s society. However, the shared data often contains person-specific and sensitive information like medical records. As more and more realworld datasets are released publicly, there is a growing concern about privacy breaches for the entities involved. To respond to this challenge, this thesis discusses the problem of eliminating privacy threats while, at the same time, preserving useful information in the released database for data analysis. The first part of this thesis discuss the problem of privacy preservation on relational data. Due to the inherent drawbacks of applying equi-depth data swapping in distancebased data analysis, we study efficient swapping algorithms based on equi-width partitioning for relational data publishing. We develop effective methods for both univariate and multivariate data swapping. With extensive theoretical analysis and experimental validation, we show that, Equi-Width Swapping (EWS) can achieve a similar performance in privacy preservation to that of Equi-Depth Swapping (EDS) if the number of partitions is sufficiently large (e.g. ≳ √n, where n is the size of dataset). In addition, our analysis shows that the multivariate EWS algorithm has much lower computational complexity O(n) than that of the multivariate EDS (which is O(n³) basically), while it still provides good protection for sensitive information. The second part of this thesis focuses on solving the problem of privacy preservation on graphs, which has increasing significance as more and more real-world graphs modelling complex systems such as social networks are released publicly, . We point out that the real labels of a large portion of nodes can be easily re-identified with some weight-related attacks in a weighted graph, even the graph is perturbed with weight-independent invariants like degree. Two concrete attacks have been identified based on the following elementary weight invariants: 1) volume: the sum of adjacent weights for a vertex; and 2) histogram: the neighborhood weight distribution of a vertex. In order to protect a graph from these attacks, we formalize a general model for weighted graph anonymization and provide efficient methods with respect to a two-step framework including property anonymization and graph reconstruction. Moreover, we theoretically prove the histogram anonymization problem is NP-hard in the general case, and present an efficient heuristic algorithm for this problem running in near-quadratic time on graph size. The final part of this thesis turns… Advisors/Committee Members: Shen, Hong (advisor), Sheng, Michael (advisor), School of Computer Science (school).

Subjects/Keywords: privacy preserving techniques; private data publishing; anonymization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, Y. (2011). Preserving privacy in data publishing and analysis. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/68556

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Li, Yidong. “Preserving privacy in data publishing and analysis.” 2011. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/68556.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Li, Yidong. “Preserving privacy in data publishing and analysis.” 2011. Web. 12 Apr 2021.

Vancouver:

Li Y. Preserving privacy in data publishing and analysis. [Internet] [Thesis]. University of Adelaide; 2011. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/68556.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Y. Preserving privacy in data publishing and analysis. [Thesis]. University of Adelaide; 2011. Available from: http://hdl.handle.net/2440/68556

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

2. Noor, Talal Hashem. Credibility-based trust management and discovery of cloud services.

Degree: 2013, University of Adelaide

URL: http://hdl.handle.net/2440/84252

► Cloud computing is gaining a considerable momentum as a new computing paradigm for providing flexible and on-demand infrastructures, platforms and software as services. The trust… (more)

▼ Cloud computing is gaining a considerable momentum as a new computing paradigm for providing flexible and on-demand infrastructures, platforms and software as services. The trust management of services issues attracted many researchers in the past years. However, in cloud computing, with the highly dynamic, distributed and non-transparent nature of cloud services, this research area has gained a considerable significance. Robust trust management approaches will be essential in establishing trust between cloud service consumers and providers and will significantly contribute to the adoption and growth of cloud computing. In this dissertation, we present a novel approach for credibility-based trust management and automatic discovery of cloud services in distributed and highly dynamic environments. We first propose a Zero-Knowledge Credibility Proof Protocol to prove the credibility of consumers’ feedback without breaching consumers’ privacy. We then propose an adaptive and robust Credibility Model for assessing the consumers’ credibility in giving feedback to cloud services. To measure how experienced a consumer would be, we use the concepts of Consumer Capability and Majority Consensus. We further introduce the concepts of Feedback Density and Occasional Feedback Collusion to detect strategic and occasional behaviors of collusion attacks. To detect Sybil attacks, we introduce the concepts of Multi-Identity Recognition and Occasional Sybil Attacks. To adjust trust results for cloud services that have been affected by malicious behaviors, we introduce the concept of Change Rate of Trust. We then propose a scalable Availability Model to manage the availability of the decentralized implementation of the trust management service. To share the workload between the trust management service nodes, we use the concept of load balancing thereby always maintaining a desired availability level. We introduce the concept of operational power to determine the optimal number of nodes and exploit particle filtering to precisely predict the availability of each node and determine the optimal number of replicas for each node. The techniques presented in this dissertation are implemented in Cloud Armor, a prototype that provides a set of functionalities to deliver Trust as a Service (TaaS). Finally, we conduct extensive experimental and performance studies of the proposed techniques using a collection of real-world trust feedbacks on cloud services. We particularly develop a Cloud Service Crawler Engine for cloud services collection. The collected datasets include meta-data of nearly 6,000 real-world cloud services (1.06GB). The experimental results shows that our system i) is able to effectively distinguish between feedbacks from experienced and amateur consumers; ii) is more adaptive and robust in trust calculations by effectively detecting collusion and Sybil attacks without breaching consumers’ privacy no matter attacks occur in a strategic or occasional behavior; iii) is more scalable and maintains a desired availability level in… Advisors/Committee Members: Sheng, Michael (advisor), Shen, Hong (advisor), School of Computer Science (school).

Subjects/Keywords: trust management; cloud service discovery; credibility

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Noor, T. H. (2013). Credibility-based trust management and discovery of cloud services. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/84252

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Noor, Talal Hashem. “Credibility-based trust management and discovery of cloud services.” 2013. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/84252.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Noor, Talal Hashem. “Credibility-based trust management and discovery of cloud services.” 2013. Web. 12 Apr 2021.

Vancouver:

Noor TH. Credibility-based trust management and discovery of cloud services. [Internet] [Thesis]. University of Adelaide; 2013. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/84252.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Noor TH. Credibility-based trust management and discovery of cloud services. [Thesis]. University of Adelaide; 2013. Available from: http://hdl.handle.net/2440/84252

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

3. Lu, Zhigang. Differentially Private Data Analytics.

Degree: 2021, University of Adelaide

URL: http://hdl.handle.net/2440/129873

► With the emergence of smart devices and data-driven applications, personal data are being dramatically generated, gathered and used by modern systems for data analytics in… (more)

▼ With the emergence of smart devices and data-driven applications, personal data are being dramatically generated, gathered and used by modern systems for data analytics in a wide range of customised service applications. Despite the advantages of data analytics, potential risks arise that allow adversaries to infer individuals’ private information by using some auxiliary information. Therefore, it is crucial to develop new methods and techniques for privacy-preserving data analytics that ensure acceptable trade-offs between privacy and utility. Over the last decade, differential privacy (DP) has been viewed as a promising notion of privacy because it mathematically bounds the trade-off between privacy and utility against adversaries’ strong inference attacks (n−1 out of n items in the input). By exploring the latest results of differentially private data analytics, this thesis concentrates on four sub-topics: differentially private data aggregation with security guarantees, privacy budget guarantees in distributed systems, differentially private single-path publishing and differentially private k-means clustering. For differentially private data aggregation with security guarantees, we propose a twolayer data aggregation approach against semi-honest but colluding data aggregators, where DP noise is randomly injected. We address the problems of the collusion of data curators and data aggregators. The key idea of our approach is injecting DP noise randomly to prevent privacy disclosure from collusion, while maintaining a high degree of utility and splitting and sharing data pieces to guarantee security. The experimental evaluations over synthetic datasets confirm our mathematical analysis results and show that our approach achieves enhanced aggregation utility. For privacy budget guarantees in distributed systems, we study the parallel composition of privacy budget in differentially private data aggregation scenarios. We propose a new lower bound of the parallel composition of privacy budgets. We address two problems of the state-of-the-art: poor utility when using global sensitivity for both data curators and data aggregators and unknown privacy guarantees with conditions on the local sensitivities between data curators and data aggregators. The key is taking a property of the summation function: the local sensitivity of summation for a dataset is equal to the maximum summation of any sub-dataset. The experimental results over a real-life dataset support our theoretical results of the proposed lower bound of the unconditional parallel composition of privacy budget. For differentially private single-path publishing, we propose a graph-based single-path publishing approach with DP guarantees. We address two problems in existing work: information loss regarding the exact path for genuine users and no privacy guarantees for edges when adversaries have information about all vertices, yet one edge is missing. The main idea is adding fake vertices and edges into the real path by DP, and then hiding connections in the… Advisors/Committee Members: Shen, Hong (advisor), Sheng, Michael (advisor), School of Computer Science (school).

Subjects/Keywords: Differential privacy; data analytics; data aggregation; trajectory publishing; clustering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lu, Z. (2021). Differentially Private Data Analytics. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/129873

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lu, Zhigang. “Differentially Private Data Analytics.” 2021. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/129873.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lu, Zhigang. “Differentially Private Data Analytics.” 2021. Web. 12 Apr 2021.

Vancouver:

Lu Z. Differentially Private Data Analytics. [Internet] [Thesis]. University of Adelaide; 2021. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/129873.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu Z. Differentially Private Data Analytics. [Thesis]. University of Adelaide; 2021. Available from: http://hdl.handle.net/2440/129873

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

4. Le, Ba Dung. Community detection in complex networks.

Degree: 2018, University of Adelaide

URL: http://hdl.handle.net/2440/117956

► Complex networks such as social networks and biological networks represent complex systems in the real world. These networks usually consist of communities which are groups… (more)

▼ Complex networks such as social networks and biological networks represent complex systems in the real world. These networks usually consist of communities which are groups of nodes with dense connections among nodes in the same group and sparse connections between nodes in different groups. Identifying communities in complex networks is useful for many real-world applications. Numerous community detection approaches have been investigated over the past decades. Modularity is a well-known function to measure the quality of a network division into communities. The most popular detection approach is modularity optimization that identifes communities by finding the community division with highest modularity over all possible community divisions of the network. Current state-of-the-art algorithms for maximizing modularity perform well on networks of strong communities, which have more intra-community connections than inter-community connections. However, these algorithms tend to get trapped in a poor local maximum on networks with weak communities, which have more inter-community connections than intra-community connections. In the first part of this thesis, we develop a new algorithm for maximizing modularity in networks with weak communities. Our proposed algorithm extends the state-of-the-art algorithm LPAm+ by introducing a method to escape local maximum. Our algorithm follows a guided search strategy inspired by the record-to- record travel algorithm for a trade-off between performance and complexity. Experimental results show that our proposed algorithm, named meta-LPAm+, outperforms state-of-the-art algorithms, in terms of modularity, on networks with weak communities while retaining a comparable performance on networks of strong communities. In the second part of this thesis, we study the problem of evaluating community detection algorithms. Evaluating the detection algorithms on networks with known communities is important to estimate the accuracy of the algorithms and to compare different algorithms. Since there are currently only a small number of real networks with known communities available, the detection algorithms are most dominantly tested on synthetic networks with built-in community structure. Current benchmarks, that generate networks with built-in community structure, assign the same fraction of inter-community connections, referred to as the mixing fraction, for every community in the same network and ignore the presence of noise, or outliers. These existing benchmarks, therefore, cannot capture properties of nodes and communities in real networks. We address this issue by proposing a new benchmark that accounts for the heterogeneity in community mixing fractions and the presence of outliers. Our proposed benchmark extends the state-of-the-art benchmark LFR by incorporating heterogeneous community mixing fractions and outliers. We use our new benchmark to evaluate the performances of existing community detection algorithms. The results show that the variation in community mixing fractions and… Advisors/Committee Members: Shen, Hong (advisor), Falkner, Nickolas (advisor), Nguyen, Hung (advisor), School of Computer Science (school).

Subjects/Keywords: Community detection; complex networks; network clustering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Le, B. D. (2018). Community detection in complex networks. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/117956

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Le, Ba Dung. “Community detection in complex networks.” 2018. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/117956.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Le, Ba Dung. “Community detection in complex networks.” 2018. Web. 12 Apr 2021.

Vancouver:

Le BD. Community detection in complex networks. [Internet] [Thesis]. University of Adelaide; 2018. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/117956.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Le BD. Community detection in complex networks. [Thesis]. University of Adelaide; 2018. Available from: http://hdl.handle.net/2440/117956

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

5. Lu, Zhigang. Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms.

Degree: 2015, University of Adelaide

URL: http://hdl.handle.net/2440/98720

► Recommender systems, which recommend users the potentially preferred items by aggregating similar interest neighbours’ history data, show an increasing importance in various Internet applications. As… (more)

▼ Recommender systems, which recommend users the potentially preferred items by aggregating similar interest neighbours’ history data, show an increasing importance in various Internet applications. As a well-known method in recommender systems, neighbourhood-based collaborative filtering has received considerable attention recently because of its easy implementation and high recommendation accuracy. However, the risks of revealing customers’ privacy during the process of filtering have attracted noticeable public concern. Specifically, the kNN attack discloses the target user’s sensitive information by creating k fake nearest neighbours by non-sensitive information. Among the current solutions against the kNN attack, probabilistic methods showed a powerful privacy preserving effect. However, the existing probabilistic methods neither guarantee enough prediction accuracy due to the global randomness, nor provide assured security enforcement against the kNN attack. To overcome the problem of recommendation accuracy loss, we propose a novel approach called Partitioned Probabilistic Neighbour Selection. In this thesis, we define the sum of k neighbours’ similarity as the accuracy metric α, the number of user partitions, across which we select the k neighbours, as the security metric β. We consider two versions of the Partitioned Probabilistic Neighbour Selection schemes. Firstly, to ensure a required prediction accuracy while maintaining high security against the kNN attack, we propose an accuracy-assured Partitioned Probabilistic Neighbour Selection algorithm. We select neighbours from each exclusive partition of size k with a decreasing probability. Theoretical and experimental analysis show that to provide an accuracy-assured recommendation, our method yields a suitable trade-off between the recommendation accuracy and system security. Secondly, to ensure a required security guarantee while achieving the optimal prediction accuracy against the kNN attack, we propose a security-assured accuracy-maximised Partitioned Probabilistic Neighbour Selection algorithm. We select neighbours from each partition with exponential differential privacy to reduce the magnitude of noise. Theoretical and experimental analyses show that to achieve the same security guarantee against the kNN attack, our approach ensures an optimal prediction accuracy. In addition, as the core of neighbourhood-based CF, the task of dynamically maintaining users’ similarity list is challenged by the cold-start problem and the scalability problem. Recently, several methods have been proposed for solving the two problems. However, these methods require mn steps to compute the similarity list against the kNN attack, where n and m are number of users and items respectively. Observing that the k new users from the kNN attack, with enough recommendation data, share the same rating list, we present a faster algorithm, TwinSearch, to avoid computing and sorting the similarity list for each new user repeatedly to save the time complexity. The computation cost of our… Advisors/Committee Members: Shen, Hong (advisor), Falkner, Nickolas John Gowland (advisor), School of Computer Science (school).

Subjects/Keywords: privacy preserving; differential privacy; neighbourhood-based collaborative filtering; internet commerce; recommender systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lu, Z. (2015). Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/98720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lu, Zhigang. “Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms.” 2015. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/98720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lu, Zhigang. “Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms.” 2015. Web. 12 Apr 2021.

Vancouver:

Lu Z. Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms. [Internet] [Thesis]. University of Adelaide; 2015. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/98720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu Z. Privacy preserving neighbourhood-based collaborative filtering recommendation algorithms. [Thesis]. University of Adelaide; 2015. Available from: http://hdl.handle.net/2440/98720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

6. Shemshadi, Ali. Correlation management and search for the Internet of Things.

Degree: 2016, University of Adelaide

URL: http://hdl.handle.net/2440/103457

► The Internet of Things (IoT) is a compelling paradigm, which aims to enable everyday physical things embedded with electronics, software, sensors, and network connectivity to… (more)

▼ The Internet of Things (IoT) is a compelling paradigm, which aims to enable everyday physical things embedded with electronics, software, sensors, and network connectivity to collect and exchange data on the Internet. It is anticipated that by 2020, billions of things get connected to the Internet. Creating future IoT search engines is a key step towards unlocking answering the above question. Future search engines can potentially in revolutionise various applications in different domains. Existing approaches for searching the IoT use simple techniques to obtain a list of things for a query. The state of the art needs to be improved in different aspects. For instance, it is often disregarded that in the context of IoT, we have two types of users including machines and human users. In addition, many have complained about the absence of the real-world IoT data. Unsurprisingly, a common question that arises regularly nowadays is “Does the IoT already exist?”. So far, little has been known about the real-world situation on IoT, its attributes, the presentation of data and user interests. Moreover, existing approaches also disregard the attribute based correlations between things in the real-world. In this dissertation, we review the state of the art in IoT search domain and propose a novel framework to collect and analyse IoT data. Our system is also able to resolve IoT queries based on the knowledge that is acquired from the IoT data sources. Furthermore, we introduce a novel technique to extract the correlations between things. Our framework is capable of using the correlations to improve the quality of search results for both types of users. We investigate the scalability and the effectiveness of our approach using large scale and real-world datasets. Moreover, we investigate two case studies in transport systems in our research. The first case study, challenges the complex problem of taxi ridesharing in the context of smart cities. The second case study, involves a real-time prediction method for flight delays based on the IoT sourced data. Advisors/Committee Members: Sheng, Michael (advisor), Michalewicz, Zbigniew (advisor), Shen, Hong (advisor), School of Computer Science (school).

Subjects/Keywords: Internet of things; web of things; information retrieval; big data; computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shemshadi, A. (2016). Correlation management and search for the Internet of Things. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/103457

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shemshadi, Ali. “Correlation management and search for the Internet of Things.” 2016. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/103457.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shemshadi, Ali. “Correlation management and search for the Internet of Things.” 2016. Web. 12 Apr 2021.

Vancouver:

Shemshadi A. Correlation management and search for the Internet of Things. [Internet] [Thesis]. University of Adelaide; 2016. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/103457.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shemshadi A. Correlation management and search for the Internet of Things. [Thesis]. University of Adelaide; 2016. Available from: http://hdl.handle.net/2440/103457

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

7. Wu, Yanbo. Enabling traceability in large-scale RFID networks.

Degree: 2012, University of Adelaide

URL: http://hdl.handle.net/2440/74096

► The emergence of radio frequency identification (RFID) technology brings significant social and economic benefits. As a non line of sight technology, RFID provides an effective… (more)

▼ The emergence of radio frequency identification (RFID) technology brings significant social and economic benefits. As a non line of sight technology, RFID provides an effective way to record movements of objects within a networked system formed by a set of distributed and collaborating parties. A trail of such recorded movements is the foundation for enabling traceability applications. While traceability is a critical aspect of the majority of RFID applications, realizing traceability for these applications brings many fundamental research and development issues, including storage efficiency, query processing complexity, privacy etc. In this dissertation, we present a novel approach to realize RFIID-based traceability in large, autonomous and heterogeneous distributed networks. We first propose a Peer-to-Peer (P2P) architecture, namely PeerTrack. PeerTrack does not require any kind of centralized database for the RFID data or their index, neither it requires RFID data to be fully shared to partners. In PeerTrack, only a specific portion of data is requested by partners, when the access is necessary. We introduce a distributed model, namely MOODS (a Model for mOving Objects in Discrete Space), for the essential data structures of traceability. MOODS is maintained by a distributed index on the top of a structured Peer-to-Peer overlay. We then propose efficient algorithms for the maintenance of MOODS. The algorithms are optimized to consume statistically minimal cost of bandwidth. Based on this model, we propose algorithms for efficient item-level and statistical traceability query processing. We also propose a traceability mining model for distributed RFID streams, namely TISH (Tilted TIme Frame of Histogram). TISH takes advantages of two important data mining tools, namely Tilted Time Series and Histogram, and combines them to describe the patterns of RFID streams in the dimensions of both time and space, and capture the dynamicity of the patterns. We propose efficient algorithms to maintain TISH and algorithms that use it for traceability query processing and RFID stream mining. We present a platform, namely PeerTrack Cloud, to bring the aforementioned RFID data modeling and traceability query processing techniques to the Cloud Environments. The platform features specific traceability-oriented modules for real-time query processing and efficient data storage. The techniques proposed in this dissertation are implemented in “Asset Management System", which is a collaborative project with a local company. Finally, we conduct extensive performance studies of the proposed techniques. The experimental results reveal that our system i) is more scalable and outperforms the centralized approach when the data volume or the network becomes larger; ii) provides powerful programming interfaces for query processing; iii) is economy in both storage and bandwidth; and iv) can be easily adopted in cloud computing platforms. Advisors/Committee Members: Sheng, Quanzheng (advisor), Shen, Hong (advisor), Zeadally, Sherali (advisor), Yu, Jian (advisor), Ranasinghe, Damith Chinthana (advisor), School of Computer Science (school).

Subjects/Keywords: RFID; traceability; internet of things

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wu, Y. (2012). Enabling traceability in large-scale RFID networks. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/74096

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wu, Yanbo. “Enabling traceability in large-scale RFID networks.” 2012. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/74096.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wu, Yanbo. “Enabling traceability in large-scale RFID networks.” 2012. Web. 12 Apr 2021.

Vancouver:

Wu Y. Enabling traceability in large-scale RFID networks. [Internet] [Thesis]. University of Adelaide; 2012. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/74096.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu Y. Enabling traceability in large-scale RFID networks. [Thesis]. University of Adelaide; 2012. Available from: http://hdl.handle.net/2440/74096

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Fruzangohar, Mario. Biomedical literature mining.

Degree: 2014, University of Adelaide

URL: http://hdl.handle.net/2440/85201

► Thousands of biomedical articles are published every year containing many newly discovered biological interactions and functions. Manually reading and classifying this information is a difficult… (more)

▼ Thousands of biomedical articles are published every year containing many newly discovered biological interactions and functions. Manually reading and classifying this information is a difficult and laborious task. Literature mining contains mechanisms and tools to automate the process of extracting biological relationships, storing them in biological databases and finally analyse and present them in a biological meaningful way. In the first stage of literature mining, articles are parsed and get segmented, sentences separated, tokenized and finally annotated by part of speech tags (POS). POS tagging is the most challenging part because the training corpus is relatively small compared to the large number of biological names therefore limiting the lexicon. There are a number of solutions to address this problem including extending the lexicon manually or using character features of the word. There is no empirical comparison between different solutions. So we developed a complete list of tools including article parser, segmentation, sentence detector, sentence tokeniser, POS tagger and finally noun phrase detector using JAVA and PostgreSQL technologies. We tailored these tools for biomedical texts, and empirically compared them with other tools and we demonstrated increased efficiency of our tools compared to others. Once biological relationships are extracted they are ready to be stored in databases to be used and shared by others. There a wide range of databases that store annotation data related to genes, proteins and other biological entities. Among them Gene Ontology annotation database is the key database that connects all the other biological entities through a standard vocabulary together. In fact a Gene Ontology (GO) is a controlled vocabulary to annotate proteins based on their molecular function, biological process and cellular components. There are a number of public databases that provide data regarding GO and GO-protein relationships. We collected all relevant data from several public databases and built our specialized updatable GO database on the PostgreSQL platform. GO classification in a particular sample of genes (up/down regulated) or whole genome of a species can reveal the biological mechanisms related to its activity. Moreover, comparing the GO classification of a species under different biological conditions can elucidate its biological pathways, which can result in the discovery of novel genes to be used in therapies. We developed a web server using the PHP MVC framework connected to our specialized GO database. In this web server we developed novel visual and statistical methods to perform GO comparisons among multiple samples and genomes. We also included transcriptome based gene expression levels in GO analysis, resulting in novel meaningful biological reports. This also made comparison of whole genome gene expression across multiple biological conditions possible. Furthermore, we devised a method to dynamically construct and visualize GO regulatory networks for any gene set sample.… Advisors/Committee Members: Adelson, David Louis (advisor), Shen, Hong (advisor), School of Molecular and Biomedical Science (school).

Subjects/Keywords: Part of Speech Tagging; biological database; gene ontology; Gene Regulatory Networks; biological pathways; gene ontology enrichment

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fruzangohar, M. (2014). Biomedical literature mining. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/85201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Fruzangohar, Mario. “Biomedical literature mining.” 2014. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/85201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Fruzangohar, Mario. “Biomedical literature mining.” 2014. Web. 12 Apr 2021.

Vancouver:

Fruzangohar M. Biomedical literature mining. [Internet] [Thesis]. University of Adelaide; 2014. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/85201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fruzangohar M. Biomedical literature mining. [Thesis]. University of Adelaide; 2014. Available from: http://hdl.handle.net/2440/85201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Liao, Kewen. Approximation algorithms for resource allocation optimization.

Degree: 2014, University of Adelaide

URL: http://hdl.handle.net/2440/85975

► Nowadays, data storage, server replicas/mirrors, virtual machines, and various kinds of services can all be regarded as different types of resources. These resources play an… (more)

Subjects/Keywords: approximation algorithms; resource allocation; optimization

…the University of Adelaide and where applicable, any partner institution responsible for the… …University of Adelaide from 2009 to 2013, I have produced four conference papers and two journal… …University of Adelaide for providing me scholarship and the School of Computer Science for…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liao, K. (2014). Approximation algorithms for resource allocation optimization. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/85975

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liao, Kewen. “Approximation algorithms for resource allocation optimization.” 2014. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/85975.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liao, Kewen. “Approximation algorithms for resource allocation optimization.” 2014. Web. 12 Apr 2021.

Vancouver:

Liao K. Approximation algorithms for resource allocation optimization. [Internet] [Thesis]. University of Adelaide; 2014. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/85975.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liao K. Approximation algorithms for resource allocation optimization. [Thesis]. University of Adelaide; 2014. Available from: http://hdl.handle.net/2440/85975

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

10. Chen, Yawen. Efficient embeddings of meshes and hypercubes on a group of future network architectures.

Degree: 2008, University of Adelaide

URL: http://hdl.handle.net/2440/51604

► Meshes and hypercubes are two most important communication and computation structures used in parallel computing. Network embedding problems for meshes and hypercubes on traditional network… (more)

▼ Meshes and hypercubes are two most important communication and computation structures used in parallel computing. Network embedding problems for meshes and hypercubes on traditional network architectures have been intensively studied during the past years. With the emergence of new network architectures, the traditional network embedding results are not enough to solve the new requirements. The main objective of this thesis is to design efficient network embedding schemes for realizing meshes and hypercubes on a group of future network architectures. This thesis is organized into two parts. The first part focuses on embedding meshes/tori on a group of double-loop networks by evaluating the traditional embedding metrics, since double-loop networks have been intensively studied and proven to have many desirable properties for future network architecture. We propose a novel tessellation approach to partition the geometric plane of double-loop networks into a set of parallelogram tiles, called P-shape. Based on the characteristics of P-shape, we design a simple embedding scheme, namely P-shape embedding, that embeds arbitrary-shape meshes and tori on double-loop networks in a systematic way. A main merit of P-shape embedding is that a large fraction of embedded mesh/torus edges have edge dilation 1, resulting in a low average dilation. These are the first results, to our knowledge, on embedding meshes and tori on general doubleloop networks which is of great significance due to the popularity of these architectures. Our P-shape construction bridges between regular graphs and double-loop networks, and provides a powerful tool for studying the topological properties of double-loop networks. In the second part, we study efficient embedding schemes for realizing hypercubes on a group of array-basedWDMoptical networks by analyzing the new embedding metric of wavelength requirement, as WDM optical networking is becoming a promising technology for deployment in many applications in advanced telecommunication and parallel computing. We first design routing and wavelength assignments of both bidirectional and unidirectional hypercubes on WDM optical linear arrays, rings, meshes and tori with the consideration of communication directions. For each case, we identify a lower bound on the number of wavelengths required, and design the embedding scheme and wavelength assignment algorithm that uses a provably near-optimal number of wavelengths. To further reduce the wavelength requirement, we extend the results to WDM ring networks with additional links, namely WDM chordal rings. Based on our proposed embedding schemes, we provide the analysis of chord length with optimal number of wavelengths to realize hypercubes on 3-degree and 4-degree WDM chordal rings. Furthermore, we propose an embedding scheme for realizing dimensional hypercubes on WDM optical arrays by considering the hypercubes dimension by dimension, called lattice embedding, instead of embedding hypercubes with all dimensions. Based on lattice embedding, the number of… Advisors/Committee Members: Shen, Hong (advisor), Brooks, Mike (advisor), School of Computer Science (school).

Subjects/Keywords: network embedding; mesh; hypercube; optical networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, Y. (2008). Efficient embeddings of meshes and hypercubes on a group of future network architectures. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/51604

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chen, Yawen. “Efficient embeddings of meshes and hypercubes on a group of future network architectures.” 2008. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/51604.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chen, Yawen. “Efficient embeddings of meshes and hypercubes on a group of future network architectures.” 2008. Web. 12 Apr 2021.

Vancouver:

Chen Y. Efficient embeddings of meshes and hypercubes on a group of future network architectures. [Internet] [Thesis]. University of Adelaide; 2008. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/51604.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen Y. Efficient embeddings of meshes and hypercubes on a group of future network architectures. [Thesis]. University of Adelaide; 2008. Available from: http://hdl.handle.net/2440/51604

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

11. Zhang, Haibo. Efficient data transport in wireless sensor networks.

Degree: 2009, University of Adelaide

URL: http://hdl.handle.net/2440/56028

► Providing efficient data transport is one of the uppermost objectives in the design of wireless sensor networks (WSNs) since the primary role for each sensor… (more)

▼ Providing efficient data transport is one of the uppermost objectives in the design of wireless sensor networks (WSNs) since the primary role for each sensor is to report the sensed data to the data sink(s). This thesis focuses on designing efficient data transport schemes for WSNs in the dimensions of energy consumption and time respectively. The developed schemes can be directly applied in a number of applications such as intrusion detection, target tracking, environment monitoring, etc., and can be further extended to underwater acoustic sensor networks and unmanned aerial vehicles (UAVs) networks. With the development of WSN technologies, new challenging research problems such as real-time streaming data gathering and intelligent data communication are emerging. This thesis provides useful foundation for designing next-generation data transport schemes for WSNs. Energy is the most important resource in WSNs because sensor nodes are commonly powered by small batteries, and energy is directly related to the lifetime of nodes and the network. In this thesis, energy-efficient data transport schemes are designed for two major types of WSNs: event-driven sensor networks and time-driven sensor networks. A novel on-line routing scheme called EBGR (Energy-efficient Beaconless Geographic Routing) is designed for event-driven sensor networks characterized by dynamic network topology. The main advantage of EBGR is that it can provide energy-efficient sensor-to-sink routing without any prior neighborhood knowledge. Moreover, the total energy consumption for sensor-to-sink data delivery under EBGR has an upper bound. Time-driven sensor networks, in which all sensors periodically report the sensed data to the sink(s), have been widely used for environment monitoring applications. Unbalanced energy consumption is an inherent problem in time-driven sensor networks. An efficient data gathering scheme, called EBDG (Energy-Balanced Data Gathering), is designed to balance energy consumption for the goal of maximizing network lifetime. Combing all advantages of corona-based network division,mixed-routing and data aggregation, EBDG can prolong network lifetime by an order of magnitude compared with conventional schemes. Time-efficient data transport is another critical issue in WSNs since the data generated by the sensor nodes may become outdated after a certain time interval. This thesis focuses on the problem of providing real-time data gathering in time-driven sensor networks. A novel data gathering scheme based on random access is proposed with the objective to minimize the average duration for completing one round of data gathering. Fully localized solutions have been designed for both linear networks and tree networks. A simple data gathering protocol called RADG (Random Access Data Gathering) is designed. Simulation results show that RADG outperforms CSMA based schemes when the size of the data packets is small. Advisors/Committee Members: Shen, Hong (advisor), Pope, Cheryl Lynn (advisor), School of Computer Science (school).

Subjects/Keywords: wireless sensor networks; data gathering; energy-efficient data transport; time-efficient data gathering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, H. (2009). Efficient data transport in wireless sensor networks. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/56028

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhang, Haibo. “Efficient data transport in wireless sensor networks.” 2009. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/56028.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhang, Haibo. “Efficient data transport in wireless sensor networks.” 2009. Web. 12 Apr 2021.

Vancouver:

Zhang H. Efficient data transport in wireless sensor networks. [Internet] [Thesis]. University of Adelaide; 2009. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/56028.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang H. Efficient data transport in wireless sensor networks. [Thesis]. University of Adelaide; 2009. Available from: http://hdl.handle.net/2440/56028

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

12. Xu, Shihong. Replica placement algorithms for efficient internet content delivery.

Degree: 2009, University of Adelaide

URL: http://hdl.handle.net/2440/58083

► This thesis covers three main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery… (more)

▼ This thesis covers three main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery system, the location of replicas is very important as perceived by a quotation: Closer is better. However, considering the costs incurred by replication, it is a challenge to deploy replicas in a cost-effective manner. The objective of our work is to optimally select the location of replicas which includes sites for replica server deployment, servers for replica contents hosting, and en-route caches for object caching. Our solutions for corresponding applications are presented in three parts of the work, which makes significant contributions for designing scalable, reliable, and efficient systems for Internet content delivery. In the first part, we define the Fault-Tolerant Facility Allocation (FTFA) problem for the placement of replica servers, which relaxes the well known Fault-Tolerant Facility Location (FTFL) problem by allowing an integer (instead of binary) number of facilities per site. We show that the problem is NP-hard even for the metric version, where connection costs satisfy the triangle inequality. We propose two efficient algorithms for the metric FTFA problem with approximation factors 1.81 and 1.61 respectively, where the second algorithm is also shown to be (1.11,1.78)- and (1,2)-approximation through the proposed inverse dual fitting technique. The first bi-factor approximation result is further used to achieve a 1.52-approximation algorithm and the second one a 4-approximation algorithm for the metric Fault-Tolerant k-Facility Allocation problem, where an upper bound of facility number (i. e. k) applies. In the second part, we formulate the problem of QoS-aware content replication for parallel access in terms of combined download speed maximization, where each client has a given degree of parallel connections determined by its QoS requirement. The problem is further converted into the metric FTFL problem and we propose an approximation algorithm which is implemented in a distributed and asynchronous manner of communication. We show theoretically that the cost of our solution is no more than 2F* + RC*, where F* and C* are two components of any optimal solution while R is the maximum number of parallel connections. Numerical experiments show that the cost of our solutions is comparable (within 4% error) to the optimal solutions. In the third part, we establish mathematical formulation for the en-route web caching problem in a multi-server network that takes into account all requests (to any server) passing through the intermediate nodes on a request/response path. The problem is to cache the requested object optimally on the path so that the total system gain is maximized. We consider the unconstrained case and two QoS-constrained cases respectively, using efficient dynamic programming based methods. Simulation experiments show that our methods either yield a steady performance improvement (in the unconstrained… Advisors/Committee Members: Shen, Hong (advisor), Sheng, Michael (advisor), School of Computer Science (school).

Subjects/Keywords: Fault tolerance; Facility location problem; Content distribution; Linear programming; Dynamic programming; Web caching; Computer networks.; Internet.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xu, S. (2009). Replica placement algorithms for efficient internet content delivery. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/58083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Xu, Shihong. “Replica placement algorithms for efficient internet content delivery.” 2009. Thesis, University of Adelaide. Accessed April 12, 2021. http://hdl.handle.net/2440/58083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Xu, Shihong. “Replica placement algorithms for efficient internet content delivery.” 2009. Web. 12 Apr 2021.

Vancouver:

Xu S. Replica placement algorithms for efficient internet content delivery. [Internet] [Thesis]. University of Adelaide; 2009. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/2440/58083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu S. Replica placement algorithms for efficient internet content delivery. [Thesis]. University of Adelaide; 2009. Available from: http://hdl.handle.net/2440/58083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations