You searched for subject:(network science).
Showing records 1 – 30 of
1545 total matches.
◁ [1] [2] [3] [4] [5] … [52] ▶
1.
Skagerlind, Mikael.
Developing a methodology model and writing a documentation template for network analysis.
Degree: Design and Engineering, 2016, Mälardalen University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32393 
► This report focuses on finding best practices and a better methodology when performing computer network analysis and troubleshooting. When network analysis is performed, computer…
(more)
▼ This report focuses on finding best practices and a better methodology when performing computer network analysis and troubleshooting. When network analysis is performed, computer network data packets are captured using data capturing software. The data packets can then be analysed through a user interface to reveal potential faults in the network. Network troubleshooting is focusing more on methodology when finding a fault in a network. The thesis work was performed at Cygate where they have recently identified needs for an updated network analysis methodology and a documentation template when documenting the network analysis results. Thus, the goal of this thesis has been to develop an elaborated methodology and discover best practices for network analysis and to write a documentation template for documenting network analysis work. As a part of discovering best practices and a methodology for network analysis, two laboratory tests were performed to gather results and analyse them. To avoid getting too many results but to still keep the tests within the scope of this thesis, the laboratory tests were limited to four network analysis tools and two test cases that are explained below. In the first laboratory test during three different test sequences, voice traffic (used in IP-phones and Skype etc.) is sent in the network using a computer program. In two of the test sequences other traffic is also congesting the network to disturb the sensitive voice traffic. The program used to send the voice traffic then outputs values; packet delay, jitter (variation in delay) and packet loss. Looking at these values, one can decide if the network is fit for carrying the sensitive voice traffic. In two of the test cases, satisfying results were gathered, but in one of them the results were very bad due to high packet loss. The second laboratory test focused more on methodology than gathering and analysing results. The goal of the laboratory test was to find and prove what was wrong with a slow network, which is a common fault in today’s networks due to several reasons. In this case, the network was slow due to large amounts of malicious traffic congesting the network; this was proven using different commands in the network devices and using different network analysis tools to find out what type of traffic was flowing in the network. The documentation template that was written as part of this thesis contains appealing visuals and explains some integral parts for presenting results when network analysis has been performed. The goal of the documentation template was an easy-to-use template that could be filled in with the necessary text under each section to simplify the documentation writing. The template contains five sections (headlines) that contain an explanation under it with what information is useful to have under that section. Cygate’s network consultants will use the documentation template when they are performing network analysis. For future work, the laboratory test cases could be expanded to include Quality of Service…
Subjects/Keywords: computer science; network engineering; network analysis; network analysis methodology; network troubleshooting
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):
Skagerlind, M. (2016). Developing a methodology model and writing a documentation template for network analysis. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32393
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):
Skagerlind, Mikael. “Developing a methodology model and writing a documentation template for network analysis.” 2016. Thesis, Mälardalen University. Accessed January 15, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32393.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Skagerlind, Mikael. “Developing a methodology model and writing a documentation template for network analysis.” 2016. Web. 15 Jan 2021.
Vancouver:
Skagerlind M. Developing a methodology model and writing a documentation template for network analysis. [Internet] [Thesis]. Mälardalen University; 2016. [cited 2021 Jan 15].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32393.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Skagerlind M. Developing a methodology model and writing a documentation template for network analysis. [Thesis]. Mälardalen University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32393
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
UCLA
2.
Weng, Jui-Ting.
On Demand Surveillance Service in Vehicular Cloud.
Degree: Computer Science, 2013, UCLA
URL: http://www.escholarship.org/uc/item/7sc0b7rb
► Environment monitoring and surveillance using video cameras and sensors have become increasingly important functions in urban centers. Specically, vehicles are ideally suited for surveillance complementing…
(more)
▼ Environment monitoring and surveillance using video cameras and sensors have become increasingly important functions in urban centers. Specically, vehicles are ideally suited for surveillance complementing xed video cameras and sensors installed in the infrastructure. As on-board video cameras become more popular in public transportation and individually owned vehicles, these devices provide an excellent source for surveillance data. When these vehicles collaborate between each other and provide on demand video services, the vehicular ad hoc forms a service, which provides picture and video service to any client needing the data. Comparing with currently existing cloud network, the vehicle is no longer a cloudservice consumer; instead, it becomes the hardware provider to oer location basevideo and picture services. The service utilizes hardware APIs such as GPS,event recording cameras, and network connections. As a result, the surveillance application exploits the mobility of the service vehicles to extend surveillance coverage beyond the reach of static devices.
Subjects/Keywords: Computer science; Vehicular Network; Wireless 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):
Weng, J. (2013). On Demand Surveillance Service in Vehicular Cloud. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/7sc0b7rb
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):
Weng, Jui-Ting. “On Demand Surveillance Service in Vehicular Cloud.” 2013. Thesis, UCLA. Accessed January 15, 2021.
http://www.escholarship.org/uc/item/7sc0b7rb.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Weng, Jui-Ting. “On Demand Surveillance Service in Vehicular Cloud.” 2013. Web. 15 Jan 2021.
Vancouver:
Weng J. On Demand Surveillance Service in Vehicular Cloud. [Internet] [Thesis]. UCLA; 2013. [cited 2021 Jan 15].
Available from: http://www.escholarship.org/uc/item/7sc0b7rb.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Weng J. On Demand Surveillance Service in Vehicular Cloud. [Thesis]. UCLA; 2013. Available from: http://www.escholarship.org/uc/item/7sc0b7rb
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Notre Dame
3.
Jian Xu.
Representing Big Data as Networks: New Methods and
Insights</h1>.
Degree: Computer Science and Engineering, 2017, University of Notre Dame
URL: https://curate.nd.edu/show/q524jm2466t
► Our world produces massive data every day; they exist in diverse forms, from pairwise data and matrix to time series and trajectories. Meanwhile, we…
(more)
▼ Our world produces massive data every day;
they exist in diverse forms, from pairwise data and matrix to time
series and trajectories. Meanwhile, we have access to the versatile
toolkit of
network analysis. Networks also have different forms;
from simple networks to higher-order
network, each representation
has different capabilities in carrying information. For researchers
who want to leverage the power of the
network toolkit, and apply it
beyond networks data to sequential data, diffusion data, and many
more, the question is: how to represent big data and networks? This
dissertation makes a first step to answering the question. It
proposes the higher-order
network, which is a critical piece for
representing higher-order interaction data; it introduces a
scalable algorithm for building the
network, and visualization
tools for interactive exploration. Finally, it presents broad
applications of the higher-order
network in the
real-world.
Advisors/Committee Members: Tijana Milenkovec, Committee Member, Nitesh Chawla, Research Director, Zoltan Toroczkai, Committee Member, David Lodge, Committee Member.
Subjects/Keywords: higher-order network; network science; data mining
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):
Xu, J. (2017). Representing Big Data as Networks: New Methods and
Insights</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/q524jm2466t
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):
Xu, Jian. “Representing Big Data as Networks: New Methods and
Insights</h1>.” 2017. Thesis, University of Notre Dame. Accessed January 15, 2021.
https://curate.nd.edu/show/q524jm2466t.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Xu, Jian. “Representing Big Data as Networks: New Methods and
Insights</h1>.” 2017. Web. 15 Jan 2021.
Vancouver:
Xu J. Representing Big Data as Networks: New Methods and
Insights</h1>. [Internet] [Thesis]. University of Notre Dame; 2017. [cited 2021 Jan 15].
Available from: https://curate.nd.edu/show/q524jm2466t.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Xu J. Representing Big Data as Networks: New Methods and
Insights</h1>. [Thesis]. University of Notre Dame; 2017. Available from: https://curate.nd.edu/show/q524jm2466t
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Melbourne
4.
Sun, Yahui.
Classical, prize-collecting and node-weighted Steiner tree problems in graphs.
Degree: 2018, University of Melbourne
URL: http://hdl.handle.net/11343/214000
► Steiner tree problems in graphs, as a group of network optimization problems, are traditionally applied to design minimum-cost physical networks. Recently, with the eruption of…
(more)
▼ Steiner tree problems in graphs, as a group of network optimization problems, are traditionally applied to design minimum-cost physical networks. Recently, with the eruption of big data, more and more applications of network data analysis have been explored using a Steiner tree approach. These newly explored applications present serious challenges to conventional Steiner tree techniques. Hence, more powerful Steiner tree techniques are urgently required to support the further exploration of Steiner tree problems in graphs. In this thesis, I explore three Steiner tree problems in graphs: the classical Steiner Tree Problem in Graphs, the Prize-Collecting Steiner Tree Problem, and the Node-Weighted Steiner Tree Problem.
First, I explore the classical Steiner Tree Problem in Graphs. I conduct some theoretical analyses on the currently popular Physarum-inspired algorithms to reveal their potential to compute Steiner trees. Based on these analyses, I propose two Physarum-inspired algorithms to solve the classical Steiner Tree Problem in Graphs. These two algorithms demonstrate a more competitive performance than the Genetic algorithm, Discrete Particle Swarm Optimization algorithm and Shortest Path Heuristic algorithm for both randomly generated benchmark instances and real-world Very-Large-Scale Integration instances.
Second, I explore the Prize-Collecting Steiner Tree Problem. I propose a Physarum-inspired algorithm to solve this problem in pharmaceutical networks for drug repositioning. This algorithm manifests a more competitive performance than the widely-used Goemans-Williamson algorithm for this newly explored application, where significant costs and risks of drug development can be avoided by identifying drugs with similar therapeutic effects. In addition, I propose several post-processing techniques and two fast heuristic algorithms to design large and low-cost communication networks. These post-processing techniques improve the previous best known solution of one of the largest existing benchmark instances, while these fast heuristic algorithms successfully challenge some newly generated benchmark instances that are tens of times larger than the largest existing ones.
Third, I explore the Node-Weighted Steiner Tree Problem. I propose two Physarum-inspired algorithms to solve this problem for instances with multiple compulsory terminals. These two algorithms evince a more competitive performance than the popular Genetic algorithm and Discrete Particle Swarm Optimization algorithm. Furthermore, I modify two simple reduction tests and a fast heuristic algorithm to identify elements of cancer-related signaling pathways in large protein-protein interaction networks. The identification results provide us a deeper understanding towards two important cancer-related signaling pathways. Ultimately, I propose several sophisticated reduction tests, an exact algorithm and a fast heuristic algorithm for constrained relay node placement in cost-aware wireless sensor networks. This newly explored application enables…
Subjects/Keywords: Steiner tree; network science; network data analysis
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):
Sun, Y. (2018). Classical, prize-collecting and node-weighted Steiner tree problems in graphs. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/214000
Chicago Manual of Style (16th Edition):
Sun, Yahui. “Classical, prize-collecting and node-weighted Steiner tree problems in graphs.” 2018. Doctoral Dissertation, University of Melbourne. Accessed January 15, 2021.
http://hdl.handle.net/11343/214000.
MLA Handbook (7th Edition):
Sun, Yahui. “Classical, prize-collecting and node-weighted Steiner tree problems in graphs.” 2018. Web. 15 Jan 2021.
Vancouver:
Sun Y. Classical, prize-collecting and node-weighted Steiner tree problems in graphs. [Internet] [Doctoral dissertation]. University of Melbourne; 2018. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/11343/214000.
Council of Science Editors:
Sun Y. Classical, prize-collecting and node-weighted Steiner tree problems in graphs. [Doctoral Dissertation]. University of Melbourne; 2018. Available from: http://hdl.handle.net/11343/214000
5.
Virmani, Deepali.
Design and analysis for sensor network architecture with
new features; -.
Degree: Computer Science, 2012, University of Delhi
URL: http://shodhganga.inflibnet.ac.in/handle/10603/13619
► Wireless sensor networks can provide low cost solution to a variety of real-world problems. Sensors are low cost tiny devices with limited storage, computational capability…
(more)
▼ Wireless sensor networks can provide low cost
solution to a variety of real-world problems. Sensors are low cost
tiny devices with limited storage, computational capability and
power. The large scale deployment of wireless sensor networks is
expected to guarantee real time communication. Devices in sensor
networks have a much smaller memory, constrained energy supply,
less process and communication bandwidth. Topologies of the sensor
networks are constantly changing due to a high node failure rate,
occasional shutdown and abrupt communication interferences. Due to
the nature of the applications supported, sensor networks need to
be densely deployed and have anywhere from thousands to millions of
sensing devices, which are the orders of magnitude larger than
traditional ad hoc mobile networks. In addition, energy
conservation becomes the center of focus due to the limited battery
capacity and the impossibility of recharge in the hostile
environment. With such a vast difference between traditional
networks and sensor networks, it is not appropriate and inefficient
to port previous solutions for ad hoc networks into sensor networks
with only incremental modifications. In this thesis we studied the
existing architecture of wireless sensor networks and came up with
its limitations. To overcome the limitations of existing
architecture and to improve the functionalities of sensor networks,
we propose a new network architecture, which has a set of
indispensable layers specially tailored to the characteristics of
sensor networks. The layers of the proposed architecture are as
follows: Physical layer with power management, Robust and
self-stabilized MAC layer, Application independent data
aggregation, Differentiated packet scheduling, Real time routing
layer, Transport layer and Application layer. This proposed
architecture will be an integrated solution and efficiently address
the following important issues: _ Real-time communication _ Network
congestion reduction and control
Bibliography p.188-197
Advisors/Committee Members: Jain, Satbir, Senani, Raj.
Subjects/Keywords: Computer Science; sensor network architecture
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):
Virmani, D. (2012). Design and analysis for sensor network architecture with
new features; -. (Thesis). University of Delhi. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/13619
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):
Virmani, Deepali. “Design and analysis for sensor network architecture with
new features; -.” 2012. Thesis, University of Delhi. Accessed January 15, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/13619.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Virmani, Deepali. “Design and analysis for sensor network architecture with
new features; -.” 2012. Web. 15 Jan 2021.
Vancouver:
Virmani D. Design and analysis for sensor network architecture with
new features; -. [Internet] [Thesis]. University of Delhi; 2012. [cited 2021 Jan 15].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13619.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Virmani D. Design and analysis for sensor network architecture with
new features; -. [Thesis]. University of Delhi; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13619
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Northeastern University
6.
Milanlouei, Soodabeh.
Network Science: Applications From Network Structure To Health.
Degree: PhD, Department of Mechanical and Industrial Engineering, 2019, Northeastern University
URL: http://hdl.handle.net/2047/D20317896
► From biological networks to social networks, we are surrounded by many complex networks with diverse nature and structure. Given the important role these networks play…
(more)
▼ From biological networks to social networks, we are surrounded by many complex networks with diverse nature and structure. Given the important role these networks play in our daily life, science and economy, their understanding, mathematical description, prediction, and control have become a major intellectual and scientific challenge of the 21st century. In response, the field of Network Science has emerged, drawing on theories and methods including graph theory, statistical mechanics, data mining, inferential modeling, and social structure. In this dissertation, we focus on the application of Network Science in two distinct areas: network structure and health. In the first chapter, we explore the properties of physical networks, where the nodes and links are physical objects unable to cross each other. These non-crossing conditions constrain their layout geometry and affect how networks form, evolve and function. We developed a modeling framework that accounts for the physical reality of nodes and links, allowing us to explore how the non-crossing conditions affect the network geometry. For small link thicknesses, we observed a weakly interacting phase where the layout avoids the link crossings via local link rearrangements, without altering the overall layout geometry. Once the link thickness exceeds a critical threshold, a strongly interacting phase emerges, where multiple geometric quantities scale with link thickness. We observed a deep universality, finding that the observed scaling properties are independent of the underlying network topology. In the second chapter, we investigate the role that diet plays in the development of Coronary Heart Disease (CHD). We applied an Environment-Wide Association Study (EWAS) approach to Nurses' Health Study data to explore comprehensively and agnostically the effect of 257 nutrients and 117 foods on CHD risk. Our implementation of EWAS successfully reproduced prior knowledge in diet-CHD associations and helped us detect new associations that were previously only poorly studied in the literature. We showed that EWAS allows us to unveil the bipartite food-nutrients network, highlighting which nutrient in which food drives CHD risk. We showed that there is a distinct clustering in this network where protective nutrients and foods are highly interconnected in one cluster, and harmful nutrients and foods in another. Using this network, we showed that solely looking at food items, one would underestimate the effect of those nutrients whose consumption is strongly determined by the behavioral aspect and not mainly by their average amount in food.
Subjects/Keywords: Network Science; Epidemiology; Applied physics
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):
Milanlouei, S. (2019). Network Science: Applications From Network Structure To Health. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20317896
Chicago Manual of Style (16th Edition):
Milanlouei, Soodabeh. “Network Science: Applications From Network Structure To Health.” 2019. Doctoral Dissertation, Northeastern University. Accessed January 15, 2021.
http://hdl.handle.net/2047/D20317896.
MLA Handbook (7th Edition):
Milanlouei, Soodabeh. “Network Science: Applications From Network Structure To Health.” 2019. Web. 15 Jan 2021.
Vancouver:
Milanlouei S. Network Science: Applications From Network Structure To Health. [Internet] [Doctoral dissertation]. Northeastern University; 2019. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2047/D20317896.
Council of Science Editors:
Milanlouei S. Network Science: Applications From Network Structure To Health. [Doctoral Dissertation]. Northeastern University; 2019. Available from: http://hdl.handle.net/2047/D20317896
University of Notre Dame
7.
Shikang Liu.
Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>.
Degree: Computer Science and Engineering, 2019, University of Notre Dame
URL: https://curate.nd.edu/show/wd375t38760
► Networks are widely used to understand complex real-world systems. This thesis focuses on social networks in which nodes are individuals and edges are individuals’…
(more)
▼ Networks are widely used to understand
complex real-world systems. This thesis focuses on social networks
in which nodes are individuals and edges are individuals’
friendship, family, or professional relationships. Social networks
play an important role in individuals’ physical and mental health.
Traditional research aiming to link individuals’ social networks
and health has focused on studying a relationship between static
network structure and static health-related traits due to the
inability to collect individuals’ dynamic social interaction data
and dynamic health-related trait data. With recent advancements of
data collection technologies, such as smartphones and wearable
sensors, one is able to collect such data. This is exactly what we
have done in the NetHealth study, which gathered social interaction
data from smartphones (i.e., SMS communications), health-related
behavioral data from wearable sensors (i.e., Fitbit data), and
individuals’ trait data from surveys (e.g., personality traits and
mental health) of around 700 Notre Dame undergraduates during 2015
to 2019. Leveraging the rich NetHealth data, this
thesis focuses on uncovering relationships between individuals’
social
network positions, health-related behaviors, and various
other traits and developing
network-based models to predict
individuals’ mental health. In particular, we look at the
co-evolution of individuals’ social
network positions (i.e.,
centralities) and their behaviors (i.e., physical activities), with
the goal of studying whether groups of individuals who have similar
evolving social
network profiles or similar evolving physical
activity profiles (or both) share similar traits such as
personality, depression, and anxiety. We are the first ones to
study the relationship between individuals’ positions in a dynamic
social
network and their dynamic health-related behaviors. Our
results reveal several associations between individuals’ social
network structure, health-related (i.e., physical activity)
behaviors, and other (e.g., personality or mental health) traits.
So, in a follow-up study, we integrate the different data types
from the NetHealth study into a heterogeneous information
network
(HIN) to develop a predictive model of social
network structure
from behavioral/trait information or vice versa. Specifically, we
focus on the task of predicting one’s mental health (i.e.,
likelihood of being depressed or anxious) from the rest of the
data. In this context, we are the first ones to define the problem
of predicting individuals’ mental health as applying to our HIN a
popular paradigm of a recommender system (RS), which is typically
used to predict the preference that an individual would give to an
item (e.g., a movie or book). In our case, the items are the
individuals’ different mental health states. Since the existing RS
methods work on static
network data and extending them to dynamic
network data is non-trivial, our constructed HIN aggregates the
dynamic social
network data from the considered study time period
into a static…
Advisors/Committee Members: Tijana Milenkovic, Research Director, Christian Poellabauer, Committee Member, Aaron Striegel, Committee Member.
Subjects/Keywords: Social networks; Network science
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):
Liu, S. (2019). Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/wd375t38760
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):
Liu, Shikang. “Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>.” 2019. Thesis, University of Notre Dame. Accessed January 15, 2021.
https://curate.nd.edu/show/wd375t38760.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Shikang. “Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>.” 2019. Web. 15 Jan 2021.
Vancouver:
Liu S. Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>. [Internet] [Thesis]. University of Notre Dame; 2019. [cited 2021 Jan 15].
Available from: https://curate.nd.edu/show/wd375t38760.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu S. Heterogeneous Network Approach for Analyzing Nethealth Data:
Linking Individuals' Social Interaction, Personality, Physical
Health, and Mental Health Data</h1>. [Thesis]. University of Notre Dame; 2019. Available from: https://curate.nd.edu/show/wd375t38760
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
8.
Lichter, Shaun Matthew.
A Game Theoretic Approach to Network Formation.
Degree: 2013, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/18298
► As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using it{network formation} through selfish competition…
(more)
▼ As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using it{
network formation} through selfish competition as an approach to modeling graphs with particular topologies. We introduce a model with nonlinear payoffs that results in a pairwise stable graph with an arbitrary degree sequence. Further, we introduce a model with link bias that also shows how networks with arbitrary degree sequences may be formed as a result of selfish competition where agents have a preference for linking with one player over another. For each of these models, we present an optimization model for calculating the price of anarchy, which measures the price of decentralized link decisions by players vs centralized link decisions. We introduced coercion into the model, by considering general
network constraints that may be enforced by a player that is in the game. This model also enables the modeler to analyze the effect of removing a player from the game.
We further investigate a specific application of our results to collaborative oligopolies. We extend the results of Goyal and Joshi (S. Goyal and S. Joshi. Networks of collaboration in oligopoly. Games and Economic behavior, 43(1):57-85, 2003), who first considered the problem of collaboration networks of oligopolies and showed that under certain linear assumptions
network collaboration produced a stable complete graph through selfish competition. We show with nonlinear cost functions and player payoff alteration that stable collaboration graphs with an arbitrary degree sequence can result. We then show conditions under which these results can be applied to spatial collaborative oligopolies.
Advisors/Committee Members: Terry Lee Friesz, Dissertation Advisor/Co-Advisor, Dr Paul Griffin, Committee Chair/Co-Chair, Tao Yao, Committee Member, Ling Rothrock, Committee Member, George Kesidis, Committee Member, Christopher H Griffin, Special Member.
Subjects/Keywords: Network Formation; Network Game; Game Theory; Network Science; Optimization; Graph Generation
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):
Lichter, S. M. (2013). A Game Theoretic Approach to Network Formation. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/18298
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):
Lichter, Shaun Matthew. “A Game Theoretic Approach to Network Formation.” 2013. Thesis, Penn State University. Accessed January 15, 2021.
https://submit-etda.libraries.psu.edu/catalog/18298.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lichter, Shaun Matthew. “A Game Theoretic Approach to Network Formation.” 2013. Web. 15 Jan 2021.
Vancouver:
Lichter SM. A Game Theoretic Approach to Network Formation. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Jan 15].
Available from: https://submit-etda.libraries.psu.edu/catalog/18298.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lichter SM. A Game Theoretic Approach to Network Formation. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/18298
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Boston University
9.
Esposito, Flavio.
A policy-based architecture for virtual network embedding.
Degree: PhD, Computer Science, 2014, Boston University
URL: http://hdl.handle.net/2144/14273
► Network virtualization is a technology that enables multiple virtual instances to coexist on a common physical network infrastructure. This paradigm fostered new business models, allowing…
(more)
▼ Network virtualization is a technology that enables multiple virtual instances to coexist on a common physical network infrastructure. This paradigm fostered new business models, allowing infrastructure providers to lease or share their physical resources. Each virtual network is isolated and can be customized to support a new class of customers and applications.
To this end, infrastructure providers need to embed virtual networks on their infrastructure. The virtual network embedding is the (NP-hard) problem of matching constrained virtual networks onto a physical network. Heuristics to solve the embedding problem have exploited several policies under different settings. For example, centralized solutions have been devised for small enterprise physical networks, while distributed solutions have been proposed over larger federated wide-area networks.
In this thesis we present a policy-based architecture for the virtual network embedding problem. By policy, we mean a variant aspect of any of the three (invariant) embedding mechanisms: physical resource discovery, virtual network mapping, and allocation on the physical infrastructure. Our architecture adapts to different scenarios by instantiating appropriate policies, and has bounds on embedding efficiency, and on convergence embedding time, over a single provider, or across multiple federated providers. The performance of representative novel and existing policy configurations are compared via extensive simulations, and over a prototype implementation. We also present an object model as a foundation for a protocol specification, and
we release a testbed to enable users to test their own embedding policies, and to run applications within their virtual networks. The testbed uses a Linux system architecture to reserve virtual node and link capacities.
Subjects/Keywords: Computer science; Cloud computing; Embedding; Network architecture; Network protocol; Network virtualization; Virtual 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):
Esposito, F. (2014). A policy-based architecture for virtual network embedding. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/14273
Chicago Manual of Style (16th Edition):
Esposito, Flavio. “A policy-based architecture for virtual network embedding.” 2014. Doctoral Dissertation, Boston University. Accessed January 15, 2021.
http://hdl.handle.net/2144/14273.
MLA Handbook (7th Edition):
Esposito, Flavio. “A policy-based architecture for virtual network embedding.” 2014. Web. 15 Jan 2021.
Vancouver:
Esposito F. A policy-based architecture for virtual network embedding. [Internet] [Doctoral dissertation]. Boston University; 2014. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2144/14273.
Council of Science Editors:
Esposito F. A policy-based architecture for virtual network embedding. [Doctoral Dissertation]. Boston University; 2014. Available from: http://hdl.handle.net/2144/14273
University of Michigan
10.
Mofakham, Sima.
Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks.
Degree: PhD, Biophysics, 2016, University of Michigan
URL: http://hdl.handle.net/2027.42/120768
► Brain’s structure, dynamics, and function are deeply intertwined. To understand how the brain functions, it is crucial to uncover the links between network structure and…
(more)
▼ Brain’s structure, dynamics, and function are deeply intertwined. To understand how the brain functions, it is crucial to uncover the links between
network structure and its dynamics. Here I examine different approaches to exploring the key connecting factors between
network structure, dynamics and eventually its function. I predominantly concentrate on emergence and temporal evolution of synchronization, or coincidence of neuronal spike timings, as it has been associated with many brain functions while aberrant synchrony is implicated in many neurological disorders. Specifically, in chapter II, I investigate how the interplay of cellular properties with
network coupling characteristics could affect the propensity of neural networks for synchronization. Then, in chapter III, I develop a set of measures that identify hallmarks and potentially predict autonomous
network transitions from asynchronous to synchronous dynamics under various conditions. The developed metrics can be calculated in real time and therefore potentially applied in clinical situations. Finally, in chapter IV, I aim to tie the correlates of neural
network dynamics to the brain function. More specifically, I elucidate dynamical underpinnings of learning and memory consolidation from in vivo recordings of mice experiencing contextual fear conditioning (CFC) and show, that the introduced notion of
network stability may predict future animal performance on memory retrieval.
Overall, the results presented within this dissertation underscore the importance of concurrent analysis of networks’ dynamical and structural properties. The developed approaches may prove useful beyond the specific application presented within this thesis.
Advisors/Committee Members: Zochowski, Michal R (committee member), Aton, Sara Jo (committee member), Steel, Duncan G (committee member), Booth, Victoria (committee member), Yang, Qiong (committee member).
Subjects/Keywords: Computational neuroscience; neural network; Science (General); Science
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):
Mofakham, S. (2016). Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/120768
Chicago Manual of Style (16th Edition):
Mofakham, Sima. “Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks.” 2016. Doctoral Dissertation, University of Michigan. Accessed January 15, 2021.
http://hdl.handle.net/2027.42/120768.
MLA Handbook (7th Edition):
Mofakham, Sima. “Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks.” 2016. Web. 15 Jan 2021.
Vancouver:
Mofakham S. Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks. [Internet] [Doctoral dissertation]. University of Michigan; 2016. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2027.42/120768.
Council of Science Editors:
Mofakham S. Elucidating the Interplay of Structure, Dynamics, and Function in the Brain’s Neural Networks. [Doctoral Dissertation]. University of Michigan; 2016. Available from: http://hdl.handle.net/2027.42/120768
KTH
11.
Masuda, Noriyuki.
A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation.
Degree: Entrepreneurship and innovation, 2015, KTH
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189274
► This thesis contributes to the advancement on the network view of social capital andentrepreneurship, focusing on science-based innovation by observatory social network research. The…
(more)
▼ This thesis contributes to the advancement on the network view of social capital andentrepreneurship, focusing on science-based innovation by observatory social network research. The study has conducted a survey to construct a network map of and network attitudes in Zulu science park (alias name) located in Sweden. The analysis showed that there were relatively positive expectations to utilize network more effectively and efficiently in their business activity with respect to sharing of research skills and resources, as well as social exchange in particular. Currently, the science park seems not yet to take advantage of the potential momentum of the respondents or bottom-up initiatives where tenants maintain the environment mutually under trust. I discuss the merits and challenges in such resource and knowledge sharing in the business development support and governance as a new way of unique business incubator and science-park management, focusing on networking.
Subjects/Keywords: Network; Social Network Analysis; SNA; Social Capital; Science-based innovation; science
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):
Masuda, N. (2015). A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189274
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):
Masuda, Noriyuki. “A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation.” 2015. Thesis, KTH. Accessed January 15, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189274.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Masuda, Noriyuki. “A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation.” 2015. Web. 15 Jan 2021.
Vancouver:
Masuda N. A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation. [Internet] [Thesis]. KTH; 2015. [cited 2021 Jan 15].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189274.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Masuda N. A Mapping of Intra Research Park Networking Toward Efficient Utilization of Social Capital in Science Driven Innovation. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189274
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
12.
Canbaz, Abdullah M.
INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE.
Degree: 2018, University of Nevada – Reno
URL: http://hdl.handle.net/11714/4537
► Data has become one of the most valuable resources in today’s world where we have greater digital presence. Large volumes of data are generated through…
(more)
▼ Data has become one of the most valuable resources in today’s world where we have greater digital presence. Large volumes of data are generated through various platforms including web, social networks, mobile devices, scientific instruments, infrastructure sensors, and many other IoT devices. A challenge for researchers is to mine valuable relevant information from big data efficiently and in a timely manner. Internet is the largest man-made complex system whose underlying
network has not been characterized precisely. Internet topology is shaped by tens of thousands of
network providers optimizing local communication efficiency without a central authority. Numerous methods and platforms have been developed to accurately measure and analyze the Internet topology data.In this dissertation, we perform a comprehensive analysis of existing Internet topology data sets, develop and deploy our measurement platform to obtain detailed topologies of Autonomous System (AS) networks, and analyze collected data to understand path stability and topological characteristics of backbone networks. Our results indicate that the use of multiple data sets from different vantage points is important for building a comprehensive picture of the Internet topology as each data set provides a unique contribution into visibility of a
network. Analyzing earlier measurement data sets, we implement an Internet topology mapping and analysis system that collects detailed measurements from a set of measurement nodes on top of the large-scale topology data shared in public repositories. Our design intelligently utilizes the big data collection and processing approaches for mapping the Internet’s underlying topology in order to better understand
network characteristics and discovers more than thirteen times links then all other data repositories combined. Analyzing collected
network data, we observe that most of the ASes have star-like topologies where high degree hubs connect low degree routers but tier-1 ASes often have a power-law degree distribution in a small-world
network topology; there are persistent routing anomalies and loops in the end-to-end communication over the Internet; and
network paths within individual ASes are mostly non-shortest paths indicating load distribution by the Internet Service Providers (ISP).
Advisors/Committee Members: Gunes, Mehmet H. (advisor), Nicolescu, Monica (committee member), Arslan, Engin (committee member), Yang, Lei (committee member), Fadali, Muhammed Sami (committee member).
Subjects/Keywords: Big Data; Data Science; Network Measurements; Network Science
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):
Canbaz, A. M. (2018). INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/4537
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):
Canbaz, Abdullah M. “INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE.” 2018. Thesis, University of Nevada – Reno. Accessed January 15, 2021.
http://hdl.handle.net/11714/4537.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Canbaz, Abdullah M. “INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE.” 2018. Web. 15 Jan 2021.
Vancouver:
Canbaz AM. INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE. [Internet] [Thesis]. University of Nevada – Reno; 2018. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/11714/4537.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Canbaz AM. INTERNET TOPOLOGY MINING: FROM BIG DATA TO NETWORK SCIENCE. [Thesis]. University of Nevada – Reno; 2018. Available from: http://hdl.handle.net/11714/4537
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Notre Dame
13.
Vipin Vijayan.
Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>.
Degree: Computer Science and Engineering, 2017, University of Notre Dame
URL: https://curate.nd.edu/show/tq57np21r75
► Networks are used to model a wide variety of real-world systems. Network alignment (NA) aims to find a node mapping between networks that identifies…
(more)
▼ Networks are used to model a wide variety of
real-world systems.
Network alignment (NA) aims to find a node
mapping between networks that identifies topologically or
functionally similar
network regions. NA has applications in many
fields, including computational biology, ontology matching,
language processing, and social networks. The focus of this
dissertation is on NA in the domain of computational biology, where
NA is used to align biological networks of different species, such
as the species’ protein interaction networks (PINs). Then, NA can
guide the transfer of biological knowledge from well-studied
species to poorly-studied species between conserved (i.e., aligned)
PIN regions. As such, NA has the potential to revolutionize our
biological understanding, just as genomic sequence alignment has
had. NA can be categorized into pairwise and
multiple. Pairwise NA (PNA) aims to align two networks while
multiple NA (MNA) can align more than two networks. It is
hypothesized that MNA might lead to deeper biological insights than
PNA, because MNA can simultaneously capture conserved regions
between more networks than PNA, though at the expense of higher
computational complexity. In this context, we make the following
contributions. First, we introduce MAGNA++, our novel
state-of-the-art PNA method. Second, we introduce our new method
called multiMAGNA++, which is MAGNA++‘s equivalent for MNA. We also
introduce new measures of alignment quality for MNA. Third, since
new PNA or MNA methods proposed in the literature are generally
compared only to other methods from the same NA category, we
perform the first ever evaluation of PNA against MNA, where we
shockingly find that in general PNA is both more accurate and
faster than MNA, which has many implications for future NA
research. Fourth, existing NA methods can only align static
networks. However, most of complex real-world systems evolve over
time and should thus be modeled as dynamic networks. We hypothesize
that aligning dynamic
network representations of evolving systems
will produce superior alignments compared to aligning the systems’
static
network representations, as is currently done. For this
purpose, we introduce the first ever dynamic PNA method and confirm
our hypothesis.
Advisors/Committee Members: Aaron Striegel, Committee Member, Tim Weninger, Committee Member, Collin McMillan, Committee Member, Tijana Milenkovic, Research Director.
Subjects/Keywords: Network science; Network alignment; Network analysis; Data science; Bioinformatics; Computer science; Protein interaction networks; Temporal networks; Dynamic 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):
Vijayan, V. (2017). Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/tq57np21r75
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):
Vijayan, Vipin. “Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>.” 2017. Thesis, University of Notre Dame. Accessed January 15, 2021.
https://curate.nd.edu/show/tq57np21r75.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Vijayan, Vipin. “Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>.” 2017. Web. 15 Jan 2021.
Vancouver:
Vijayan V. Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>. [Internet] [Thesis]. University of Notre Dame; 2017. [cited 2021 Jan 15].
Available from: https://curate.nd.edu/show/tq57np21r75.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Vijayan V. Novel Algorithmic Contributions and Evaluation Frameworks
for Network Alignment with Applications in Computational
Biology</h1>. [Thesis]. University of Notre Dame; 2017. Available from: https://curate.nd.edu/show/tq57np21r75
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
14.
Sun, Zhongyao.
Analysis and Logical Modeling of Biological Signaling Transduction Networks.
Degree: 2015, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/25268
► The study of network theory and its application span across a multitude of seemingly disparate fields of science and technology: computer science, biology, social science,…
(more)
▼ The study of
network theory and its application span across a multitude of seemingly disparate fields of
science and technology: computer
science, biology, social
science, linguistics, etc. It is the intrinsic similarities embedded in the entities and the way they interact with one another in these systems that link them together.
In this dissertation, I present from both the aspect of theoretical analysis and the aspect of application three projects, which primarily focus on signal transduction networks in biology. In these projects, I assembled a
network model through extensively perusing literature, performed model-based simulations and validation, analyzed
network topology, and proposed a novel
network measure. The application of
network modeling to the system of stomatal opening in plants revealed a fundamental question about the process that has been left unanswered in decades. The novel measure of the redundancy of signal transduction networks with Boolean dynamics by calculating its maximum node-independent elementary signaling mode set accurately predicts the effect of single node knockout in such signaling processes. The three projects as an organic whole advance the understanding of a real system as well as the behavior of such
network models, giving me an opportunity to take a glimpse at the dazzling facets of the immense world of
network science.
Advisors/Committee Members: Reka Z Albert, Dissertation Advisor/Co-Advisor, Reka Z Albert, Committee Chair/Co-Chair, Dezhe Jin, Committee Member, Jorge Osvaldo Sofo, Committee Member, John Fricks, Committee Member.
Subjects/Keywords: network science; biological networks; discrete dynamics; Boolean network; system biology; network modeling; signal transduction
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):
Sun, Z. (2015). Analysis and Logical Modeling of Biological Signaling Transduction Networks. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/25268
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):
Sun, Zhongyao. “Analysis and Logical Modeling of Biological Signaling Transduction Networks.” 2015. Thesis, Penn State University. Accessed January 15, 2021.
https://submit-etda.libraries.psu.edu/catalog/25268.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sun, Zhongyao. “Analysis and Logical Modeling of Biological Signaling Transduction Networks.” 2015. Web. 15 Jan 2021.
Vancouver:
Sun Z. Analysis and Logical Modeling of Biological Signaling Transduction Networks. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Jan 15].
Available from: https://submit-etda.libraries.psu.edu/catalog/25268.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sun Z. Analysis and Logical Modeling of Biological Signaling Transduction Networks. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/25268
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Boston University
15.
Malhotra, Aanchal.
Attacking and securing Network Time Protocol.
Degree: PhD, Computer Science, 2019, Boston University
URL: http://hdl.handle.net/2144/39584
► Network Time Protocol (NTP) is used to synchronize time between computer systems communicating over unreliable, variable-latency, and untrusted network paths. Time is critical for many…
(more)
▼ Network Time Protocol (NTP) is used to synchronize time between computer systems communicating over unreliable, variable-latency, and untrusted
network paths. Time is critical for many applications; in particular it is heavily utilized by cryptographic protocols. Despite its importance, the community still lacks visibility into the robustness of the NTP ecosystem itself, the integrity of the timing information transmitted by NTP, and the impact that any error in NTP might have upon the security of other protocols that rely on timing information. In this thesis, we seek to accomplish the following broad goals:
1. Demonstrate that the current design presents a security risk, by showing that
network attackers can exploit NTP and then use it to attack other core Internet protocols that rely on time.
2. Improve NTP to make it more robust, and rigorously analyze the security of the improved protocol.
3. Establish formal and precise security requirements that should be satisfied by a
network time-synchronization protocol, and prove that these are sufficient for the security of other protocols that rely on time.
We take the following approach to achieve our goals incrementally.
1. We begin by (a) scrutinizing NTP's core protocol (RFC 5905) and (b) statically analyzing code of its reference implementation to identify vulnerabilities in protocol design, ambiguities in specifications, and flaws in reference implementations. We then leverage these observations to show several off- and on-path denial-of-service and time-shifting attacks on NTP clients. We then show cache-flushing and cache-sticking attacks on DNS(SEC) that leverage NTP. We quantify the attack surface using Internet measurements, and suggest simple countermeasures that can improve the security of NTP and DNS(SEC).
2. Next we move beyond identifying attacks and leverage ideas from Universal Composability (UC) security framework to develop a cryptographic model for attacks on NTP's datagram protocol. We use this model to prove the security of a new backwards-compatible protocol that correctly synchronizes time in the face of both off- and on-path
network attackers.
3. Next, we propose general security notions for
network time-synchronization protocols within the UC framework and formulate ideal functionalities that capture a number of prevalent forms of time measurement within existing systems. We show how they can be realized by real-world protocols (including but not limited to NTP), and how they can be used to assert security of time-reliant applications-specifically, cryptographic certificates with revocation and expiration times. Our security framework allows for a clear and modular treatment of the use of time in security-sensitive systems.
Our work makes the core NTP protocol and its implementations more robust and secure, thus improving the security of applications and protocols that rely on time.
Advisors/Committee Members: Goldberg, Sharon (advisor).
Subjects/Keywords: Computer science; Cryptography; Domain name system (DNS); Network attacks; Network protocols; Network Time Protocol; 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):
Malhotra, A. (2019). Attacking and securing Network Time Protocol. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/39584
Chicago Manual of Style (16th Edition):
Malhotra, Aanchal. “Attacking and securing Network Time Protocol.” 2019. Doctoral Dissertation, Boston University. Accessed January 15, 2021.
http://hdl.handle.net/2144/39584.
MLA Handbook (7th Edition):
Malhotra, Aanchal. “Attacking and securing Network Time Protocol.” 2019. Web. 15 Jan 2021.
Vancouver:
Malhotra A. Attacking and securing Network Time Protocol. [Internet] [Doctoral dissertation]. Boston University; 2019. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2144/39584.
Council of Science Editors:
Malhotra A. Attacking and securing Network Time Protocol. [Doctoral Dissertation]. Boston University; 2019. Available from: http://hdl.handle.net/2144/39584
16.
Wang, Yuefeng.
Multi-layer virtual transport network design and management.
Degree: PhD, Computer Science, 2017, Boston University
URL: http://hdl.handle.net/2144/20873
► Nowadays there is an increasing need for a general paradigm that can simplify network management and further enable network innovations. Software Defined Networking (SDN) is…
(more)
▼ Nowadays there is an increasing need for a general paradigm that can simplify network management and further enable network innovations. Software Defined Networking (SDN) is an efficient way to make the network programmable and reduce management complexity, however it is plagued with limitations inherited from the legacy Internet (TCP/IP) architecture. On the other hand, service overlay networks and virtual networks are widely used to overcome deficiencies of the Internet. However, most overlay/virtual networks are single-layered and lack dynamic scope management. Furthermore, how to solve the joint problem of designing and mapping the overlay/virtual network requests for better application and network performance remains an understudied area.
In this thesis, in response to limitations of current SDN management solutions and of the traditional single-layer overlay/virtual network design, we propose a recursive approach to enterprise network management, where network management is done through managing various Virtual Transport Networks (VTNs) over different scopes (i.e., regions of operation). Different from the traditional overlay/virtual network model which mainly focuses on routing/tunneling, our VTN approach provides communication service with explicit Quality-of-Service (QoS) support for applications via transport flows, i.e., it involves all mechanisms (e.g., addressing, routing, error and flow control, resource allocation) needed to meet application requirements. Our approach inherently provides a multi-layer solution for overlay/virtual network design.
The contributions of this thesis are threefold: (1) we propose a novel VTN-based management approach to enterprise network management; (2) we develop a framework for multi-layer VTN design and instantiate it to meet specific application and network goals; and (3) we design and prototype a VTN-based management architecture. Our simulation and experimental results demonstrate the flexibility of our VTN-based management approach and its performance advantages.
Subjects/Keywords: Computer science; Computer network management; Future network architecture; Multi-layer network design
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):
Wang, Y. (2017). Multi-layer virtual transport network design and management. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/20873
Chicago Manual of Style (16th Edition):
Wang, Yuefeng. “Multi-layer virtual transport network design and management.” 2017. Doctoral Dissertation, Boston University. Accessed January 15, 2021.
http://hdl.handle.net/2144/20873.
MLA Handbook (7th Edition):
Wang, Yuefeng. “Multi-layer virtual transport network design and management.” 2017. Web. 15 Jan 2021.
Vancouver:
Wang Y. Multi-layer virtual transport network design and management. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2144/20873.
Council of Science Editors:
Wang Y. Multi-layer virtual transport network design and management. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/20873
Delft University of Technology
17.
Andreas Yunus, Andreas (author).
The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:9a62299f-13af-4230-b3a0-e574e6fd023f
► A nation’s main port is a crucial component that contributes to the economic development of a country. Therefore, the role of the port becomes more…
(more)
▼ A nation’s main port is a crucial component that contributes to the economic development of a country. Therefore, the role of the port becomes more critical nowadays. However, due to the existing hub-and-spoke structure of the European multimodal transportation network, polarisation and regionalisation are visible in the network. The increasing regionalisation and polarisation that happens in the European region widen the inequality in the network. Moreover, the inequality in the network will impact the sensitivity and resistance of the whole network to targeted disruptions, such as infrastructure failures, natural disasters, or potential terrorist attack. Then, on the real aspect, the widening of inequality in the network also inhibits the well-distributed economic development in the region. In this study, various methods will be employed to have multiple points of view of the network itself, such as the multilayer network analysis, community detection, and Network-based Hub Port Assessment (NHPA). Furthermore, the study will be structured into three building blocks that shapes as a foundation to perform the final analysis and provide a multifaceted overview of the overall network, which is versatility analysis, community structure analysis, and quantification of collaboration-connectivity of the container hubs. Afterwards, three determinants as measurements of network performance are defined, to perform the criticality analysis. This study concludes that the development of connections between different communities can help to decrease the existing inequality in the network. Then, the appearance of new community structure in the network can help to decrease the inequality in the network, which lead to more well-distributed economic development in the region.
Engineering and Policy Analysis
Advisors/Committee Members: Cunningham, Scott (mentor), van Duin, Ron (graduation committee), Ebrahimi Fard, Amir (graduation committee), Harter, Camill (mentor), Delft University of Technology (degree granting institution).
Subjects/Keywords: Network science; Graph theory; Multilayer network analysis; Criticality analysis; Transportation network; Multimodal transportation; Container hubs
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):
Andreas Yunus, A. (. (2019). The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:9a62299f-13af-4230-b3a0-e574e6fd023f
Chicago Manual of Style (16th Edition):
Andreas Yunus, Andreas (author). “The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure.” 2019. Masters Thesis, Delft University of Technology. Accessed January 15, 2021.
http://resolver.tudelft.nl/uuid:9a62299f-13af-4230-b3a0-e574e6fd023f.
MLA Handbook (7th Edition):
Andreas Yunus, Andreas (author). “The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure.” 2019. Web. 15 Jan 2021.
Vancouver:
Andreas Yunus A(. The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 15].
Available from: http://resolver.tudelft.nl/uuid:9a62299f-13af-4230-b3a0-e574e6fd023f.
Council of Science Editors:
Andreas Yunus A(. The Criticality of the European Multimodal Transportation Network: Multifaceted Investigation of the European Hinterland Transportation Network based on Its Network Structure. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:9a62299f-13af-4230-b3a0-e574e6fd023f
University of Michigan
18.
Yoo, Hyesun.
Statistical Tools for Directed and Bipartite Networks.
Degree: PhD, Statistics, 2020, University of Michigan
URL: http://hdl.handle.net/2027.42/163156
► Directed networks and bipartite networks, which exhibit unique asymmetric connectivity structures, are commonly observed in a variety of scientific and engineering fields. Despite their abundance…
(more)
▼ Directed networks and bipartite networks, which exhibit unique asymmetric connectivity structures, are commonly observed in a variety of scientific and engineering fields. Despite their abundance and utility, most
network analysis methods only consider symmetric networks. In this thesis, we develop statistical methods and theory for directed and bipartite networks.
The first chapter focuses on matched community detection in a bipartite
network. The detection of matched communities, i.e. communities that consist of nodes of two types that are closely connected with one another, is a fundamental and challenging problem. Most widely used approaches for matched community detection are either computationally inefficient or prone to non-ideal performance. We propose a new two-stage algorithm that uses fast spectral methods to recover matched communities. We show that, for bipartite networks, it is critical to adjust for the community size in matched community detection, which had not been considered before. We also provide theoretical error bounds for the proposed algorithm on the number of mis-clustered nodes under a variant of the stochastic block model. Numerical studies indicate that the proposed method outperforms existing spectral algorithms, especially when the sizes of the matched communities are proportionally different between the two types.
The second chapter of the thesis introduces a new preference-based block model for community detection in a directed
network. Unlike existing models, the proposed model allows different sender nodes to have different preferences to communities in the
network. We argue that the right singular vectors of a graph Laplacian matrix contain community structures under the model. Further, we propose a spectral clustering algorithm to detect communities and estimate parameters of the model. Theoretical results show insights on how the heterogeneity of preferences and out-degrees contribute to an upper bound of the number of mis-clustered nodes. Numerical studies support the theoretical results and illustrate the outstanding performance of the proposed method. The model can also be naturally extended to bipartite networks.
In the third chapter, we propose a dyadic latent space model which accommodates the reciprocity between a pair of nodes in directed networks. Nodes in a pair in directed networks often exhibit strong dependencies with each other, though most widely used approaches usually account for this phenomenon with limited flexibility. We propose a new latent space model for directed networks that incorporates the reciprocity in a flexible way, allowing for important characteristics such as homophily and heterogeneity of the nodes. A fast and scalable algorithm based on projected gradient descent has been developed to fit the model by maximizing the likelihood. Both simulation studies and real-world data examples illustrate that the proposed model is effective in various
network analysis tasks including link prediction and community detection.
Advisors/Committee Members: Zhu, Ji (committee member), Kang, Jian (committee member), Levina, Elizaveta (committee member), Xu, Gongjun (committee member).
Subjects/Keywords: network analysis; directed network; bipartite network; community detection; Statistics and Numeric Data; Science
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):
Yoo, H. (2020). Statistical Tools for Directed and Bipartite Networks. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/163156
Chicago Manual of Style (16th Edition):
Yoo, Hyesun. “Statistical Tools for Directed and Bipartite Networks.” 2020. Doctoral Dissertation, University of Michigan. Accessed January 15, 2021.
http://hdl.handle.net/2027.42/163156.
MLA Handbook (7th Edition):
Yoo, Hyesun. “Statistical Tools for Directed and Bipartite Networks.” 2020. Web. 15 Jan 2021.
Vancouver:
Yoo H. Statistical Tools for Directed and Bipartite Networks. [Internet] [Doctoral dissertation]. University of Michigan; 2020. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2027.42/163156.
Council of Science Editors:
Yoo H. Statistical Tools for Directed and Bipartite Networks. [Doctoral Dissertation]. University of Michigan; 2020. Available from: http://hdl.handle.net/2027.42/163156
University of California – Berkeley
19.
Gong, Zhenqiang.
Towards Secure and Privacy-Preserving Online Social Networking Services.
Degree: Electrical Engineering & Computer Sciences, 2015, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/1b14t6kq
► Online social networking services (e.g., Facebook, Twitter, and Blogger) bring new benefits to almost all aspects of our lives. They have completely transformed how we…
(more)
▼ Online social networking services (e.g., Facebook, Twitter, and Blogger) bring new benefits to almost all aspects of our lives. They have completely transformed how we communicate with each other, how we process information, and how we diffuse social influence. However, these social networking services are also plagued by both conventional and emerging threats to security and privacy. For instance, two fundamental security risks are 1) users’ accounts are compromised by attackers or get lost and 2) attackers create massive fake (or Sybil) accounts to launch various malicious activities. In this thesis, we first design secure and usable account recovery methods based on users’ trusted friends to recover compromised or lost user accounts. Second, we construct a scalable semi-supervised learning framework, which is based on probabilistic graphical model techniques, to detect Sybil accounts. Third, we demonstrate that diverse private information (e.g., private user demographics and hidden social connections) can be inferred with high accuracies from data that is publicly available on social networking sites, which has implications for the design of privacy-preserving online social networking services.
Subjects/Keywords: Computer science; authentication; social network analysis; social network security and 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):
Gong, Z. (2015). Towards Secure and Privacy-Preserving Online Social Networking Services. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1b14t6kq
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):
Gong, Zhenqiang. “Towards Secure and Privacy-Preserving Online Social Networking Services.” 2015. Thesis, University of California – Berkeley. Accessed January 15, 2021.
http://www.escholarship.org/uc/item/1b14t6kq.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Gong, Zhenqiang. “Towards Secure and Privacy-Preserving Online Social Networking Services.” 2015. Web. 15 Jan 2021.
Vancouver:
Gong Z. Towards Secure and Privacy-Preserving Online Social Networking Services. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2021 Jan 15].
Available from: http://www.escholarship.org/uc/item/1b14t6kq.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Gong Z. Towards Secure and Privacy-Preserving Online Social Networking Services. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/1b14t6kq
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Riverside
20.
Beyene, Yordanos.
A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices.
Degree: Computer Science, 2014, University of California – Riverside
URL: http://www.escholarship.org/uc/item/53f463j8
► In this dissertation, we attempt to understand and predict the performance of security devices. More specifically, we examine the following types of questions: (a) Given…
(more)
▼ In this dissertation, we attempt to understand and predict the performance of security devices. More specifically, we examine the following types of questions: (a) Given a security device, and a traffic load, can we predict the performance of the device? (b) Given a traffic load and a security device, how can we tune the performance of the device to achieve the desired trade-off between security and performance? We consider both stateful firewalls and Network Intrusion Prevention systems (NIPS). For stateful firewalls we focus on three enterprise class firewalls from Hewlett Packard, SonicWall, and Fortinet. For NIPS we focus on the most widely deployed open Network Intrusion Detection and Prevention system, Snort. Despite an increase in deployment of security devices, and their increasing complexity to detect ever more sophisticated network attacks, there have been limited studies to understand latencies introduced by these devices to Networks. Vendors release performance datasheets that often display the best performance numbers, by conducting measurements with unrealistic traffic profiles, and configurations that don't represent real networks. This practice forces buyers to make purchasing decisions based on guesses, which may cause them to end up buying costly products that they don't need, or to buy underperforming products that could potentially introduce bottlenecks in their networks. The main purpose of our work is to assist system administrators in selecting security devices that meet their networks' current and future performance requirements. We also examined the performance impact of key configuration parameters and provide deployment tips to tune Snort for improved performance. Besides we cover the performance and security limitations of Snort.In this study, we develop two separate models: i) SyFi for stateful firewalls and ii) PreNIPS for Network Intrusion Prevention systems. The stateful firewall model is based on measurements conducted on two enterprise-grade stateful firewalls and a third enterprise-grade stateful firewall was used to validate the finding. Our evaluation on a third firewall shows that our model can estimate throughput across different traffic profiles with over 94% accuracy. PreNIPS is based on measurements conducted on a Snort deployment with several HTTP packet traces, and validated with HTTP packet traces captured from a different website. Our measurements show PreNIPs has over 89% accuracy.
Subjects/Keywords: Computer science; Firewalls; Intrusion Prevension Systems; Network Measurements; 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):
Beyene, Y. (2014). A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/53f463j8
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):
Beyene, Yordanos. “A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices.” 2014. Thesis, University of California – Riverside. Accessed January 15, 2021.
http://www.escholarship.org/uc/item/53f463j8.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Beyene, Yordanos. “A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices.” 2014. Web. 15 Jan 2021.
Vancouver:
Beyene Y. A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices. [Internet] [Thesis]. University of California – Riverside; 2014. [cited 2021 Jan 15].
Available from: http://www.escholarship.org/uc/item/53f463j8.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Beyene Y. A Systematic Approach for Understanding and Modeling the Performance of Network Security Devices. [Thesis]. University of California – Riverside; 2014. Available from: http://www.escholarship.org/uc/item/53f463j8
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Cornell University
21.
Tseng, Shih-Hao.
Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk.
Degree: PhD, Electrical and Computer Engineering, 2018, Cornell University
URL: http://hdl.handle.net/1813/64901
► Over the past decades, data centers are built across the globe in response to the ever-growing Internet traffic. The data centers are managed and operated…
(more)
▼ Over the past decades, data centers are built across the globe in response to the ever-growing Internet traffic. The data centers are managed and operated by the service providers through private inter-datacenter wide area networks (WANs). Unlike WANs involving multiple service providers, these private inter-datacenter WANs exhibit a number of unique characteristics. For example, the end-hosts and the
network fabric are controlled by one single provider; scheduled bulk traffic transfers terabits of data across expensive WAN links for replication and migration; also, major service providers embrace software-defined networking (SDN) in their inter-datacenter WANs for easier management and better performance. These unique characteristics enable new solutions that were either infeasible or impractical in traditional WANs. We present CodedBulk, an end-to-end system that reduces the bandwidth required for inter-datacenter bulk transfers. CodedBulk is rooted in a known technique from the information theory community –
network coding.
Network coding has been known not only for its significant theoretical benefits but also for its challenging real-world implementation and adoption. CodedBulk addresses the technical implementation challenges of
network coding by exploiting the unique characteristics of inter-datacenter bulk transfers. The design of CodedBulk is agnostic to the underlying transport layer, which allows smooth integration into existing infrastructure. We run our system prototype on inter-datacenter networks, and it demonstrates a significant throughput improvement resulting from the bandwidth reduction.
Advisors/Committee Members: Tang, Ao (chair), Tong, Lang (committee member), Bitar, Eilyan Yamen (committee member).
Subjects/Keywords: Computer science; Inter-Datacenter Network; Network Coding; Computer engineering
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):
Tseng, S. (2018). Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/64901
Chicago Manual of Style (16th Edition):
Tseng, Shih-Hao. “Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk.” 2018. Doctoral Dissertation, Cornell University. Accessed January 15, 2021.
http://hdl.handle.net/1813/64901.
MLA Handbook (7th Edition):
Tseng, Shih-Hao. “Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk.” 2018. Web. 15 Jan 2021.
Vancouver:
Tseng S. Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk. [Internet] [Doctoral dissertation]. Cornell University; 2018. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/1813/64901.
Council of Science Editors:
Tseng S. Orchestrating Inter-Datacenter Bulk Transfers with CodedBulk. [Doctoral Dissertation]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/64901
Washington State University
22.
[No author].
Dynamic Content Generation for the Evaluation of Network Applications
.
Degree: 2012, Washington State University
URL: http://hdl.handle.net/2376/4080
► Generating application-level content within network simulations and/or testbed environments tends toward an ad-hoc process reliant primarily on evaluator expertise. Such ad-hoc approaches are laborious and…
(more)
▼ Generating application-level content within
network simulations and/or testbed environments tends toward an ad-hoc process reliant primarily on evaluator expertise. Such ad-hoc approaches are laborious and often fail to capture important aspects of how content is distributed within traffic. Further, while many tools allow for the generation of a wide-range of content types, there exists no coherent model for populating these tools with the necessary data. To address these issues we propose two models for dynamically generating content so as to provide a systematic means for populating a test with relevant data. First we create content targeting
Network Intrusion Detection Systems (NIDS) that are severely impacted by the composition of the traffic combined with the set of known signatures. Most NIDS evaluation techniques employ on/off models where a packet is either malicious or not. Such evaluation ignores the case where the content of a benign packet partially intersects with one or many signatures, causing more processing for the NIDS. To address this hole in evaluation we propose a traffic model that uses the target NIDS signature set to create partially-matching traffic. This partially-matching traffic then allows the systematic examination of the NIDS across multiple scenarios. Such evaluation provides insight into the idiosyncrasies of a NIDS that would remain hidden if evaluated under current methodologies. Next, we broaden our content generation model to account for all
network applications. We create a content generative model for identifying, harvesting, and assigning application-level content to simulated traffic. This model ties consumers of content to the producers of the content as well to a particular content category. This approach then allows for said content to be tied to a workload generator or simulator of choice to evaluate a given
network application. Finally, we discuss the implementation of these models and potential optimizations for high-speed environments. Ultimately, the models provided here allow for the systematic generation of content for
network applications and serves to bridge the gap in current evaluation methodologies between
network traffic simulation and content.
Advisors/Committee Members: Kim, Min Sik (advisor).
Subjects/Keywords: Computer science;
Content Generation;
Network Simulation;
Network Traffic
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):
author], [. (2012). Dynamic Content Generation for the Evaluation of Network Applications
. (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/4080
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):
author], [No. “Dynamic Content Generation for the Evaluation of Network Applications
.” 2012. Thesis, Washington State University. Accessed January 15, 2021.
http://hdl.handle.net/2376/4080.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
author], [No. “Dynamic Content Generation for the Evaluation of Network Applications
.” 2012. Web. 15 Jan 2021.
Vancouver:
author] [. Dynamic Content Generation for the Evaluation of Network Applications
. [Internet] [Thesis]. Washington State University; 2012. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2376/4080.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
author] [. Dynamic Content Generation for the Evaluation of Network Applications
. [Thesis]. Washington State University; 2012. Available from: http://hdl.handle.net/2376/4080
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Cranfield University
23.
Wang, Yu.
Using network science to disentangle supply networks: a case study in aerospace industry.
Degree: MSc by Research, 2014, Cranfield University
URL: http://dspace.lib.cranfield.ac.uk/handle/1826/9322
► Supply chains in the aerospace sector are becoming more complex than ever before, frequently causing delays on the production process. Complexity gave rise to the…
(more)
▼ Supply chains in the aerospace sector are becoming more complex than ever
before, frequently causing delays on the production process. Complexity gave
rise to the term “supply networks”, changing the way we view supply chains
from a structural point of view. Structural properties are important to investigate
as they help define robustness and efficiency of systems. Although complexity
in structure is suspected by previous researchers who studied these networks,
empirical data to characterise what complexity means, and how it effects
properties of networks has been largely absent from literature. If empirical data
is available, network science can be used to understand structural properties of
such complex supply networks. Network science is a suitable Mathematical tool
for analysing the complex relationships and collaborations in the network and
summarizing the properties of network from a fundamental, structural
perspective. In this report, the author will apply network science to analyse the
structure of the Airbus supply network. Due to the lack of aerospace supply
chain data, firstly an empirical database is built. Analysis then focuses on the
real structure of Airbus supply network and identification of key firms or
communities under two scenarios: a non-weighted network in which the value of
link is either 1 or 0, and a weighted network in which the value of link presents
the strength of relationships among firms. While the weighted network indicates
more informed features of the supply network structure by considering the
weight of relationships, the non-weighted network can help us understand
fundamental patterns that determine the structure of the connections in the
network. The analysis indicates the Airbus supply network carries a power law
distribution, which means most resources are dominated by few firms, and the
network is robust to random firm failure but vulnerable to hub failure. The
network contains communities with strong relationships between them.These
communities do not only belong to the same industry and same region but have
emerged as the result of an interaction between the two effects. Some key firms
in the network own significant power of control the supply chain and fiancial
resources, occupying key positions that bridge communities in the network.The
study presents key structural features of a large scale network using empirical
data and act as a case example for using network science based analysis in
supply chains.
Subjects/Keywords: Aerospace supply chain; network science; Empirical data; Weighted network; Robustness
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):
Wang, Y. (2014). Using network science to disentangle supply networks: a case study in aerospace industry. (Masters Thesis). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/9322
Chicago Manual of Style (16th Edition):
Wang, Yu. “Using network science to disentangle supply networks: a case study in aerospace industry.” 2014. Masters Thesis, Cranfield University. Accessed January 15, 2021.
http://dspace.lib.cranfield.ac.uk/handle/1826/9322.
MLA Handbook (7th Edition):
Wang, Yu. “Using network science to disentangle supply networks: a case study in aerospace industry.” 2014. Web. 15 Jan 2021.
Vancouver:
Wang Y. Using network science to disentangle supply networks: a case study in aerospace industry. [Internet] [Masters thesis]. Cranfield University; 2014. [cited 2021 Jan 15].
Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/9322.
Council of Science Editors:
Wang Y. Using network science to disentangle supply networks: a case study in aerospace industry. [Masters Thesis]. Cranfield University; 2014. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/9322
Columbia University
24.
Kim, Kyung Hwa.
Towards Trouble-Free Networks for End Users.
Degree: 2018, Columbia University
URL: https://doi.org/10.7916/D8KW6T0G
► Network applications and Internet services fail all too frequently. However, end users cannot effectively identify the root cause using traditional troubleshooting techniques due to the…
(more)
▼ Network applications and Internet services fail all too frequently. However, end users cannot effectively identify the root cause using traditional troubleshooting techniques due to the limited capability to distinguish failures caused by local network elements from failures caused by elements located outside the local area network.
To overcome these limitations, we propose a new approach, one that leverages collaboration of user machines to assist end users in diagnosing various failures related to Internet connectivity and poor network performance.
First, we present DYSWIS ("Do You See What I See?"), an automatic network fault detection and diagnosis system for end users. DYSWIS identifies the root cause(s) of network faults using diagnostic rules that consider diverse information from multiple nodes. In addition, the DYSWIS rule system is specially designed to support crowdsourced and distributed probes. We also describe the architecture of DYSWIS and compare its performance with other tools. Finally, we demonstrate that the system successfully detects and diagnoses network failures which are difficult to diagnose using a single-user probe.
Failures in lower layers of the protocol stack also have the potential to disrupt Internet access; for example, slow Internet connectivity is often caused by poor Wi-Fi performance. Channel contention and non-Wi-Fi interference are the primary reasons for this performance degradation. We investigate the characteristics of non-Wi-Fi interference that can severely degrade Wi-Fi performance and present WiSlow ("Why is my Wi-Fi slow?"), a software tool that diagnoses the root causes of poor Wi-Fi performance. WiSlow employs user-level network probes and leverages peer collaboration to identify the physical location of these causes. The software includes two principal methods: packet loss analysis and 802.11 ACK number analysis. When the issue is located near Wi-Fi devices, the accuracy of WiSlow exceeds 90%.
Finally, we expand our collaborative approach to the Internet of Things (IoT) and propose a platform for network-troubleshooting on home devices. This platform takes advantage of built-in technology common to modern devices – multiple communication interfaces. For example, when a home device has a problem with an interface it sends a probe request to other devices using an alternative interface. The system then exploits cooperation of both internal devices and remote machines. We show that this approach is useful in home networks by demonstrating an application that contains actual diagnostic algorithms.
Subjects/Keywords: Computer science; Computer network resources; Internet users; Computer network protocols
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):
Kim, K. H. (2018). Towards Trouble-Free Networks for End Users. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8KW6T0G
Chicago Manual of Style (16th Edition):
Kim, Kyung Hwa. “Towards Trouble-Free Networks for End Users.” 2018. Doctoral Dissertation, Columbia University. Accessed January 15, 2021.
https://doi.org/10.7916/D8KW6T0G.
MLA Handbook (7th Edition):
Kim, Kyung Hwa. “Towards Trouble-Free Networks for End Users.” 2018. Web. 15 Jan 2021.
Vancouver:
Kim KH. Towards Trouble-Free Networks for End Users. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 15].
Available from: https://doi.org/10.7916/D8KW6T0G.
Council of Science Editors:
Kim KH. Towards Trouble-Free Networks for End Users. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8KW6T0G
Boston University
25.
Machado, Michel Silva.
Linux XIA: an interoperable meta network architecture.
Degree: PhD, Computer Science, 2014, Boston University
URL: http://hdl.handle.net/2144/14389
► With the growing number of clean-slate redesigns of the Internet, the need for a medium that enables all stakeholders to participate in the realization, evaluation,…
(more)
▼ With the growing number of clean-slate redesigns of the Internet, the need for a medium that enables all stakeholders to participate in the realization, evaluation, and selection of these designs is increasing. We believe that the missing catalyst is a meta network architecture that welcomes most, if not all, clean-state designs on a level playing field, lowers deployment barriers, and leaves the final evaluation to the broader community.
This thesis presents the eXpressive Internet (Meta) Architecture (XIA), itself a clean-slate design, as well as Linux XIA, a native implementation of XIA in the Linux kernel, as a candidate. As a meta network architecture, XIA is highly flexible, leaving stakeholders to choose an expressive set of network principals to instantiate a given network architecture within the XIA framework. Central to XIA is its novel, non-linear network addressing format, from which derive key architectural features such as evolvability, intrinsically secure identifiers, and a low degree of principal isolation. XIP, the network layer protocol of XIA, forwards packets by navigating these structured addresses and delegating the decision-making and packet processing to appropriate principals, accordingly. Taken together, these mechanisms work in tandem to support a broad spectrum of interoperable principals.
We demonstrate how to port four distinct and unrelated network architectures onto Linux XIA, none of which were designed for interoperability with this platform. We then show that, notwithstanding this flexibility, Linux XIA's forwarding performance remains comparable to that of the more mature legacy TCP/IP stack implementation. Moreover, the ported architectures, namely IP, Serval, NDN, and ANTS, empower us to present a deployment plan for XIA, to explore design variations of the ported architectures that were impossible in their original form due to the requirement of self-sufficiency that a standalone network architecture bears, and to substantiate the claim that XIA readily supports and enables network evolution. Our work highlights the benefits of specializing network designs that XIA affords, and comprises instructive examples for the network researcher interested in design and implementation for future interoperability.
Subjects/Keywords: Computer science; ANTS; Internet; Linux; XIA; Network principal; Meta network architecture
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):
Machado, M. S. (2014). Linux XIA: an interoperable meta network architecture. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/14389
Chicago Manual of Style (16th Edition):
Machado, Michel Silva. “Linux XIA: an interoperable meta network architecture.” 2014. Doctoral Dissertation, Boston University. Accessed January 15, 2021.
http://hdl.handle.net/2144/14389.
MLA Handbook (7th Edition):
Machado, Michel Silva. “Linux XIA: an interoperable meta network architecture.” 2014. Web. 15 Jan 2021.
Vancouver:
Machado MS. Linux XIA: an interoperable meta network architecture. [Internet] [Doctoral dissertation]. Boston University; 2014. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/2144/14389.
Council of Science Editors:
Machado MS. Linux XIA: an interoperable meta network architecture. [Doctoral Dissertation]. Boston University; 2014. Available from: http://hdl.handle.net/2144/14389
Clemson University
26.
Ushijima-Mwesigwa, Hayato Montezuma.
Models for Networks with Consumable Resources: Applications to Smart Cities.
Degree: PhD, School of Computing, 2018, Clemson University
URL: https://tigerprints.clemson.edu/all_dissertations/2284
► In this dissertation, we introduce different models for understanding and controlling the spreading dynamics of a network with a consumable resource. In particular, we consider…
(more)
▼ In this dissertation, we introduce different models for understanding and controlling the spreading dynamics of a
network with a consumable resource. In particular, we consider a spreading process where a resource necessary for transit is partially consumed along the way while being refilled at special nodes on the
network. Examples include fuel consumption of vehicles together with refueling stations, information loss during dissemination with error correcting nodes, consumption of ammunition of military troops while moving, and migration of wild animals in a
network with a limited number of water-holes. We undertake this study from two different perspectives. First, we consider a
network science perspective where we are interested in identifying the influential nodes and estimating a nodes’ relative spreading influence in the
network. For this reason, we propose generalizations of the well-known centrality measures to model such a spreading process with consumable resources. Next, from an optimization perspective, we focus on the application of an Electric Vehicle road
network equipped with wireless charging lanes as a resource allocation problem. The objective is this case is to identify a set of nodes for optimal placement of the wireless charging lanes. For this reason, we propose an integer programming model formulation and use it as a building block for different realistic scenarios. We conclude this dissertation by giving an approach to improve route selection for the optimization model proposed by using feedback data while giving comparisons to different realistic scenarios.
Advisors/Committee Members: Ilya Safro, Committee Chair, Mashrur Chowdhury, Brian Dean, Feng Luo.
Subjects/Keywords: Centrality; Complex Networks; Graph Algorithms; Integer Programming; Network Analysis; Network Science
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):
Ushijima-Mwesigwa, H. M. (2018). Models for Networks with Consumable Resources: Applications to Smart Cities. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2284
Chicago Manual of Style (16th Edition):
Ushijima-Mwesigwa, Hayato Montezuma. “Models for Networks with Consumable Resources: Applications to Smart Cities.” 2018. Doctoral Dissertation, Clemson University. Accessed January 15, 2021.
https://tigerprints.clemson.edu/all_dissertations/2284.
MLA Handbook (7th Edition):
Ushijima-Mwesigwa, Hayato Montezuma. “Models for Networks with Consumable Resources: Applications to Smart Cities.” 2018. Web. 15 Jan 2021.
Vancouver:
Ushijima-Mwesigwa HM. Models for Networks with Consumable Resources: Applications to Smart Cities. [Internet] [Doctoral dissertation]. Clemson University; 2018. [cited 2021 Jan 15].
Available from: https://tigerprints.clemson.edu/all_dissertations/2284.
Council of Science Editors:
Ushijima-Mwesigwa HM. Models for Networks with Consumable Resources: Applications to Smart Cities. [Doctoral Dissertation]. Clemson University; 2018. Available from: https://tigerprints.clemson.edu/all_dissertations/2284
The Ohio State University
27.
Ramamurthy, Shriram Raghavendra.
Network Performance Monitoring.
Degree: MS, Computer Science and Engineering, 2012, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1339735459
► Network management is the use of tools that pertain to the operation, administration and provisioning of networked systems. Operation is the continuous monitoring of…
(more)
▼ Network management is the use of tools that
pertain to the operation, administration and provisioning of
networked systems. Operation is the continuous monitoring of the
network for problems, and once identified, the proper fixing of the
problems before the they become widespread. Thus operation refers
to keeping the
network “up and running” smoothly. Maintaining the
correct operation of every
network component is of much importance
to avoid domino effects that ultimately result in total
network
failure. Administration refers to observing all
the resources of the
network, to see how are they utilized and so
on. The main goal of administration is to ensure appropriate usage
of the
network resources. Finally, provisioning means making the
services of the
network available to its users. When a user needs a
particular service, there must an easy way to facilitate the
request and that service upon deployment must also be monitored for
maintaining the sanity of the
network. This
thesis concentrates upon providing various means to monitor a
network, and various tools were created to enable the
network
administrators to prevent the nodes from not going down. The
chapters covered are centric towards Wired Nodes on a local area
network, to a wireless mobile device based monitoring. Experiments
were also run on what is called the “Academic Cloud ” to analyze
the capability of perfSONAR, which helps one to monitor the problem
associated with wide area networks.
Advisors/Committee Members: Ramnath, Rajiv (Advisor).
Subjects/Keywords: Computer Science; network monitoring; network management; iPhone Development
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):
Ramamurthy, S. R. (2012). Network Performance Monitoring. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1339735459
Chicago Manual of Style (16th Edition):
Ramamurthy, Shriram Raghavendra. “Network Performance Monitoring.” 2012. Masters Thesis, The Ohio State University. Accessed January 15, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1339735459.
MLA Handbook (7th Edition):
Ramamurthy, Shriram Raghavendra. “Network Performance Monitoring.” 2012. Web. 15 Jan 2021.
Vancouver:
Ramamurthy SR. Network Performance Monitoring. [Internet] [Masters thesis]. The Ohio State University; 2012. [cited 2021 Jan 15].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1339735459.
Council of Science Editors:
Ramamurthy SR. Network Performance Monitoring. [Masters Thesis]. The Ohio State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1339735459
28.
Badepalli, Satish.
Network Behavior in Thin Film Growth Dynamics.
Degree: 2017, University of Nevada – Reno
URL: http://hdl.handle.net/11714/2029
► Understanding patterns and components in thin film growth is crucial for many engineering applications. Further, the growth dynamics (e.g., shadowing and re-emission effects) of thin…
(more)
▼ Understanding patterns and components in thin film growth is crucial for many engineering applications. Further, the growth dynamics (e.g., shadowing and re-emission effects) of thin films exist in several other natural and man-made phenomena. Recent work developed
network science techniques to study the growth dynamics of thin films and nanostructures. These efforts used a grid
network model (i.e. viewing of each point on the thin film as an intersection point of a grid) via Monte Carlo simulation methods to study the shadowing and re-emission effects in the growth. These effects are crucial in understanding the relationships between growth dynamics and the resulting structural properties of the film to be grown. In this dissertation, we use a cluster-based
network model with Monte Carlo simulation method to study these effects in thin film growth. We use image processing to identify clusters of points on the film and establish a
network model of these clusters. Monte Carlo simulations are used to grow films and dynamically track the trajectories of re-emitted particles. We treat the points on the film substrate and cluster formations from the deposition of adatoms / particles on the surface of the substrate as the nodes of
network, and movement of particles between these points or clusters as the traffic of the
network. Then, graph theory is used to study various
network statistics and characteristics that would explain various important phenomena in the thin film growth. We compare the cluster-based results with the grid-based results to determine which method is better suited to study the underlying characteristics of the thin film. Based on the clusters and the points on the substrate, we also develop a
network traffic model to study the characteristics and phenomena like fractal behavior in the count and inter-arrival time of the particles. Our results show that the
network theory of the growth process explains some of the underlying phenomena in film growth better than the existing theoretical and statistical models.
Advisors/Committee Members: Yuksel, Murat (advisor), Bebis, George (committee member), Dascalu, Sergiu (committee member), Gunes, Mehmet (committee member), Chandra, Dhanesh (committee member).
Subjects/Keywords: Complex Networks; Network Science; Network Traffic; Thin Film Growth
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):
Badepalli, S. (2017). Network Behavior in Thin Film Growth Dynamics. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2029
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):
Badepalli, Satish. “Network Behavior in Thin Film Growth Dynamics.” 2017. Thesis, University of Nevada – Reno. Accessed January 15, 2021.
http://hdl.handle.net/11714/2029.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Badepalli, Satish. “Network Behavior in Thin Film Growth Dynamics.” 2017. Web. 15 Jan 2021.
Vancouver:
Badepalli S. Network Behavior in Thin Film Growth Dynamics. [Internet] [Thesis]. University of Nevada – Reno; 2017. [cited 2021 Jan 15].
Available from: http://hdl.handle.net/11714/2029.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Badepalli S. Network Behavior in Thin Film Growth Dynamics. [Thesis]. University of Nevada – Reno; 2017. Available from: http://hdl.handle.net/11714/2029
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Arizona State University
29.
Stall Rechia, Felipe.
An Evaluation of SDN Based Network Virtualization
Techniques.
Degree: Engineering, 2016, Arizona State University
URL: http://repository.asu.edu/items/38629
► With the software-defined networking trend growing, several network virtualization controllers have been developed in recent years. These controllers, also called network hypervisors, attempt to manage…
(more)
▼ With the software-defined networking trend growing,
several network virtualization controllers have been developed in
recent years. These controllers, also called network hypervisors,
attempt to manage physical SDN based networks so that multiple
tenants can safely share the same forwarding plane hardware without
risk of being affected by or affecting other tenants. However, many
areas remain unexplored by current network hypervisor
implementations. This thesis presents and evaluates some of the
features offered by network hypervisors, such as full header space
availability, isolation, and transparent traffic forwarding
capabilities for tenants. Flow setup time and throughput are also
measured and compared among different network hypervisors. Three
different network hypervisors are evaluated: FlowVisor, VeRTIGO and
OpenVirteX. These virtualization tools are assessed with
experiments conducted on three different testbeds: an emulated
Mininet scenario, a physical single-switch testbed, and also a
remote GENI testbed. The results indicate that network hypervisors
bring SDN flexibility to network virtualization, making it easier
for network administrators to define with precision how the network
is sliced and divided among tenants. This increased flexibility,
however, may come with the cost of decreased performance, and also
brings additional risks of interoperability due to a lack of
standardization of virtualization methods.
Subjects/Keywords: Computer engineering; Computer science; network hypervisor; network virtualization; OpenFlow; SDN
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):
Stall Rechia, F. (2016). An Evaluation of SDN Based Network Virtualization
Techniques. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/38629
Chicago Manual of Style (16th Edition):
Stall Rechia, Felipe. “An Evaluation of SDN Based Network Virtualization
Techniques.” 2016. Masters Thesis, Arizona State University. Accessed January 15, 2021.
http://repository.asu.edu/items/38629.
MLA Handbook (7th Edition):
Stall Rechia, Felipe. “An Evaluation of SDN Based Network Virtualization
Techniques.” 2016. Web. 15 Jan 2021.
Vancouver:
Stall Rechia F. An Evaluation of SDN Based Network Virtualization
Techniques. [Internet] [Masters thesis]. Arizona State University; 2016. [cited 2021 Jan 15].
Available from: http://repository.asu.edu/items/38629.
Council of Science Editors:
Stall Rechia F. An Evaluation of SDN Based Network Virtualization
Techniques. [Masters Thesis]. Arizona State University; 2016. Available from: http://repository.asu.edu/items/38629
Penn State University
30.
Chonde, Seifu John.
A Methodology of Machine Learning in Automated Entity Summarization.
Degree: 2016, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/28739
► Conducting background research is a time consuming, yet important, part of every research endeavor. It includes compiling relevant sources, reading those sources, and comprehending the…
(more)
▼ Conducting background research is a time consuming, yet important, part of every research endeavor. It includes compiling relevant sources, reading those sources, and comprehending the information. We find that this information scales rapidly in the current information age. The use of automated text summarization, among other techniques (e.g., search engines), helps to improve efficiency in exploring data by distilling large amounts of information that is becoming prevalent.
For the purpose of summarizing entity and topic interaction in large information stores, in this dissertation a methodology of automatic entity summarization is presented. The methodology is broken into three steps: Reading, Assembly, and Interpretation. In the Reading step, the appropriate information sources are determined and, subsequently, the interrelated entities are extracted within each source. Four inputs are necessary in this step: a topic extraction algorithm, a named entity recognition algorithm, information sources, and property information for the entities. In the Assembly step, the relationships between entities across sources is represented through knowledge networks. A trimodal weighted co-occurrence hypergraph is presented and then projected into unimodal and bimodal graphs. Finally, in the Interpretation step, graph analytics are presented to summarize the graphs. A novel diversity heuristic is derived based on information entropy to compare information diversity in different streams of literature over time.
To test the methodology, three experiments were conducted. Data from the PubMed Central Open Access Subset, which consisted of 740,418 journal citations in 4,404 journals, was downloaded on July 14, 2014. The first experiment addressed the relationship between the size of the information
network and the number of files input into the methodology. It was found that a power law relationship exists, as shown in linguistic theory. The second experiment addressed the validity of the methodology in extracting meaningful connections and predicting the top chemicals using two gold standards. Results indicate that the methodology can be used to determine the top chemicals and that meaningful connections are those with the highest weight in the
network. Finally, the diversity heuristic was used in the third experiment to empirically compare the diversity of information in a stream of articles relating to honeybee research to the diversity of information in a stream of articles relating to diabetes research. It was seen that the existing heuristic provides quite noisy results when applied to information networks and that the new heuristic has better asymptotic properties. This research is among the first efforts towards building improved literature-based discovery algorithms that are capable of automating the hypothesis generation process in large literature sets.
Advisors/Committee Members: Soundar Kumara, Dissertation Advisor/Co-Advisor, Karl Todd Mueller, Committee Member, Joey W Storer, Special Member, Conrad S Tucker, Committee Member, Paul M, Griffin, Committee Member, Vasant Gajanan Honavar, Committee Member.
Subjects/Keywords: text mining; network science; diversity; science of science; entity summarization
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):
Chonde, S. J. (2016). A Methodology of Machine Learning in Automated Entity Summarization. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/28739
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):
Chonde, Seifu John. “A Methodology of Machine Learning in Automated Entity Summarization.” 2016. Thesis, Penn State University. Accessed January 15, 2021.
https://submit-etda.libraries.psu.edu/catalog/28739.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chonde, Seifu John. “A Methodology of Machine Learning in Automated Entity Summarization.” 2016. Web. 15 Jan 2021.
Vancouver:
Chonde SJ. A Methodology of Machine Learning in Automated Entity Summarization. [Internet] [Thesis]. Penn State University; 2016. [cited 2021 Jan 15].
Available from: https://submit-etda.libraries.psu.edu/catalog/28739.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chonde SJ. A Methodology of Machine Learning in Automated Entity Summarization. [Thesis]. Penn State University; 2016. Available from: https://submit-etda.libraries.psu.edu/catalog/28739
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [52] ▶
. 
Open Access Theses and Dissertations
