You searched for subject:(Data Aggregation).
Showing records 1 – 30 of
182 total matches.
◁ [1] [2] [3] [4] [5] [6] [7] ▶
University of Houston
1.
Kundooru, Shyam Sunder Reddy 1991-.
Generalized Framework for Time-Sensitive Decision Support Systems.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1739 
► The University of Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the…
(more)
▼ The University of Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the information available to Emergency Operations Center which is received from different sensors feeding the information. The information systems in the University are disparate and do not communicate with each other. These enterprise systems are independent with no integrated view. Most of the systems operate on and store the same information about the campus and people while using various models appropriate to operational needs. As the monitoring systems are not integrated with each other, it becomes difficult to estimate the level of emergency by considering the incidents identified by the individual systems.
In this Thesis, we realized a
data model design to enable an
aggregation framework in time-sensitive decision support systems. We propose a framework for aggregating the
data available through the information sources towards achieving an integrated view. The standard used for integrating the various systems is IF-MAP (Interface for Metadata Access Point) Standard. Using the Publish – Subscribe communication paradigm and aggregating the
data based on time window and location, disparate
data sources can be integrated and effective communication between the systems can be achieved, which helps in making the emergency decisions. The decision can now be based on effective utilization of all the systems involved in the particular incident.
Aggregation has been performed on various sources of information like Police Dispatch system, card access system, video feeds and general facilities system at University of Houston.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Subhlok, Jaspal (committee member), Gurkan, Deniz (committee member), Chapman, Barbara M. (committee member).
Subjects/Keywords: Data Integration; Data Aggregation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kundooru, S. S. R. 1. (2015). Generalized Framework for Time-Sensitive Decision Support Systems. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1739
Chicago Manual of Style (16th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Masters Thesis, University of Houston. Accessed March 07, 2021.
http://hdl.handle.net/10657/1739.
MLA Handbook (7th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Web. 07 Mar 2021.
Vancouver:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10657/1739.
Council of Science Editors:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1739
2.
Jovilyn Therese Baco Fajardo.
Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.
Degree: 博士(工学), Nara Institute of Science and Technology / 奈良先端科学技術大学院大学
URL: http://hdl.handle.net/10061/9241
Subjects/Keywords: data aggregation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fajardo, J. T. B. (n.d.). Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/9241
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Fajardo, Jovilyn Therese Baco. “Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed March 07, 2021.
http://hdl.handle.net/10061/9241.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fajardo, Jovilyn Therese Baco. “Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.” Web. 07 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Fajardo JTB. Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10061/9241.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
Fajardo JTB. Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/9241
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
University of Minnesota
3.
Nickodem, Kyle.
Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.
Degree: PhD, Educational Psychology, 2020, University of Minnesota
URL: http://hdl.handle.net/11299/216126
► Propensity score methods can be used to reduce selection bias and improve causal inferencing with nonrandomized data. However, there is little guidance for implementing a…
(more)
▼ Propensity score methods can be used to reduce selection bias and improve causal inferencing with nonrandomized data. However, there is little guidance for implementing a propensity score analysis when treatment exposure is a property of clusters rather than subjects. For example, education policies and practices are often implemented by school or district rather than by individual student. The three studies in this dissertation strive to clarify procedural quandaries for a propensity score analysis with cluster-level treatment exposure and subject-level outcomes. Additionally, omission of a true confounder from a propensity score analysis can bias treatment effect estimation. My dissertation also explores the utility of aggregated covariates as replacements for missing true cluster-level confounders. The first simulation study compared four procedures for generating aggregated covariates. The results highlight that: 1) researchers need to verify the comparability of generated samples to real world contexts; 2) a propensity score analysis with cluster-level treatment exposure requires at least 60 clusters. The second simulation compared covariate balance and treatment effect estimation when appraising treatment exposure by subjects or by clusters and including aggregated covariates of varying quality. Treatment appraisal by subjects outperformed appraisal by clusters under certain conditions. When highly correlated (r = .92 - .98) with the missing true confounders, aggregated covariates were viable replacements. The last study applied the guidance from the simulations to statewide survey data. The investigation found no association between the presence of a school resource officer and students’ social-emotional well-being and academic performance. A critical caveat is the results may not generalize to student populations that have historically been targeted by discrimination and school violence.
Subjects/Keywords: Aggregation; Clustered Data; Propensity Scores; Selection Bias
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nickodem, K. (2020). Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/216126
Chicago Manual of Style (16th Edition):
Nickodem, Kyle. “Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.” 2020. Doctoral Dissertation, University of Minnesota. Accessed March 07, 2021.
http://hdl.handle.net/11299/216126.
MLA Handbook (7th Edition):
Nickodem, Kyle. “Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.” 2020. Web. 07 Mar 2021.
Vancouver:
Nickodem K. Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. [Internet] [Doctoral dissertation]. University of Minnesota; 2020. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/11299/216126.
Council of Science Editors:
Nickodem K. Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. [Doctoral Dissertation]. University of Minnesota; 2020. Available from: http://hdl.handle.net/11299/216126
Delft University of Technology
4.
Dekker, F.W. (author).
Privacy-Preserving Data Aggregation with Probabilistic Range Validation.
Degree: 2020, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
► Privacy-preserving data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended…
(more)
▼ Privacy-preserving
data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended with zero-knowledge proofs and commitments to work in the malicious model, but this incurs a significant computational cost on the end users, making adoption of such protocols less likely. We propose a privacy-preserving
data aggregation protocol for calculating the sum of user inputs. Our protocol gives the aggregator confidence that all inputs are within a desired range. Instead of zero-knowledge proofs, our protocol relies on an asynchronous probabilistic hypergraph-based detection algorithm with which the aggregator can quickly pinpoint malicious users. Our protocol is robust to user dropouts and is non-interactive apart from the registration phase. We describe several optional extensions to our protocol for temporal
aggregation, dynamic user joins and leaves, and differential privacy. We analyse our protocol in terms of security, privacy, and detection rate. Finally, we compare the runtime complexity of our protocol with a selection of related protocols.
Advisors/Committee Members: Erkin, Z. (mentor), Picek, S. (graduation committee), Finavaro Aniche, M. (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Privacy; Data aggregation; Applied cryptography; Hypergraphs
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dekker, F. W. (. (2020). Privacy-Preserving Data Aggregation with Probabilistic Range Validation. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
Chicago Manual of Style (16th Edition):
Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Masters Thesis, Delft University of Technology. Accessed March 07, 2021.
http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.
MLA Handbook (7th Edition):
Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Web. 07 Mar 2021.
Vancouver:
Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 07].
Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.
Council of Science Editors:
Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
University of New South Wales
5.
Lee, Chung Tong.
Fixed point theorems in mathematical models for data aggregation.
Degree: Computer Science & Engineering, 2011, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/50302
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9183/SOURCE02?view=true
► Model construction requires selecting and identifying relevant aspects of a situation in the real world. Describing these aspects and the relations between them by a…
(more)
▼ Model construction requires selecting and identifying relevant aspects of a situation in the real world. Describing these aspects and the relations between them by a system of equations essentially constructs a mathematical model. Functional definitions are very useful in describing relations. They provide additional imperative information for computation, compared to their implicit counterparts. However, it is rarely the case that all entities have a one-way dependency on others. Rather, entities in a system interact with one another and display interdependencies. When translated to mathematical models with functional definitions, the equation systems may contain circular definitions.This thesis demonstrates how to apply fixed point theorems to mathematical models when the relations between entities involve circular definitions. Fixed point solutions are computed via iteration. As a simplified example, suppose that the relations between two variables x and y can be described by functions f and g such that x = f(y) and y = g(x). Then the set of fixed points of the composite function f ∘ g is the solution for x, i.e., x = f(g(x)). In this thesis, formulations of this type have been applied to different problem domains which are commonly found in the Internet environment. These include rating
aggregation, voting, reputation and trust, and information retrieval. In the simulation for rating
aggregation, the quality of an assessor depends on the discrepancy between the ratings he gives and the final ratings. On the other hand, the final rating is defined as a weighted average of ratings given by different assessors, using assessor qualities as the weights. This model shows robustness against random attacks and collusion.The voting study in this dissertation involved real-life
data from the MSN Q&A service. Voter quality is defined to capture the agreement between voters, again a circular definition. Existence of a solution is asserted by Brouwer's Fixed Point Theorem. This new voting system shows advantages over simple majority vote counting, being more robust against random attacks and showing identification hints for ballot stuffing.Using intuitively self-evident axioms on the trust building process, the method of a weighted quasi-arithmetic average is proved to be adequate to serve as a mathematical model for trust. Further, reputation is defined as an
aggregation of trust over a community. The transaction properties and the reputation of the rating agents are used as the weight factors for the
aggregation. This is essentially a circular definition. Solution existence is guaranteed when a suitable weighting function is chosen.Topic difficulty and system retrieval performance exhibit a negative reinforcement relationship which is an excellent example of a circular definition. Using an estimation accuracy interpretation, the mathematical model with fixed point solution in this thesis gives a more natural result on TREC
data than that from the HITS algorithm with eigenvector solutions.Finally, this dissertation…
Advisors/Committee Members: Ignjatovic, Aleksandar, Computer Science & Engineering, Faculty of Engineering, UNSW, Martin, Eric, Computer Science & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Data Aggregation; Fixed Point Theorem; Mathematical Model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lee, C. T. (2011). Fixed point theorems in mathematical models for data aggregation. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50302 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9183/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Lee, Chung Tong. “Fixed point theorems in mathematical models for data aggregation.” 2011. Doctoral Dissertation, University of New South Wales. Accessed March 07, 2021.
http://handle.unsw.edu.au/1959.4/50302 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9183/SOURCE02?view=true.
MLA Handbook (7th Edition):
Lee, Chung Tong. “Fixed point theorems in mathematical models for data aggregation.” 2011. Web. 07 Mar 2021.
Vancouver:
Lee CT. Fixed point theorems in mathematical models for data aggregation. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2021 Mar 07].
Available from: http://handle.unsw.edu.au/1959.4/50302 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9183/SOURCE02?view=true.
Council of Science Editors:
Lee CT. Fixed point theorems in mathematical models for data aggregation. [Doctoral Dissertation]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/50302 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9183/SOURCE02?view=true
University of Manchester
6.
Naureen, Ayesha.
A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS.
Degree: 2019, University of Manchester
URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:318675
► A Wireless Sensor Network (WSN) is a network of small, low-cost, battery-powered sensor nodes, with limited computational and communication capabilities. The sensor nodes collect certain…
(more)
▼ A Wireless Sensor Network (WSN) is a network of
small, low-cost, battery-powered sensor nodes, with limited
computational and communication capabilities. The sensor nodes
collect certain
data from an environment and send it to a Base
Station (BS). It is important that the
data collected by the sensor
nodes is delivered reliably to the BS and with as low computational
and communication loads (thus with low energy consumption) imposed
on the sensor nodes, as possible. However, with unreliable
communication channels and battery-powered and resource-constrained
sensor nodes, achieving both reliability and energy-efficiency in a
data collection process in a WSN is a challenging issue.
Transmission redundancy, a measure typically used to achieve
reliability, also results in an increase in communication loads
imposed on each sensor node. This thesis attempts to address this
challenging issue by applying two novel measures, which are: (i)
adjust the level of transmission redundancy in response to network
conditions, and (ii) use computation to reduce communication load
on sensor nodes. The first measure can reduce the number of
messages in the network while still achieving reliability, and the
second measure can reduce both the number and the length of
messages transmitted in the network, thus reducing energy
consumption. To this end, the thesis has made the following
contributions. Firstly, it proposes a novel Multi-Aggregator based
Adjusted Multicast (MAAM) method to optimise the trade-off in
achieving reliability and reducing energy consumption in delivering
collected
data from the sensor nodes to the BS. The optimisation is
done in two ways, using
data aggregation and adjusting the level of
transmission redundancy in response to network conditions. In this
research, the level of transmission redundancy is adjusted manually
and as such an algorithm for automatic adjustment of the
transmission redundancy level is currently not a part of MAAM. The
data delivery ratios and the energy costs of the method have been
investigated and compared against three existing
data aggregation
approaches (namely Single-Aggregator based Uni-Cast (SAUC),
Multi-Aggregator based Uni-Cast (MAUC) and Multi-Aggregator based
Broad-Cast (MABC)) under various network conditions. The results
show that: (i) MAUC gives the best reliability and lowest energy
costs when there are no failed nodes in the network, (ii) MABC has
the highest energy costs under all network conditions but only
provides reliability when the network is not congested, (iii) MAAM
gives higher reliability and lower energy costs than MAUC in a
network with failed nodes, and (iv) MAAM gives higher reliability
than MABC in a congested network and lower energy costs than MABC
under all network conditions. Secondly, it proposes a novel idea
called
Structured-
data-representation-and-next-hop-node-Interpretation-and-
Aggregation
(SIA) to maximise the amount of
data which can be collected for a
given message payload length. To do so, SIA implements a novel
method, called Revised Partial…
Advisors/Committee Members: FURBER, STEPHEN SB, Zhang, Ning, Furber, Stephen.
Subjects/Keywords: Wireless Sensor Networks; Data Collection; Data Aggregation; Topology Learning; Wildlife Tracking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Naureen, A. (2019). A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:318675
Chicago Manual of Style (16th Edition):
Naureen, Ayesha. “A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS.” 2019. Doctoral Dissertation, University of Manchester. Accessed March 07, 2021.
http://www.manchester.ac.uk/escholar/uk-ac-man-scw:318675.
MLA Handbook (7th Edition):
Naureen, Ayesha. “A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS.” 2019. Web. 07 Mar 2021.
Vancouver:
Naureen A. A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS. [Internet] [Doctoral dissertation]. University of Manchester; 2019. [cited 2021 Mar 07].
Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:318675.
Council of Science Editors:
Naureen A. A RELIABLE AND ENERGY EFFICIENT DATA COLLECTION SOLUTION
FOR WIRELESS SENSOR NETWORKS. [Doctoral Dissertation]. University of Manchester; 2019. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:318675
University of Oxford
7.
de Souza, Tulio.
Data-level privacy through data perturbation in distributed multi-application environments.
Degree: PhD, 2016, University of Oxford
URL: https://ora.ox.ac.uk/objects/uuid:2b818039-bde4-41d6-96ca-0367704a53f0
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730480
► Wireless sensor networks used to have a main role as a monitoring tool for environmental purposes and animal tracking. This spectrum of applications, however, has…
(more)
▼ Wireless sensor networks used to have a main role as a monitoring tool for environmental purposes and animal tracking. This spectrum of applications, however, has dramatically grown in the past few years. Such evolution means that what used to be application-specific networks are now multi application environments, often with federation capabilities. This shift results in a challenging environment for data privacy, mainly caused by the broadening of the spectrum of data access points and involved entities. This thesis first evaluates existing privacy preserving data aggregation techniques to determine how suitable they are for providing data privacy in this more elaborate environment. Such evaluation led to the design of the set difference attack, which explores the fact that they all rely purely on data aggregation to achieve privacy, which is shown through simulation not to be suitable to the task. It also indicates that some form of uncertainty is required in order to mitigate the attack. Another relevant finding is that the attack can also be effective against standalone networks, by exploring the node availability factor. Uncertainty is achieved via the use of differential privacy, which offers a strong and formal privacy guarantee through data perturbation. In order to make it suitable to work in a wireless sensor network environment, which mainly deals with time-series data, two new approaches to address it have been proposed. These have a contrasting effect when it comes to utility and privacy levels, offering a flexible balance between privacy and data utility for sensed entities and data analysts/consumers. Lastly, this thesis proposes a framework to assist in the design of privacy preserving data aggregation protocols to suit application needs while at the same time complying with desired privacy requirements. The framework's evaluation compares and contrasts several scenarios to demonstrate the level of flexibility and effectiveness that the designed protocols can provide. Overall, this thesis demonstrates that data perturbation can be made significantly practical through the proposed framework. Although some problems remain, with further improvements to data correlation methods and better use of some intrinsic characteristics of such networks, the use of data perturbation may become a practical and efficient privacy preserving mechanism for wireless sensor networks.
Subjects/Keywords: 004; Data aggregation; Differential Privacy; Wireless Sensor Networks; Data privacy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
de Souza, T. (2016). Data-level privacy through data perturbation in distributed multi-application environments. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:2b818039-bde4-41d6-96ca-0367704a53f0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730480
Chicago Manual of Style (16th Edition):
de Souza, Tulio. “Data-level privacy through data perturbation in distributed multi-application environments.” 2016. Doctoral Dissertation, University of Oxford. Accessed March 07, 2021.
https://ora.ox.ac.uk/objects/uuid:2b818039-bde4-41d6-96ca-0367704a53f0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730480.
MLA Handbook (7th Edition):
de Souza, Tulio. “Data-level privacy through data perturbation in distributed multi-application environments.” 2016. Web. 07 Mar 2021.
Vancouver:
de Souza T. Data-level privacy through data perturbation in distributed multi-application environments. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2021 Mar 07].
Available from: https://ora.ox.ac.uk/objects/uuid:2b818039-bde4-41d6-96ca-0367704a53f0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730480.
Council of Science Editors:
de Souza T. Data-level privacy through data perturbation in distributed multi-application environments. [Doctoral Dissertation]. University of Oxford; 2016. Available from: https://ora.ox.ac.uk/objects/uuid:2b818039-bde4-41d6-96ca-0367704a53f0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730480
University of Manchester
8.
Naureen, Ayesha.
A reliable and energy efficient data collection solution for Wireless Sensor Networks.
Degree: PhD, 2019, University of Manchester
URL: https://www.research.manchester.ac.uk/portal/en/theses/a-reliable-and-energy-efficient-data-collection-solution-for-wireless-sensor-networks(f380895f-0aac-4deb-a445-30b69479a3d4).html
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804091
► A Wireless Sensor Network (WSN) is a network of small, low-cost, battery-powered sensor nodes, with limited computational and communication capabilities. The sensor nodes collect certain…
(more)
▼ A Wireless Sensor Network (WSN) is a network of small, low-cost, battery-powered sensor nodes, with limited computational and communication capabilities. The sensor nodes collect certain data from an environment and send it to a Base Station (BS). It is important that the data collected by the sensor nodes is delivered reliably to the BS and with as low computational and communication loads (thus with low energy consumption) imposed on the sensor nodes, as possible. However, with unreliable communication channels and battery-powered and resource-constrained sensor nodes, achieving both reliability and energy-efficiency in a data collection process in a WSN is a challenging issue. Transmission redundancy, a measure typically used to achieve reliability, also results in an increase in communication loads imposed on each sensor node. This thesis attempts to address this challenging issue by applying two novel measures, which are: (i) adjust the level of transmission redundancy in response to network conditions, and (ii) use computation to reduce communication load on sensor nodes. The first measure can reduce the number of messages in the network while still achieving reliability, and the second measure can reduce both the number and the length of messages transmitted in the network, thus reducing energy consumption. To this end, the thesis has made the following contributions. Firstly, it proposes a novel Multi-Aggregator based Adjusted Multicast (MAAM) method to optimise the trade-off in achieving reliability and reducing energy consumption in delivering collected data from the sensor nodes to the BS. The optimisation is done in two ways, using data aggregation and adjusting the level of transmission redundancy in response to network conditions. In this research, the level of transmission redundancy is adjusted manually and as such an algorithm for automatic adjustment of the transmission redundancy level is currently not a part of MAAM. The data delivery ratios and the energy costs of the method have been investigated and compared against three existing data aggregation approaches (namely Single-Aggregator based Uni-Cast (SAUC), Multi-Aggregator based Uni-Cast (MAUC) and Multi-Aggregator based Broad-Cast (MABC)) under various network conditions. The results show that: (i) MAUC gives the best reliability and lowest energy costs when there are no failed nodes in the network, (ii) MABC has the highest energy costs under all network conditions but only provides reliability when the network is not congested, (iii) MAAM gives higher reliability and lower energy costs than MAUC in a network with failed nodes, and (iv) MAAM gives higher reliability than MABC in a congested network and lower energy costs than MABC under all network conditions. Secondly, it proposes a novel idea called Structured-data-representation-and-next-hop-node-Interpretation-and-Aggregation (SIA) to maximise the amount of data which can be collected for a given message payload length. To do so, SIA implements a novel method, called Revised Partial…
Subjects/Keywords: Wildlife Tracking; Data Aggregation; Topology Learning; Wireless Sensor Networks; Data Collection
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Naureen, A. (2019). A reliable and energy efficient data collection solution for Wireless Sensor Networks. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/a-reliable-and-energy-efficient-data-collection-solution-for-wireless-sensor-networks(f380895f-0aac-4deb-a445-30b69479a3d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804091
Chicago Manual of Style (16th Edition):
Naureen, Ayesha. “A reliable and energy efficient data collection solution for Wireless Sensor Networks.” 2019. Doctoral Dissertation, University of Manchester. Accessed March 07, 2021.
https://www.research.manchester.ac.uk/portal/en/theses/a-reliable-and-energy-efficient-data-collection-solution-for-wireless-sensor-networks(f380895f-0aac-4deb-a445-30b69479a3d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804091.
MLA Handbook (7th Edition):
Naureen, Ayesha. “A reliable and energy efficient data collection solution for Wireless Sensor Networks.” 2019. Web. 07 Mar 2021.
Vancouver:
Naureen A. A reliable and energy efficient data collection solution for Wireless Sensor Networks. [Internet] [Doctoral dissertation]. University of Manchester; 2019. [cited 2021 Mar 07].
Available from: https://www.research.manchester.ac.uk/portal/en/theses/a-reliable-and-energy-efficient-data-collection-solution-for-wireless-sensor-networks(f380895f-0aac-4deb-a445-30b69479a3d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804091.
Council of Science Editors:
Naureen A. A reliable and energy efficient data collection solution for Wireless Sensor Networks. [Doctoral Dissertation]. University of Manchester; 2019. Available from: https://www.research.manchester.ac.uk/portal/en/theses/a-reliable-and-energy-efficient-data-collection-solution-for-wireless-sensor-networks(f380895f-0aac-4deb-a445-30b69479a3d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804091
Georgia State University
9.
Li, Ji.
Data Collection and Aggregation in Mobile Sensing.
Degree: PhD, Computer Science, 2018, Georgia State University
URL: https://scholarworks.gsu.edu/cs_diss/143
► Nowadays, smartphones have become ubiquitous and are playing a critical role in key aspects of people's daily life such as communication, entertainment and social…
(more)
▼ Nowadays, smartphones have become ubiquitous and are playing a critical role in key aspects of people's daily life such as communication, entertainment and social activities. Most smartphones are equipped with multiple embedded sensors such as GPS (Global Positioning System), accelerometer, camera, etc, and have diverse sensing capacity. Moreover, the emergence of wearable devices also enhances the sensing capabilities of smartphones since most wearable devices can exchange sensory
data with smartphones via network interfaces. Therefore, mobile sensing have led to numerous innovative applications in various fields including environmental monitoring, transportation, healthcare, safety and so on. While all these applications are based on two critical techniques in mobile sensing, which are
data collection and
data aggregation, respectively.
Data collection is to collect all the sensory
data in the network while
data aggregation is any process in which information is gathered and expressed in a summary form such as SUM or AVERAGE. Obviously, the above two problems can be solved by simply collect all the sensory
data in the whole network. But that will lead to huge communication cost. This dissertation is to reduce the huge communication cost in
data collection and
data aggregation in mobile sensing where the following two technical routes are applied. The first technical route is to use sampling techniques such as uniform sampling or Bernoulli sampling. In this way, an
aggregation result with acceptable error can be can be calculate while only a small part of mobile phones need to submit their sensory
data. The second technical rout is location-based sensing in which every mobile phone submits its geographical position and the mobile sensing platform will use the submitted positions to filter useless sensory
data. The experiment results indicate the proposed methods have high performance.
Advisors/Committee Members: Zhipeng Cai.
Subjects/Keywords: Data aggregation; Data Collection; Sampling; Smartphone; Crowdsensing; Auction
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, J. (2018). Data Collection and Aggregation in Mobile Sensing. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/143
Chicago Manual of Style (16th Edition):
Li, Ji. “Data Collection and Aggregation in Mobile Sensing.” 2018. Doctoral Dissertation, Georgia State University. Accessed March 07, 2021.
https://scholarworks.gsu.edu/cs_diss/143.
MLA Handbook (7th Edition):
Li, Ji. “Data Collection and Aggregation in Mobile Sensing.” 2018. Web. 07 Mar 2021.
Vancouver:
Li J. Data Collection and Aggregation in Mobile Sensing. [Internet] [Doctoral dissertation]. Georgia State University; 2018. [cited 2021 Mar 07].
Available from: https://scholarworks.gsu.edu/cs_diss/143.
Council of Science Editors:
Li J. Data Collection and Aggregation in Mobile Sensing. [Doctoral Dissertation]. Georgia State University; 2018. Available from: https://scholarworks.gsu.edu/cs_diss/143
University of Western Ontario
10.
Yu, Tianqi.
Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks.
Degree: 2015, University of Western Ontario
URL: https://ir.lib.uwo.ca/etd/3099
► With the combination of wireless communications and embedded system, lots of progress has been made in the area of wireless sensor networks (WSNs). The networks…
(more)
▼ With the combination of wireless communications and embedded system, lots of progress has been made in the area of wireless sensor networks (WSNs). The networks have already been widely deployed, due to their self-organization capacity and low-cost advantage. However, there are still some technical challenges needed to be addressed. In the thesis, three algorithms are proposed in improving network energy efficiency, detecting data fault and reducing data redundancy.
The basic principle behind the proposed algorithms is correlation in the data collected by WSNs. The first sensor scheduling algorithm is based on the spatial correlation between neighbor sensor readings. Given the spatial correlation, sensor nodes are clustered into groups. At each time instance, only one node within each group works as group representative, namely, sensing and transmitting sensor data. Sensor nodes take turns to be group representative. Therefore, the energy consumed by other sensor nodes within the same group can be saved.
Due to the continuous nature of the data to be collected, temporal and spatial correlation of sensor data has been exploited to detect the faulty data. By exploitation of temporal correlation, the normal range of upcoming sensor data can be predicted by the historical observations. Based on spatial correlation, weighted neighbor voting can be used to diagnose whether the value of sensor data is reliable. The status of the sensor data, normal or faulty, is decided by the combination of these two proposed detection procedures.
Similar to the sensor scheduling algorithm, the recursive principal component analysis (RPCA) based algorithm has been studied to detect faulty data and aggregate redundant data by exploitation of spatial correlation as well. The R-PCA model is used to process the sensor data, with the help of squared prediction error (SPE) score and cumulative percentage formula. When SPE score of a collected datum is distinctly larger than that of normal data, faults can be detected. The data dimension is reduced according to the calculation result of cumulative percentage formula. All the algorithms are simulated in OPNET or MATLAB based on practical and synthetic datasets. Performances of the proposed algorithms are evaluated in each chapter.
Subjects/Keywords: data correlation; energy efficiency; data fault detection; data aggregation; wireless sensor networks; Systems and Communications
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, T. (2015). Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/3099
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yu, Tianqi. “Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks.” 2015. Thesis, University of Western Ontario. Accessed March 07, 2021.
https://ir.lib.uwo.ca/etd/3099.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yu, Tianqi. “Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks.” 2015. Web. 07 Mar 2021.
Vancouver:
Yu T. Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks. [Internet] [Thesis]. University of Western Ontario; 2015. [cited 2021 Mar 07].
Available from: https://ir.lib.uwo.ca/etd/3099.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yu T. Exploitation of Data Correlation and Performance Enhancement in Wireless Sensor Networks. [Thesis]. University of Western Ontario; 2015. Available from: https://ir.lib.uwo.ca/etd/3099
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Utah State University
11.
Sharif, Abbass.
Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R.
Degree: PhD, Mathematics and Statistics, 2012, Utah State University
URL: https://digitalcommons.usu.edu/etd/1394
► Actigraphy, a technology for measuring a subject's overall activity level almost continuously over time, has gained a lot of momentum over the last few…
(more)
▼ Actigraphy, a technology for measuring a
subject's overall activity level almost continuously over time, has gained a lot of momentum over the last few years. An actigraph, a watch-like device that can be attached to the wrist or ankle of a
subject, uses an accelerometer to measure human movement every minute or even every 15 seconds. Actigraphy
data is often treated as functional
data. In this dissertation, we discuss what has been done regarding the visualization of actigraphy
data, and then we will explain the three main goals we achieved: (i) develop new multivariate visualization techniques for actigraphy
data; (ii) integrate the new and current visualization tools into an R package using object-oriented model design; and (iii) develop an adaptive user-friendly web interface for actigraphy software.
Advisors/Committee Members: Jürgen Symanzik, Piotr S. Kokoszka, Daniel C. Coster, ;.
Subjects/Keywords: data aggregation; data envelopes; data images; density-based plots; time series; visualization; Statistics and Probability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharif, A. (2012). Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R. (Doctoral Dissertation). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/1394
Chicago Manual of Style (16th Edition):
Sharif, Abbass. “Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R.” 2012. Doctoral Dissertation, Utah State University. Accessed March 07, 2021.
https://digitalcommons.usu.edu/etd/1394.
MLA Handbook (7th Edition):
Sharif, Abbass. “Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R.” 2012. Web. 07 Mar 2021.
Vancouver:
Sharif A. Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R. [Internet] [Doctoral dissertation]. Utah State University; 2012. [cited 2021 Mar 07].
Available from: https://digitalcommons.usu.edu/etd/1394.
Council of Science Editors:
Sharif A. Visual Data Mining Techniques for Functional Actigraphy Data: An Object-Oriented Approach in R. [Doctoral Dissertation]. Utah State University; 2012. Available from: https://digitalcommons.usu.edu/etd/1394
NSYSU
12.
Chen, Yen-hao.
A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid.
Degree: Master, Computer Science and Engineering, 2016, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-101030
► Smart grids have become a future trend due to the development of technology and increased energy demand and consumption. In smart grids, usersâ electricity consumption…
(more)
▼ Smart grids have become a future trend due to the development of technology and increased
energy demand and consumption. In smart grids, usersâ electricity consumption is
recorded by their smart meters, and the smart meters submit the
data to the operation center in
each time unit for monitoring. The operation center analyzes the
data it receives to estimate
usersâ electricity usage in the next time unit and to ensure dynamic energy distribution. Compared
to traditional grids, the electricity can be flexibly controlled, and waste is decreased in
smart grids. However, details of usersâ daily lives may be leaked out through the frequent monitoring
of usersâ electricity usage, which causes the problem of privacy preserving. To solve
the problem,
data aggregation mechanisms are adopted in this environment. The power usage
data in the same units are aggregated before being sent to the operation center. This
aggregation
prevents personal electricity usage
data from being shared with the operation center. Thus,
usersâ privacy is protected.
Along with the increase in the number of research studies on smart grids, many studies on
the privacy-preserving issues of power usage have been published. However, both power usage
data and electricity payment
data may jeopardize usersâ privacy. The operation center is able to
obtain usersâ private information by analyzing usersâ electricity payments. Therefore, we propose
a verifiable privacy-preserving payment mechanism for smart grids. In our scheme, users
can submit electricity payments without revealing any private information, and the operation
center can verify the correctness of the payment.
Advisors/Committee Members: Chun-Yuan Hsiao (chair), Yi-Ter Chan (chair), Ray-Lin Tso (chair), Chun-I Fan (committee member), Wen-Sheng Juang (chair).
Subjects/Keywords: Blind Signature; Privacy-Preserving; Electronic Cash; Data Aggregation; Smart Grid
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, Y. (2016). A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-101030
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chen, Yen-hao. “A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid.” 2016. Thesis, NSYSU. Accessed March 07, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-101030.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Yen-hao. “A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid.” 2016. Web. 07 Mar 2021.
Vancouver:
Chen Y. A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 Mar 07].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-101030.
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. A Verifiable Payment Mechanism with Privacy-Preserving in Smart Grid. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-101030
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
13.
Lin, Yi-Hui.
Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid.
Degree: Master, Computer Science and Engineering, 2015, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806115-172034
► In smart gird environment, the power usage will be monitored and managed by an operation center that will also dynamically adjust the supply and demand…
(more)
▼ In smart gird environment, the power usage will be monitored and managed by an operation center that will also dynamically adjust the supply and demand curve of power usage, and detect threat and failures in real time. In such a system, each user will report her/his information of power usage every time unit, e.g. 15 minutes. The operation center will estimate usersâenergy consumption of the next time unit through this information and distribute energy to users. With the real-time monitoring, smart grid efficiently reduces the energy consumption compared with traditional architectures. However, the frequent monitoring may expose the routines and schedules of users. It brings out the privacy issues in smart grid. The
data received by the operation center is âaccumulatedâ, and hence, they reveal nothing about the private information of each user.
To the best of our knowledge, no
data aggregation scheme in smart grid can achieve flexible
data query, which would be a useful property in such environment. Therefor we will propose a novel and flexible
data aggregation scheme in smart grid. Our scheme achieves the required security properties of smart grid, including confidentiality and
data integrity. A user can make a flexible query to investigate the accumulated usage of specific time units. Compared with traditional or straightforward approaches, the storage cost of our scheme only linearly increases with the number of time units, which is much lower than others.
Advisors/Committee Members: Chun-Yuan Hsiao (chair), Raylin Tso (chair), Chih-Hung Wang (chair), Chun-I Fan (committee member), I-Te Chen (chair).
Subjects/Keywords: Smart Grid; Paillier Cryptosystem; Super-increasing Sequence; Data Aggregation; Privacy-Preserving
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lin, Y. (2015). Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806115-172034
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lin, Yi-Hui. “Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid.” 2015. Thesis, NSYSU. Accessed March 07, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806115-172034.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lin, Yi-Hui. “Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid.” 2015. Web. 07 Mar 2021.
Vancouver:
Lin Y. Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Mar 07].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806115-172034.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lin Y. Flexible and Privacy-Preserving Data Aggregation Scheme in Smart Grid. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806115-172034
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
14.
Lai, Yi-Lung.
Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid.
Degree: Master, Computer Science and Engineering, 2012, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828112-111442
► The issue of energy shortage has arisen in recent years. All countries must discuss the manner to reduce energy consumption, and smart grid is a…
(more)
▼ The issue of energy shortage has arisen in recent years.
All countries must discuss the manner to reduce energy consumption, and smart grid is a better one of the solutions.
According to related researches, energy consumption can be effectively reduced using energy management information of smart grids.
By using smart grids, electricity suppliers can learn about the current energy consumption of neighborhoods, and control the electrical energy generation and price of electrical energy. Users can learn the current price of electrical energy and obtain energy management information from smart meters for energy management and device control. However, electricity consumptions of users may divulge the privacy information of users. Therefore, privacy of users and communication security of smart grid become crucial security issues. In this thesis, we propose a provably secure power usage
data aggregation scheme for smart grids. Electricity suppliers can learn about the current power usage of neighborhoods without knowing the individual electricity consumption of each user, and use the current power usage of neighborhoods to arrange energy distribution. Therefore, electricity suppliers cannot use the
data to reveal lifestyles of each user. In our scheme, the transmission information is encrypted and signed to prevent theft or tampering of
data. Finally, we also provide formal proofs for our scheme in this thesis.
Advisors/Committee Members: Shi-Ming Huang (chair), D. J. Guan (chair), Chun-I Fan (committee member), Chi-Yao Weng (chair), Wei-Che Sun (chair).
Subjects/Keywords: Smart grid; Smart meter; Data aggregation; Privacy; Energy management
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lai, Y. (2012). Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828112-111442
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lai, Yi-Lung. “Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid.” 2012. Thesis, NSYSU. Accessed March 07, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828112-111442.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lai, Yi-Lung. “Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid.” 2012. Web. 07 Mar 2021.
Vancouver:
Lai Y. Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 Mar 07].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828112-111442.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lai Y. Privacy-Preserving Distributed Data Aggregation Scheme with Public Verification in Smart Grid. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828112-111442
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Vanderbilt University
15.
Samuels, Lauren Ruth.
Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching.
Degree: PhD, Biostatistics, 2016, Vanderbilt University
URL: http://hdl.handle.net/1803/15265
► This dissertation consists of three papers related to causal inference about the evenly matchable units in observational studies of treatment effect. The first paper begins…
(more)
▼ This dissertation consists of three papers related to causal inference about the evenly matchable units in observational studies of treatment effect. The first paper begins by defining the evenly matchable units in a sample or population in which the effect of a binary treatment is of interest: a unit is evenly matchable if the localized region of the (possibly transformed) covariate space centered on that unit contains at least as many units from the opposite group as from its own group. The paper then defines the average treatment effect on the evenly matchable units (ATM) and continues with a discussion of currently available matching methods that can be used to estimate the ATM, followed by the introduction of three new weighting-based approaches to ATM estimation and a case study illustrating some of these techniques. The second paper introduces a freely available web application that allows analysts to combine information from covariate distributions and estimated propensity scores to create transparent, covariate-based study inclusion criteria as a first step in estimation of the ATM or other quantities. The app, Visual Pruner, is freely available at http://statcomp2.vanderbilt.edu:37212/VisualPruner and is easily incorporated into a reproducible-research workflow. The third paper introduces a new technique for estimation of the ATM or other estimands: bagged one-to-one matching (BOOM), which combines the bias-reducing properties of one-to-one matching with the variance-reducing properties of bootstrap aggregating, or bagging. In this paper I describe the BOOM algorithm in detail and investigate its performance in a simulation study and a case study. In the simulation study, the BOOM estimator achieves as much bias reduction as the estimator based on one-to-one matching, while having much lower variance. In the case study, BOOM yields estimates similar to those from one-to-one matching, with narrower 95% confidence intervals.
Advisors/Committee Members: Meira Epplein, Ph.D. (committee member), Matthew S. Shotwell, Ph.D. (committee member), Robert A. Greevy, Jr., Ph.D. (committee member), Bryan E. Shepherd, Ph.D. (Committee Chair).
Subjects/Keywords: observational studies; propensity scores; bootstrap aggregation; data visualization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Samuels, L. R. (2016). Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/15265
Chicago Manual of Style (16th Edition):
Samuels, Lauren Ruth. “Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching.” 2016. Doctoral Dissertation, Vanderbilt University. Accessed March 07, 2021.
http://hdl.handle.net/1803/15265.
MLA Handbook (7th Edition):
Samuels, Lauren Ruth. “Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching.” 2016. Web. 07 Mar 2021.
Vancouver:
Samuels LR. Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching. [Internet] [Doctoral dissertation]. Vanderbilt University; 2016. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1803/15265.
Council of Science Editors:
Samuels LR. Aspects of Causal Inference within the Evenly Matchable Population: The Average Treatment Effect on the Evenly Matchable Units, Visually Guided Cohort Selection, and Bagged One-to-One Matching. [Doctoral Dissertation]. Vanderbilt University; 2016. Available from: http://hdl.handle.net/1803/15265
Anna University
16.
Sandhya M K.
Secure data aggregation and forwarding in wireless sensor
networks;.
Degree: Secure data aggregation and forwarding in wireless
sensor networks, 2015, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/49404
► Wireless sensor networks WSNs consist of numerous low power sensor nodes with limited computing ability and storage capacity These sensor nodes sense events from the…
(more)
▼ Wireless sensor networks WSNs consist of numerous
low power sensor nodes with limited computing ability and storage
capacity These sensor nodes sense events from the target field and
transmit them to an external base station Data aggregation is
carried out at the intermediate sensor nodes known as the
aggregator nodes to summarize the redundant data and transmit the
aggregated data to the base station Data aggregation significantly
reduces the communication overhead and also results in better
utilization of battery power Compromised sensor nodes can launch
various attacks like false data injection Sybil attacks Denial of
Service DoS attacks etc in WSNs The injection of false data
disrupts the accuracy of the aggregated data and poses a serious
threat to data integrity Moreover the transmission of false data to
the base station depletes battery power unnecessarily leading to
reduced network lifetime Hence false data elimination during data
aggregation and forwarding is essential for providing security and
effective utilization of battery power The security mechanisms
developed for WSNs must take into consideration the resource and
energy constraints of the sensor nodes newlineThis dissertation
addresses the security issues pertaining to data aggregation and
forwarding in WSNs Various schemes are proposed to provide secure
data aggregation by eliminating the injected false data and to
ensure confidential data transmission to the base station newline
newline
reference p151-161.
Advisors/Committee Members: Murugan K.
Subjects/Keywords: Data aggregation; Denial of Service; Wireless sensor networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
K, S. M. (2015). Secure data aggregation and forwarding in wireless sensor
networks;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/49404
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
K, Sandhya M. “Secure data aggregation and forwarding in wireless sensor
networks;.” 2015. Thesis, Anna University. Accessed March 07, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/49404.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
K, Sandhya M. “Secure data aggregation and forwarding in wireless sensor
networks;.” 2015. Web. 07 Mar 2021.
Vancouver:
K SM. Secure data aggregation and forwarding in wireless sensor
networks;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Mar 07].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/49404.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
K SM. Secure data aggregation and forwarding in wireless sensor
networks;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/49404
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
17.
Li, Qinghua.
Security and Privacy Support for Mobile Sensing.
Degree: 2013, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/18661
► The proliferation and ever-increasing capabilities of mobile devices such as smart phones give rise to a variety of mobile sensing systems, which collect data from…
(more)
▼ The proliferation and ever-increasing capabilities of mobile devices such as smart phones give rise to a variety of mobile sensing systems, which collect
data from the embedded sensors of mobile devices to make sophisticated inferences about people and their surroundings. Mobile sensing can be applied to environmental monitoring, traffic monitoring, healthcare, etc. However, the large-scale deployment of mobile sensing applications is hindered by several challenges, including privacy leakage from sensing
data, the lack of incentives for mobile device users to participate, and the lack of security mechanisms for
data collection when communication infrastructure is unavailable.
The specific goal of this dissertation is to provide security and privacy support for mobile sensing. We achieve this goal by devising techniques to address the aforementioned challenges. First, to provide incentives for users to participate and at the same time preserve privacy, we propose two credit-based privacy-aware incentive schemes for mobile sensing. These schemes reward users with credits for their contributed
data without exposing who contributes the
data. They also ensure that dishonest users cannot abuse the system to earn unlimited credits. One scheme relies on a trusted third party to protect privacy. The other scheme removes the assumption of trusted third party, and provides unconditional privacy by combining blind signature, partially blind signature, and commitment techniques. Second, for a broad class of applications that need to periodically collect useful aggregate statistics of sensing
data, we propose a privacy-preserving
aggregation protocol for the Sum aggregate, which can provide differential privacy – a strong and provable privacy guarantee. To perform private and efficient
aggregation, we design a novel HMAC-based encryption scheme which allows the aggregator to get the sum of all users'
data but nothing else, and a novel ring-based overlapped grouping technique to efficiently deal with dynamic joins and leaves of users. We also extend the
aggregation scheme for Sum to derive Max/Min and other aggregate statistics. Third, for mobile devices without communication infrastructure support, opportunistic mobile networking techniques are used to connect these devices. We address three security issues that may degrade the performance of sensing
data collection in opportunistic mobile networks: social selfishness, flood attacks, and routing misbehavior. Specifically, we propose a Social Selfishness Aware Routing (SSAR) protocol which allows users to behave in the socially selfish way but improves routing performance by considering user selfishness into relay selection; we employ rate limiting to defend against flood attacks and design a distributed scheme which can probabilistically detect the violation of rate limit; to mitigate routing misbehavior, we devise a distributed scheme to detect packet dropping in opportunistic mobile networks and an algorithm to reduce the amount of packets forwarded to misbehaving users.
Advisors/Committee Members: Guohong Cao, Dissertation Advisor/Co-Advisor, Thomas F Laporta, Committee Member, Sencun Zhu, Committee Member, Aylin Yener, Committee Member.
Subjects/Keywords: mobile sensing; security and privacy; incentive; data aggregation; opportunistic mobile networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, Q. (2013). Security and Privacy Support for Mobile Sensing. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/18661
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Li, Qinghua. “Security and Privacy Support for Mobile Sensing.” 2013. Thesis, Penn State University. Accessed March 07, 2021.
https://submit-etda.libraries.psu.edu/catalog/18661.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Li, Qinghua. “Security and Privacy Support for Mobile Sensing.” 2013. Web. 07 Mar 2021.
Vancouver:
Li Q. Security and Privacy Support for Mobile Sensing. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Mar 07].
Available from: https://submit-etda.libraries.psu.edu/catalog/18661.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Li Q. Security and Privacy Support for Mobile Sensing. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/18661
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
North Carolina State University
18.
Park, Sangjoon.
Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.
Degree: PhD, Computer Science, 2006, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/5744
► Wireless sensor networks are suitable for applications in which sensors detect moving targets in the area of interest. In such applications, one of the key…
(more)
▼ Wireless sensor networks are suitable for applications in which sensors detect moving targets in the area of interest. In such applications, one of the key challenges is how to design efficient
data aggregation protocols which reduce redundant packet transmissions in the sensor network. Towards this goal, centralized, tree-based, static-cluster, and dynamic-cluster
aggregation schemes have been proposed. However, each scheme has its share of benefits and corresponding costs, and it is difficult to say with certainty whether a particular scheme is always better than others. In this paper, our goal is to compare all of the above mentioned
aggregation schemes with comprehensive theoretical analysis, simulation and real experiments and attempt to give clear scenarios where a particular scheme may be more beneficial compared to others. Along the way, we also propose two cluster-based
aggregation algorithms, which are simple enough to be implemented on resource-constrained sensor networks. As a first step towards this goal, we model the sensor network environment under certain simplifying assumptions and then derive closed form expressions for the total number of packet transmissions incurred by each
aggregation scheme. Next, we complement the assumptions made for the analysis by performing extensive simulations under different environmental conditions, such as channel capacity (1Mbps, 250Kbbps) and MAC (B-MAC, IEEE 802.11) protocol. Finally, we test the
aggregation schemes on a real sensor network testbed comprising of 31 Mica2 sensors. Various metrics, such as total number of packet transmissions,
aggregation ratio, average energy consumption, network lifetime, average end-to-end delay, and packet delivery ratio, are used to evaluate the performance of
aggregation schemes.
The results show that the performance of
data aggregation is highly dependant on setup overhead, node density, sensing range, and the distance from sources to the sink. When the sources are close to the sink and the sensing range is short, tree-based
aggregation, with long
aggregation delay, achieves better performance in all metrics, except end-to-end delays. However, as the distance from sources to the sink and the sensing range increase, dynamic-cluster
aggregation shows the best performance over other schemes, because a large number of generated packets are reduced by the local
data aggregation.
Advisors/Committee Members: Injong Rhee, Committee Chair (advisor).
Subjects/Keywords: Mica2; data aggregation; sensor network
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Park, S. (2006). Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5744
Chicago Manual of Style (16th Edition):
Park, Sangjoon. “Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.” 2006. Doctoral Dissertation, North Carolina State University. Accessed March 07, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/5744.
MLA Handbook (7th Edition):
Park, Sangjoon. “Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.” 2006. Web. 07 Mar 2021.
Vancouver:
Park S. Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. [Internet] [Doctoral dissertation]. North Carolina State University; 2006. [cited 2021 Mar 07].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/5744.
Council of Science Editors:
Park S. Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. [Doctoral Dissertation]. North Carolina State University; 2006. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5744
University of Newcastle
19.
Tran, Duy Tung.
The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables.
Degree: PhD, 2019, University of Newcastle
URL: http://hdl.handle.net/1959.13/1397754
► Research Doctorate - Doctor of Philosophy (PhD)
Data aggregation often occurs due to data collection methods or confidentiality laws imposed by government and institutional organisations.…
(more)
▼ Research Doctorate - Doctor of Philosophy (PhD)
Data aggregation often occurs due to data collection methods or confidentiality laws imposed by government and institutional organisations. This is largely due to confidentiality issues arising from the imposition of government and corporate protection and data collection methods. The availability of only aggregate data makes it difficult to draw conclusions about the association between categorical variables at the individual level. For data analysts, this issue is of growing concern, especially for those dealing with the aggregate analysis of a single 2x2 table, or stratified, 2x2 tables and lies in the field of ecological inference (EI). Currently, there are a number of EI approaches that are available and provide data analysts with tools to analyse aggregated data. Nonetheless, their results are still questionable due to the variety of assumptions that are made about the individual level data, or the models that are developed to analyse them. As an alternative to ecological inference, one may consider the Aggregate Association Index (AAI) proposed by Beh (2008, 2010). This index gives data analysts an indication of the likely association structure between two categorical variables of a single 2x2 contingency table when the individual level, or joint frequency, data are unknown. To date, the AAI has been developed only for the analysis of a single 2x2 table. Hence, the purpose of this thesis is to extend the application of the AAI to the case where aggregated data from multiple 2x2 tables (i.e. stratified 2x2 tables) require analysis.
Advisors/Committee Members: University of Newcastle. Faculty of Science, School of Mathematical and Physical Sciences.
Subjects/Keywords: aggregate association index; data aggregation; contingency tables; aggregate association index curves
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tran, D. T. (2019). The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1397754
Chicago Manual of Style (16th Edition):
Tran, Duy Tung. “The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables.” 2019. Doctoral Dissertation, University of Newcastle. Accessed March 07, 2021.
http://hdl.handle.net/1959.13/1397754.
MLA Handbook (7th Edition):
Tran, Duy Tung. “The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables.” 2019. Web. 07 Mar 2021.
Vancouver:
Tran DT. The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables. [Internet] [Doctoral dissertation]. University of Newcastle; 2019. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1959.13/1397754.
Council of Science Editors:
Tran DT. The aggregate association index and its extension for the analysis of multiple 2x2 contingency tables. [Doctoral Dissertation]. University of Newcastle; 2019. Available from: http://hdl.handle.net/1959.13/1397754
George Mason University
20.
Rozenbroek, Thomas H.
External Labeling as a Framework for Access Control
.
Degree: 2012, George Mason University
URL: http://hdl.handle.net/1920/7871
► With the ever increasing volume of data existing on and passing through on-line resources together with a growing number of legitimate users of that information…
(more)
▼ With the ever increasing volume of
data existing on and passing through on-line
resources together with a growing number of legitimate users of that information and
potential adversaries, the need for better security and safeguards is immediate and
critical. Currently, most of the security and safeguards afforded on-line information are
provided externally by the infrastructure and are based on security information that is
also maintained by that infrastructure. As the infrastructure increases in size and
interconnection, the more insecure the movement of information throughout the
infrastructure becomes. The interconnection of different infrastructures means that there
is a need for greater need for coordination between the infrastructures. Unfortunately,
this is not always possible.
An alternative to strict reliance on the infrastructure is to include security attributes along
with the objects that need to be secured. It is possible to improve the security of this
information by attaching the external security labels to these objects. These external labels, which contain the required security information, are transferred as an integral part
of the object’s migration throughout the infrastructure. This dissertation presents a
framework for using external labels that will provide better safeguards for securing
information. This framework is object based and as such is applicable to anything,
virtual or real-world, that can be represented or treated as ‘an object’. It discusses how
each entity within the infrastructure must be labeled to support the increase in security as
well as provide the framework for assessing the user and system labels against those of
the information objects.
This dissertation presents and details the key features of the labeling solutions and
explains the reasons why each of the features is necessary for the labeling framework to
secure objects. The framework is based on securely attaching labels to the objects, while
still allowing for the separation of the labels from the object. This separation must take
place without the lessening the security afforded the objects. The second feature of the
framework is the treatment of the object labels, themselves. The framework applies
labels to the objects being protected, the users requesting access to the objects, and the
end user and intermediate systems handling the objects. This provides for better
management of the environment and therefore greater security for the objects. The final
key feature of the framework is abstract nature of the objects and their labels. This
framework places no limitation on either the objects being secured or the content of the
labels. Any information that can be treated as an object can be handled by this
framework. Also, any rules that can be modeled can be supported by the framework.
This framework as proposed by this dissertation includes several types of labels that can be used to secure objects. This types of labels presented can be easily extended to meet
the unique needs of…
Advisors/Committee Members: Sibley, Edgar H (advisor).
Subjects/Keywords: access control;
Object Labeling;
Data Aggregation;
External Metadata;
Information Security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rozenbroek, T. H. (2012). External Labeling as a Framework for Access Control
. (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/7871
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Rozenbroek, Thomas H. “External Labeling as a Framework for Access Control
.” 2012. Thesis, George Mason University. Accessed March 07, 2021.
http://hdl.handle.net/1920/7871.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Rozenbroek, Thomas H. “External Labeling as a Framework for Access Control
.” 2012. Web. 07 Mar 2021.
Vancouver:
Rozenbroek TH. External Labeling as a Framework for Access Control
. [Internet] [Thesis]. George Mason University; 2012. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1920/7871.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Rozenbroek TH. External Labeling as a Framework for Access Control
. [Thesis]. George Mason University; 2012. Available from: http://hdl.handle.net/1920/7871
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Delft University of Technology
21.
Chronopoulos, D. (author).
Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks.
Degree: 2016, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:7e7b52b0-cf55-4d29-8809-b6d6357bfe0d
► Wireless Sensor Networks (WSNs) are networks of sensor devices that perform environmental monitoring applications. Data aggregation is a vital building block for WSNs that enables…
(more)
▼ Wireless Sensor Networks (WSNs) are networks of sensor devices that perform environmental monitoring applications. Data aggregation is a vital building block for WSNs that enables rapid gather the information held by the network nodes. A continuous study of different approaches to retrieving aggregates is being carried out by the researchers of the field since the emergence of WSNs. This study has resulted in a plethora of aggregation protocols, each with their own advantages and flaws. Recent efforts have given us Chaos, a very powerful tool able to perform network-wide data aggregation. In contrast to its predecessors Chaos performs aggregation with a topology-agnostic communication primitive, embracing pure wireless broadcasts to create extremely fast and energy-efficient aggregation rounds. Although Chaos outperforms other solutions in terms of time and energy efficiency, it also has significant shortcomings. Specifically, in order to operate properly, Chaos imposes strict restrictions on the network composition, which prevent it from adapting to the dynamic nature of WSNs. Additionally, Chaos needs to reserve a portion of space in every transmitted packet whose size is proportional to that of the network; making its scalability questionable on larger networks. In this work we identified the above shortcomings along with their causes, which reside in the core mechanisms Chaos employs, and in the natural phenomena that govern its behaviour. To overcome these shortcomings, we propose a new coordinating data structure based on order-statistics theory, and a flow control technique to avoid congestion. Re-building the core mechanisms of the protocol around these proposals lead to a topology-agnostic primitive that is not only highly efficient (like Chaos), but also more able to cope with the practical challenges and needs of sensor network applications. Our evaluation, performed on two different testbeds, shows that our protocol (i) is more scalable; (ii) is highly tolerant to network dynamics; (iii) allows the retrieval of more types of aggregates; and (iv) reduces the aggregation latency (by up to 15%) while attaining a comparable reliability.
Embedded Systems
Software Technology
Electrical Engineering, Mathematics and Computer Science
Advisors/Committee Members: Cattani, M. (mentor).
Subjects/Keywords: WSN; Data-Aggregation; Neighbor-Discovery; Chaos; Synchronous; Flooding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chronopoulos, D. (. (2016). Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7e7b52b0-cf55-4d29-8809-b6d6357bfe0d
Chicago Manual of Style (16th Edition):
Chronopoulos, D (author). “Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks.” 2016. Masters Thesis, Delft University of Technology. Accessed March 07, 2021.
http://resolver.tudelft.nl/uuid:7e7b52b0-cf55-4d29-8809-b6d6357bfe0d.
MLA Handbook (7th Edition):
Chronopoulos, D (author). “Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks.” 2016. Web. 07 Mar 2021.
Vancouver:
Chronopoulos D(. Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2021 Mar 07].
Available from: http://resolver.tudelft.nl/uuid:7e7b52b0-cf55-4d29-8809-b6d6357bfe0d.
Council of Science Editors:
Chronopoulos D(. Extreme Chaos: Flexible and Efficient All-to-All Data Aggregation for Wireless Sensor Networks. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:7e7b52b0-cf55-4d29-8809-b6d6357bfe0d
Delft University of Technology
22.
Yazan, Ahmet (author).
Asset Aggregation: Structuring condition data for decision-making.
Degree: 2020, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:6bc2968e-9103-46ec-80be-b1ebdad63466
► One of the many challenges in infrastructure management lies in managing built assets. Managing means repairing, rehabilitating and replacing assets to ensure they are able…
(more)
▼ One of the many challenges in infrastructure management lies in managing built assets. Managing means repairing, rehabilitating and replacing assets to ensure they are able to safely fulfill their functions. To manage infrastructure assets, detailed information about the condition of all components of the asset is required to make substantiated decisions. Assets are composed of several elements and components. Individual component condition reports represent the condition found during visual inspection. The challenge for infrastructure asset managers is how to convert data about component inspections into useful information which are aggregated to make sounds decisions on the maintenance of assets in systems. Useful data that provides information about the condition of assets in systems, which are used to support budget allocation and to prioritize maintenance, is scarce. Information may be lacking, may be incomplete, may be unorganized or may need to be deciphered before it becomes useful in decision making. Furthermore, this data would be unhelpful statistics if one does not know how to apply this information to identify problems and create solutions. At a system level, infrastructure managers need to prioritize maintenance and allocate scarce resources.
Civil Engineering | Construction Management and Engineering
Advisors/Committee Members: Hertogh, Marcel (graduation committee), van den Boomen, Martine (mentor), de Bruijne, Mark (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Asset Management; Aggregation; Condition; Infrastructure; Data; Maintenance; Decision-making
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yazan, A. (. (2020). Asset Aggregation: Structuring condition data for decision-making. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6bc2968e-9103-46ec-80be-b1ebdad63466
Chicago Manual of Style (16th Edition):
Yazan, Ahmet (author). “Asset Aggregation: Structuring condition data for decision-making.” 2020. Masters Thesis, Delft University of Technology. Accessed March 07, 2021.
http://resolver.tudelft.nl/uuid:6bc2968e-9103-46ec-80be-b1ebdad63466.
MLA Handbook (7th Edition):
Yazan, Ahmet (author). “Asset Aggregation: Structuring condition data for decision-making.” 2020. Web. 07 Mar 2021.
Vancouver:
Yazan A(. Asset Aggregation: Structuring condition data for decision-making. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 07].
Available from: http://resolver.tudelft.nl/uuid:6bc2968e-9103-46ec-80be-b1ebdad63466.
Council of Science Editors:
Yazan A(. Asset Aggregation: Structuring condition data for decision-making. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:6bc2968e-9103-46ec-80be-b1ebdad63466
University of Missouri – Columbia
23.
Deng, Zhongyun.
The impact of the distribution of economic activity on the gravity model estimation of international trade.
Degree: 2012, University of Missouri – Columbia
URL: http://hdl.handle.net/10355/14987
► In this study, I test the gravity model in international trade in a series of simulation studies, with a focus on the impact of the…
(more)
▼ In this study, I test the gravity model in international trade in a series of simulation studies, with a focus on the impact of the distribution of economic activity, inter-regional distance measure, and the capital location choice in the gravity model estimation. Chapter 3 shows that the use of aggregated
data causes biases in the estimation of the gravity model. Chapter 4 examines the relationship between estimation biases and economic clustering. Chapter 5 estimates the gravity model with a wide selection of main cities, and examines how the location of main city influences the gravity model estimation.
Advisors/Committee Members: Trindade, Vitor (Vitor M.) (advisor).
Subjects/Keywords: data aggregation; spatial distribution; estimation bias; economic clustering; distance effect
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Deng, Z. (2012). The impact of the distribution of economic activity on the gravity model estimation of international trade. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/14987
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Deng, Zhongyun. “The impact of the distribution of economic activity on the gravity model estimation of international trade.” 2012. Thesis, University of Missouri – Columbia. Accessed March 07, 2021.
http://hdl.handle.net/10355/14987.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Deng, Zhongyun. “The impact of the distribution of economic activity on the gravity model estimation of international trade.” 2012. Web. 07 Mar 2021.
Vancouver:
Deng Z. The impact of the distribution of economic activity on the gravity model estimation of international trade. [Internet] [Thesis]. University of Missouri – Columbia; 2012. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10355/14987.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Deng Z. The impact of the distribution of economic activity on the gravity model estimation of international trade. [Thesis]. University of Missouri – Columbia; 2012. Available from: http://hdl.handle.net/10355/14987
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of New Mexico
24.
Groat, Michael.
Energy conserving privacy enhancing algorithms for resource-constrained devices.
Degree: Department of Computer Science, 2012, University of New Mexico
URL: http://hdl.handle.net/1928/22043
► Resource-constrained devices such as wireless sensor networks, body area networks, or smart phones collect confidential and sensitive information about their users. Traditional solutions to protect…
(more)
▼ Resource-constrained devices such as wireless sensor networks, body area networks, or smart phones collect confidential and sensitive information about their users. Traditional solutions to protect these
data, such as encryption, consume a significant amount of resources to be viable. In this dissertation, I present two energy efficient information collection protocols based on the notion that by relaxing the definition of privacy, such as using indistinguishability, energy use can be reduced. The first protocol, multi-dimensional negative surveys (MDNSs), protects multivariate categorical
data by perturbing sensed values to something other than what was actually sensed, and transmits the perturbed values to a central information collection server, providing privacy protection for information such as location. The second protocol, k-indistinguishable privacy-preserving
data aggregation (KIPDA), protects the privacy of
data that are aggregated in wireless sensor networks. It is specialized for the maximum and minimum
aggregation functions and is one of the first techniques to provide protection from other adversarial nodes in the network. Sensitive
data are obfuscated by hiding them among a set of camouflage values. Because the sensitive
data are not encrypted, they can be aggregated easily and efficiently with minimal in-network processing delay. While radio usage is expensive, I show through analysis, simulations, and implementations that broadcasting a modest amount of camouflage
data is more energy efficient when encryption is eliminated. Simulations and implementations on physical devices illustrate how both approaches can protect the privacy of a participant's
data, while reducing energy use and allowing useful aggregate information to be collected.
Advisors/Committee Members: Forrest, Stephanie, He, Wenbo, Darlington, Carlos Fernando Esponda, Lane, Terran, Saia, Jared.
Subjects/Keywords: Multidimensional Negative Surveys; Concealed Data Aggregation; Wireless Sensor Network Security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Groat, M. (2012). Energy conserving privacy enhancing algorithms for resource-constrained devices. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/22043
Chicago Manual of Style (16th Edition):
Groat, Michael. “Energy conserving privacy enhancing algorithms for resource-constrained devices.” 2012. Doctoral Dissertation, University of New Mexico. Accessed March 07, 2021.
http://hdl.handle.net/1928/22043.
MLA Handbook (7th Edition):
Groat, Michael. “Energy conserving privacy enhancing algorithms for resource-constrained devices.” 2012. Web. 07 Mar 2021.
Vancouver:
Groat M. Energy conserving privacy enhancing algorithms for resource-constrained devices. [Internet] [Doctoral dissertation]. University of New Mexico; 2012. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1928/22043.
Council of Science Editors:
Groat M. Energy conserving privacy enhancing algorithms for resource-constrained devices. [Doctoral Dissertation]. University of New Mexico; 2012. Available from: http://hdl.handle.net/1928/22043
University of Melbourne
25.
Lyu, Lingjuan.
Privacy-preserving machine learning and data aggregation for Internet of Things.
Degree: 2018, University of Melbourne
URL: http://hdl.handle.net/11343/224108
► The proliferation of Internet of Things (IoT) devices has contributed to the emergence of participatory sensing (PS) and collaborative learning (CL), where multiple participants collect…
(more)
▼ The proliferation of Internet of Things (IoT) devices has contributed to the emergence of participatory sensing (PS) and collaborative learning (CL), where multiple participants collect and report their data to a cloud service to analyse the union of the collected data in the server-based framework. While in the decentralized framework, multiple participants collaboratively train a more accurate global model or multiple local models. However, the possibility of the cloud service or any participant being semi-honest or malicious pose a serious challenge of preserving the participants' privacy. Privacy-preserving machine learning and data aggregation aim to discover or derive useful statistics without compromising privacy.
This thesis systematically investigates state-of-the-art techniques for privacy-preserving machine learning and data aggregation in a range of IoT applications. Extensive theoretical and experimental results are provided to support the following primary contributions.
First, we explore three privacy-preserving machine learning applications. Examples include collaborative anomaly detection, human activity recognition and decentralized collaboration in a biomedical domain. We tackle security challenges in collaborative anomaly detection with a two-stage scheme called RG+RT: in the first stage, participants individually perturb their data by passing through a nonlinear function called repeated Gompertz (RG); in the second stage, the perturbed data are projected to a lower dimension using a participant-specific uniform random transformation (RT) matrix. The nonlinear RG function is designed to mitigate maximum a posteriori (MAP) estimation attacks, while random transformation resists independent component analysis (ICA) attacks. For human activity recognition, a similar two-stage scheme called RG+RP is proposed, the difference lies in the second stage, where participants project their perturbed data to a lower dimension in an (almost) distance-preserving manner, using a random projection (RP) matrix. The random projection can both resist ICA attacks and maintain model accuracy. These proposed two-stage randomisation schemes are assessed in terms of their recovery resistance to MAP estimation attacks. Preliminary theoretical analysis as well as experimental results on synthetic and real-world datasets indicate that both RG+RT and RG+RP exhibit better recovery resistance to MAP estimation attacks than most state-of-the-art techniques, meanwhile high utility is guaranteed. To mitigate the inherent limitations in the centralized framework, and investigate the applicability of the decentralized framework, we study the decentralized collaboration in a biomedical domain. In particular, we develop an efficient Decentralized Privacy-Preserving Centroid Classifier (DPPCC) considering three practical scenarios, where distributed differential privacy (DDP) is combined with distributed exponential ElGamal cryptosystem to preserve privacy and maintain utility. We realize DDP using discrete Gaussian mechanism…
Subjects/Keywords: privacy-preserving; machine learning; data aggregation; Internet of Things
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lyu, L. (2018). Privacy-preserving machine learning and data aggregation for Internet of Things. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/224108
Chicago Manual of Style (16th Edition):
Lyu, Lingjuan. “Privacy-preserving machine learning and data aggregation for Internet of Things.” 2018. Doctoral Dissertation, University of Melbourne. Accessed March 07, 2021.
http://hdl.handle.net/11343/224108.
MLA Handbook (7th Edition):
Lyu, Lingjuan. “Privacy-preserving machine learning and data aggregation for Internet of Things.” 2018. Web. 07 Mar 2021.
Vancouver:
Lyu L. Privacy-preserving machine learning and data aggregation for Internet of Things. [Internet] [Doctoral dissertation]. University of Melbourne; 2018. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/11343/224108.
Council of Science Editors:
Lyu L. Privacy-preserving machine learning and data aggregation for Internet of Things. [Doctoral Dissertation]. University of Melbourne; 2018. Available from: http://hdl.handle.net/11343/224108
University of Southern California
26.
Schaefer, Bryan Patrick.
Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles.
Degree: MS, Geographic Information Science and
Technology, 2014, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/514559/rec/5923
► This project investigates gentrification-related displacement in the City of Los Angeles, California by introducing an analytic method that utilizes Volunteered Geographic Information (VGI). Data harvested…
(more)
▼ This project investigates gentrification-related
displacement in the City of Los Angeles, California by introducing
an analytic method that utilizes Volunteered Geographic Information
(VGI).
Data harvested from the social media network Twitter were
analyzed and the results compared against an established method to
assess risk of displacement that utilizes aggregated census
data.
Aggregated census
data are problematic in displacement research due
to spatial and temporal constraints. The purpose of this
investigation is to advance research on displacement by introducing
an alternative method to gain a better understanding of the dynamic
nature of gentrification and displacement by leveraging spatially
explicit real-time VGI
data. ❧ This study examined approximately
one million randomly harvested geotagged Twitter posts (tweets)
within the City of Los Angeles, from August 2013 to January 2014,
to investigate patterns of displacement. The research employed two
frameworks: 1) a traditional census-based
Data Aggregation Method;
and 2) an alternative VGI (Twitter) based method. The results
indicate that although tweets consisting of words related to
displacement were not densely located in census tracts that have a
high risk of displacement, as recorded by the
Data Aggregated
Method, areas of Los Angeles that are going through or just
finished revitalization projects did contain such tweets. If left
unmonitored, these areas could soon gentrify and displace as
indicated by their demographic change over the last twelve years.
In other words, the VGI Method detected a signal for potential
displacement. Further, the VGI Method shows that
data from Twitter
produced results that are comparable to an established method of
locating demographic change and go beyond an aggregated method’s
spatial and temporal level of analysis.
Advisors/Committee Members: Ruddell, Darren M. (Committee Chair), Warshawsky, Daniel N. (Committee Member), Kemp, Karen K. (Committee Member).
Subjects/Keywords: displacement; volunteered geographic information; data aggregation; social media; Twitter; Los Angeles
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Schaefer, B. P. (2014). Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/514559/rec/5923
Chicago Manual of Style (16th Edition):
Schaefer, Bryan Patrick. “Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles.” 2014. Masters Thesis, University of Southern California. Accessed March 07, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/514559/rec/5923.
MLA Handbook (7th Edition):
Schaefer, Bryan Patrick. “Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles.” 2014. Web. 07 Mar 2021.
Vancouver:
Schaefer BP. Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles. [Internet] [Masters thesis]. University of Southern California; 2014. [cited 2021 Mar 07].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/514559/rec/5923.
Council of Science Editors:
Schaefer BP. Social media to locate urban displacement: assessing the
risk of displacement using volunteered geographic information in
the city of Los Angeles. [Masters Thesis]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/514559/rec/5923
University of Kansas
27.
Han, Qing.
Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling.
Degree: PhD, Economics, 2019, University of Kansas
URL: http://hdl.handle.net/1808/29880
► This dissertation considers monetary services aggregation theory in Macroeconomics, the nonparametric approaches in Econometrics with censoring data and endogenous variables, and the macroeconomic dynamic modelling.…
(more)
▼ This dissertation considers monetary services
aggregation theory in Macroeconomics, the nonparametric approaches in Econometrics with censoring
data and endogenous variables, and the macroeconomic dynamic modelling. It contributes to the current literature in three ways. First, it extends the monetary
aggregation theory to incorporate Knightian uncertainty by using a non-additive probability measure. Our
aggregation theory under uncertainty nests the previous literature of the perfect certainty and/or risky cases. Second, we consider a nonparametric estimation of a censoring
data model with endogenous variables and transform the problem into a nonparametric LAD additive model for estimation and testing. Third, in the open economy literature, the high consumption correlation among different countries is a stubborn anomaly. We establish an open economy Dynamic Stochastic General Equilibrium (DSGE) model that successfully solves this problem. The model must feature asymmetric preference, incomplete financial markets, and terms of trade shocks at the same time. The first part considers monetary
aggregation under uncertainty aversion (perhaps under risk aversion as well). The presence of uncertainty and the agent's attitude towards it are represented by a nonadditive probability measure. The major findings are three-fold: first, the user cost of monetary assets under uncertainty aversion produces useful boundaries. We no longer have covariances, instead, we have inequalities, and our model nests some of the previously derived results. Second, deviating from expected utility does not exclude the existence of a user-cost solution which is analogous to the expected utility representation, but that is only a special case. Third, under Choquet expectation the user costs have an interval within which no trade of monetary assets will occur, such an effect depends solely on uncertainty aversion, not on risk aversion. The second paper deals with the problem of nonparametric estimation using censored
data in a model that features endogeneity. Nonparametrics with endogenous variables is difficult to handle because of ill-posed inverse problem. Nonparametrics with censoring does not attract the attention as it deserves because people are inclined to resort to quantile estimation when
data is censored. We stick to the nonparametric estimation under two mild conditions. It is the endogeneity that shapes the model to be additive, and it is because of censoring the model is reduced to a (nonparametric) LAD estimation under the assumption of conditional zero median of the error term. This paper therefore transforms the problem into a Nonparametric Additive Least Absolute Deviation estimation which is saliently more robust than L₂ norm estimation. We establish the asymptotic normality of the estimated unknown functions. The estimation and inference are easy to carry out. The third paper establishes a dynamic stochastic general equilibrium model of the Chinese open real economy and aims to give a theoretical account of the empirical…
Advisors/Committee Members: Barnett, William A (advisor), Cai, Zongwu (cmtemember), Pasik-Duncan, Bozenna (cmtemember), Keating, John (cmtemember), Zhang, Jianbo (cmtemember).
Subjects/Keywords: Economics; Censoring Data; Choquet Expectation; Endogeneity; General Equilibrium; Monetary Aggregation; Nonparametrics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Han, Q. (2019). Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/29880
Chicago Manual of Style (16th Edition):
Han, Qing. “Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling.” 2019. Doctoral Dissertation, University of Kansas. Accessed March 07, 2021.
http://hdl.handle.net/1808/29880.
MLA Handbook (7th Edition):
Han, Qing. “Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling.” 2019. Web. 07 Mar 2021.
Vancouver:
Han Q. Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling. [Internet] [Doctoral dissertation]. University of Kansas; 2019. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1808/29880.
Council of Science Editors:
Han Q. Three Papers on Monetary Aggregation under Knightian Uncertainty, Kernel Estimation, and Dynamic Modelling. [Doctoral Dissertation]. University of Kansas; 2019. Available from: http://hdl.handle.net/1808/29880
NSYSU
28.
Wei, Chia-Ting.
Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.
Degree: Master, Computer Science and Engineering, 2014, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
► In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence…
(more)
▼ In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence in the sensing field. In-network
data reduction technique such as
data aggregation and
data compression can help diminish the amount of
data sent from sensors, which not only saves network bandwidth but also preserves sensor energy. However, such technique does not consider packet latency due to the
aggregation or compression operation. When some sensors generate regular reports in lower
data rates, their packets have to spend longer time to be aggregated or compressed, resulting in higher packet delays. Besides, when events occur, the network could suffer from instant congestion due to the generation of numerous event notifications. Motivating from the above observations, the paper develops a lightweight, latency-aware routing for
data compression (L2DC) scheme to reduce packet latency when applying the compression technique to reduce the amount of
data generated from sensors. L2DC gives event notifications a higher priority over regular reports and eliminates unnecessary notifications to avoid bursty network congestion. In addition, L2DC facilitates the
data compression process by allowing each sensor to determine whether to keep packets for compression locally or to send them to a neighbor to be compressed in a distributed manner.
Our L2DC scheme can be applied to most on-demand routing protocols that select the next-hop neighbor to relay packets, such as AODV. Experimental results demonstrate that L2DC outperforms other methods in terms of reducing packet latency.
Advisors/Committee Members: Chun-Hung Lin (chair), Bing-Hong Liu (chair), Wei Kuang Lai (chair), You-Chiun Wang (committee member).
Subjects/Keywords: Packet delay; Wireless sensor network; Routing protocol; In-network data processing; Data aggregation and compression
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wei, C. (2014). Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wei, Chia-Ting. “Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.” 2014. Thesis, NSYSU. Accessed March 07, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wei, Chia-Ting. “Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.” 2014. Web. 07 Mar 2021.
Vancouver:
Wei C. Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 Mar 07].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wei C. Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Minnesota
29.
Saladi, Rahul.
Algorithms and Data Structures for Geometric Intersection Query Problems.
Degree: PhD, Computer Science, 2017, University of Minnesota
URL: http://hdl.handle.net/11299/191453
► The focus of this thesis is the topic of geometric intersection queries (GIQ) which has been very well studied by the computational geometry community and…
(more)
▼ The focus of this thesis is the topic of geometric intersection queries (GIQ) which has been very well studied by the computational geometry community and the database community. In a GIQ problem, the user is not interested in the entire input geometric dataset, but only in a small subset of it and requests an informative summary of that small subset of data. Formally, the goal is to preprocess a set A of n geometric objects into a data structure so that given a query geometric object q, a certain aggregation function can be applied efficiently on the objects of A intersecting q. The classical aggregation functions studied in the literature are reporting or counting the objects of A intersecting q. In many applications, the same set A is queried several times, in which case one would like to answer a query faster by preprocessing A into a data structure. The goal is to organize the data into a data structure which occupies a small amount of space and yet responds to any user query in real-time. In this thesis the study of the GIQ problems was conducted from the point-of-view of a computational geometry researcher. Given a model of computation and a GIQ problem, what are the best possible upper bounds (resp., lower bounds) on the space and the query time that can be achieved by a data structure? Also, what is the relative hardness of various GIQ problems and aggregate functions. Here relative hardness means that given two GIQ problems A and B (or, two aggregate functions f(A, q) and g(A, q)), which of them can be answered faster by a computer (assuming data structures for both of them occupy asymptotically the same amount of space)? This thesis presents results which increase our understanding of the above questions. For many GIQ problems, data structures with optimal (or near-optimal) space and query time bounds have been achieved. The geometric settings studied are primarily orthogonal range searching where the input is points and the query is an axes-aligned rectangle, and the dual setting of rectangle stabbing where the input is a set of axes-aligned rectangles and the query is a point. The aggregation functions studied are primarily reporting, top-k, and approximate counting. Most of the data structures are built for the internal memory model (word-RAM or pointer machine model), but in some settings they are generic enough to be efficient in the I/O-model as well.
Subjects/Keywords: aggregation; data structures; geometric algorithms; query time; range searching; size of the data structure
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Saladi, R. (2017). Algorithms and Data Structures for Geometric Intersection Query Problems. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/191453
Chicago Manual of Style (16th Edition):
Saladi, Rahul. “Algorithms and Data Structures for Geometric Intersection Query Problems.” 2017. Doctoral Dissertation, University of Minnesota. Accessed March 07, 2021.
http://hdl.handle.net/11299/191453.
MLA Handbook (7th Edition):
Saladi, Rahul. “Algorithms and Data Structures for Geometric Intersection Query Problems.” 2017. Web. 07 Mar 2021.
Vancouver:
Saladi R. Algorithms and Data Structures for Geometric Intersection Query Problems. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/11299/191453.
Council of Science Editors:
Saladi R. Algorithms and Data Structures for Geometric Intersection Query Problems. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/191453
30.
Riemann, Robert.
Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles.
Degree: Docteur es, Informatique, 2017, Lyon
URL: http://www.theses.fr/2017LYSEN099
► L’agrégation des valeurs qui doivent être gardées confidentielles tout en garantissant la robustesse du processus et l’exactitude du résultat est nécessaire pour un nombre croissant…
(more)
▼ L’agrégation des valeurs qui doivent être gardées confidentielles tout en garantissant la robustesse du processus et l’exactitude du résultat est nécessaire pour un nombre croissant d’applications. Divers types d’enquêtes, telles que les examens médicaux, les référendums, les élections, ainsi que les nouveaux services de Internet of Things, tels que la domotique, nécessitent l’agrégation de données confidentielles. En général,la confidentialité est assurée sur la base de tiers de confiance ou des promesses de cryptographie, dont les capacités ne peuvent être évaluées sans expertise.L’ambition de cette thèse est de réduire le besoin de confiance dans les autorités, de même que la technologie, et d’explorer les méthodes d’agrégations de données à grande échelle, qui garantissent un degré élevé de confidentialité et ne dépendent ni de tiers de confiance ni de cryptographie. Inspiré par BitTorrent et Bitcoin, les protocoles P2P sont considérés. La première contribution de cette thèse est l’extension du protocole d’agrégation distribuée BitBallot dans le but de couvrir les agrégations dans les réseaux P2P comprenant des pairs adversaires avec un comportement défaillant ou byzantin. Les changements introduits permettent éventuellement de maintenir un résultat précis en présence d’une minorité adversaire. Les limites de scalabilité rencontrées conduisent à la deuxième contribution dans le but de soutenir les agrégations à grande échelle. Inspiré par BitBallot et BitTorrent, un nouveau protocole distribué appelé ADVOKAT est proposé.Dans les deux protocoles, les pairs sont affectés aux noeuds feuilles d’un réseau de superposition d’une structure arborescente qui détermine le calcul des agrégats intermédiaires et restreint l’échange de données. La partition des données et du calcul entre un réseau de pairs équipotent limite le risque de violation de données et réduit le besoin de confiance dans les autorités. Les protocoles fournissent une couche middleware dont la flexibilité est démontrée par les applications de vote et de loterie.
Aggregation of values that need to be kept confidential while guaranteeing the robustness of the process and the correctness of the result is necessary for an increasing number of applications. Various kinds of surveys, such as medical ones, opinion polls, referendums, elections, as well as new services of the Internet of Things, such as home automation, require the aggregation of confidential data. In general, the confidentiality is ensured on the basis of trusted third parties or promises of cryptography, whose capacities cannot be assessed without expert knowledge.The ambition of this thesis is to reduce the need for trust in both authorities and technology and explore methods for large-scale data aggregations, that ensure a high degree of confidentiality and rely neither on trusted third parties nor solely on cryptography. Inspired by BitTorrent and Bitcoin, P2P protocols are considered.The first contribution of this thesis is the extension of the distributed aggregation protocol BitBallot…
Advisors/Committee Members: Grumbach, Stéphane (thesis director).
Subjects/Keywords: Agrégation confidentielle; Agrégation distribuée; Vote en ligne; Kademlia; Systèmes distribués; Aggregation of confidential data; Distributed aggregation; Online voting; Kademlia; Distributed systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Riemann, R. (2017). Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEN099
Chicago Manual of Style (16th Edition):
Riemann, Robert. “Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles.” 2017. Doctoral Dissertation, Lyon. Accessed March 07, 2021.
http://www.theses.fr/2017LYSEN099.
MLA Handbook (7th Edition):
Riemann, Robert. “Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles.” 2017. Web. 07 Mar 2021.
Vancouver:
Riemann R. Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2021 Mar 07].
Available from: http://www.theses.fr/2017LYSEN099.
Council of Science Editors:
Riemann R. Towards Trustworthy Online Voting : Distributed Aggregation of Confidential Data : Confiance dans le vote en ligne : agrégation distribuée de données confidentielles. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEN099
◁ [1] [2] [3] [4] [5] [6] [7] ▶
. 
Open Access Theses and Dissertations