東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Dynamic Operations Over Networks: Ex...

Erturk, Mine Su,

Linked to FindBook

Google Book

Amazon

博客來

Dynamic Operations Over Networks: Extracting and Protecting Information /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Dynamic Operations Over Networks: Extracting and Protecting Information // Mine Su Erturk.
Author:	Erturk, Mine Su,
Description:	1 electronic resource (193 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 86-02, Section: B.
Contained By:	Dissertations Abstracts International86-02B.
Subject:	Genealogy. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31194564
ISBN:	9798383706978

Dynamic Operations Over Networks: Extracting and Protecting Information /
Erturk, Mine Su,

Dynamic Operations Over Networks: Extracting and Protecting Information /Mine Su Erturk. - 1 electronic resource (193 pages)

Source: Dissertations Abstracts International, Volume: 86-02, Section: B.

In this dissertation, I investigate the interplay between information and networks in dynamic operations. For this purpose, I study two related settings where a decision maker interacts with information while dynamically operating over a network. In the first setting, this interaction manifests itself as a goal of protecting sensitive information and is the focus of Chapter 1. More specifically, I analyze how a decision maker can efficiently route over a given network without revealing the destination as a result of taking actions over the network. In the second setting, the goal of the decision maker is one of learning, or extracting information, through interactions with a network. In Chapter 2, I study this problem in the context of forensic investigations and address the question of efficiently reconstructing an unobservable network in order to find a target hidden among its vertices. Finally, in Chapter 3, I treat the problems of extracting and protecting information jointly and consider a decision maker who aims to protect sensitive information while conducting a search. In this final chapter, I again analyze the same forensic technique from Chapter 2 and add an additional objective of privacy.In the remainder of this section, I first discuss each chapter individually and then elaborate on how the dynamics differ as the objective and the way the decision maker operates over the network changes.Protecting Information.Chapter 1 consists of our paper "Anonymous Stochastic Routing" (Erturk and Xu and focuses on the protection of information in the context of dynamic operations over networks. We study how a decision maker, who might not have perfect control over the consequences of her decisions, should operate over a network while protecting sensitive information. In particular, we focus on the problem of anonymous routing on unreliable networks and study the impact of uncertainty, modeled as temporary link failures, on the trade-off between efficiency (reaching the target location quickly) and anonymity (obfuscating the identity of the target). Our results contrast the existing literature and show that in the presence of uncertainty both the nature of the trade-off and the optimal design of anonymous algorithms change drastically compared to their counterparts in deterministic settings. More specifically, using large-nctwork asymptotics, we provide near-optimal characterization of the efficiency vs. anonymity trade-off under a number of network topologies. Our main technical contributions are centered around a new class of "noise-harnessing" routing strategies that adaptively combine intrinsic uncertainty from the environment with additional artificial randomization to achieve provably efficient obfuscation.Extracting Information.In Chapter 2] our motivating application is investigative genctic ge- nealogy. This is a powerful new approach to solving violent crimes and identifying human remains and leverages genetic sequencing, technologies and genealogical records. At a high level, given the genetic information of a target individual (e.g., an unidentified person) that we would like to identify, the first step of the forensic technique entails creating a match list of genetic relatives of the target. This step requires comparing the genomes of individuals in a population with that of the target and is often provided as a third-party service (e.g., GEDmatch). Then, an analyst tries to reconstruct the (unknown) target's family tree by investigating their genetic relatives from the match list and to locate the target as a vertex on this reconstructed network. This genealogy process is typically the most time-consuming part of - and a limiting factor in the success of - investigative genetic genealogy and hence is the focus of our study.

English

ISBN: 9798383706978Subjects--Topical Terms:

577587
Genealogy.

Dynamic Operations Over Networks: Extracting and Protecting Information /
LDR:05118nmm a22003733i 4500 001 2434677
005 20250923060939.5
006 m o d
007 cr|nu||||||||
008 261011s2022 miu||||||m |||||||eng d
020 $a 9798383706978
035 $a (MiAaPQD)AAI31194564
035 $a (MiAaPQD)STANFORDjx540dg0730
035 $a AAI31194564
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Erturk, Mine Su, $e author. $3 3824739
245 1 0 $a Dynamic Operations Over Networks: Extracting and Protecting Information / $c Mine Su Erturk.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 1 electronic resource (193 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-02, Section: B.
500 $a Advisors: Xu, Kuang; Wein, Lawrence Committee members: Saban, Daniela; Bent, Stacey F.
502 $b Ph.D. $c Stanford University $d 2022.
520 $a In this dissertation, I investigate the interplay between information and networks in dynamic operations. For this purpose, I study two related settings where a decision maker interacts with information while dynamically operating over a network. In the first setting, this interaction manifests itself as a goal of protecting sensitive information and is the focus of Chapter 1. More specifically, I analyze how a decision maker can efficiently route over a given network without revealing the destination as a result of taking actions over the network. In the second setting, the goal of the decision maker is one of learning, or extracting information, through interactions with a network. In Chapter 2, I study this problem in the context of forensic investigations and address the question of efficiently reconstructing an unobservable network in order to find a target hidden among its vertices. Finally, in Chapter 3, I treat the problems of extracting and protecting information jointly and consider a decision maker who aims to protect sensitive information while conducting a search. In this final chapter, I again analyze the same forensic technique from Chapter 2 and add an additional objective of privacy.In the remainder of this section, I first discuss each chapter individually and then elaborate on how the dynamics differ as the objective and the way the decision maker operates over the network changes.Protecting Information.Chapter 1 consists of our paper "Anonymous Stochastic Routing" (Erturk and Xu and focuses on the protection of information in the context of dynamic operations over networks. We study how a decision maker, who might not have perfect control over the consequences of her decisions, should operate over a network while protecting sensitive information. In particular, we focus on the problem of anonymous routing on unreliable networks and study the impact of uncertainty, modeled as temporary link failures, on the trade-off between efficiency (reaching the target location quickly) and anonymity (obfuscating the identity of the target). Our results contrast the existing literature and show that in the presence of uncertainty both the nature of the trade-off and the optimal design of anonymous algorithms change drastically compared to their counterparts in deterministic settings. More specifically, using large-nctwork asymptotics, we provide near-optimal characterization of the efficiency vs. anonymity trade-off under a number of network topologies. Our main technical contributions are centered around a new class of "noise-harnessing" routing strategies that adaptively combine intrinsic uncertainty from the environment with additional artificial randomization to achieve provably efficient obfuscation.Extracting Information.In Chapter 2] our motivating application is investigative genctic ge- nealogy. This is a powerful new approach to solving violent crimes and identifying human remains and leverages genetic sequencing, technologies and genealogical records. At a high level, given the genetic information of a target individual (e.g., an unidentified person) that we would like to identify, the first step of the forensic technique entails creating a match list of genetic relatives of the target. This step requires comparing the genomes of individuals in a population with that of the target and is often provided as a third-party service (e.g., GEDmatch). Then, an analyst tries to reconstruct the (unknown) target's family tree by investigating their genetic relatives from the match list and to locate the target as a vertex on this reconstructed network. This genealogy process is typically the most time-consuming part of - and a limiting factor in the success of - investigative genetic genealogy and hence is the focus of our study.
546 $a English
590 $a School code: 0212
650 4 $a Genealogy. $3 577587
650 4 $a Graphs. $3 3685259
650 4 $a Privacy. $3 528582
650 4 $a Theorems. $3 3686073
650 4 $a Parameter estimation. $3 567557
650 4 $a Mathematics. $3 515831
690 $a 0405
710 2 $a Stanford University. $e degree granting institution. $3 3765820
720 1 $a Xu, Kuang $e degree supervisor.
720 1 $a Wein, Lawrence $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-02B.
790 $a 0212
791 $a Ph.D.
792 $a 2022
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31194564