You searched for subject:(Dynamic network)
.
Showing records 1 – 30 of
449 total matches.
◁ [1] [2] [3] [4] [5] … [15] ▶

University of Technology, Sydney
1.
Patel, M.
A probabilistic model for assistive robotics devices to support activities of daily living.
Degree: 2014, University of Technology, Sydney
URL: http://hdl.handle.net/10453/29215
► This thesis explores probabilistic techniques to model interactions between humans and robotic devices. The work is motivated by the rapid increase in the ageing population…
(more)
▼ This thesis explores probabilistic techniques to model interactions between humans and robotic devices. The work is motivated by the rapid increase in the ageing population and the role that assistive robotic devices can play in maintaining independence and quality of life as assistants and/or companions for these communities. While there are substantial social and ethical implications in this pursuit, it is advocated that robotic systems are bound to acquire more sophisticated assistive capabilities if they are to operate in unstructured, dynamic, human-centred environments, responsive to the needs of their human operators. Such cognitive assistive systems postulate advances along the complete processing pipeline, from sensing, to anticipating user actions and environmental changes, and to delivering natural supportive actuation. Within the boundaries of the human-robot interaction context, it can be expected that acute awareness of human intentions plays a key role in delivering practical assistive actions. This work is thereby focused on the human behaviours likely to result from merging sensed human-robot interactions and the learning gained from past experiences, proposing a framework that facilitates the path towards integrating tightly knit human-robot interaction models.
Human behaviour is complex in nature and interactions with the environment and other objects occur in different and unpredictable ways. Moreover, observed sensory data is often incomplete and noisy. Inferring human intention is thus a challenging problem. This work defends the thesis that in many real-world scenarios these complex behaviours can be naturally simplified by decomposing them into smaller activities, so that their temporal dependencies can be learned more efficiently with the aid of probabilistic hierarchical models. To that end, a strategy is devised in the first part of the thesis to efficiently represent human Activities of Daily Living, or ADLs, by decomposing them into a flexible semantic structure of “Action Primitives” (APs), atomic actions which are proven able to encapsulate complex activities when combined within a temporal probabilistic framework at multiple levels of abstraction. A Hierarchical Hidden Markov Model (HHMM) is proposed as a powerful tool capable of modelling and learning these complex and uncertain human behaviours using knowledge gained from past interactions.
The ADLs performed by humans consist of a variety of complex locomotion-related tasks, as well as activities that involve grasping and manipulation of objects used in everyday life. Two widely used devices that provide assistance to users with mobility impairments while carrying out their ADLs, a power walker and a robotic wheelchair, are instrumented and used to model patterns of navigational activities (i.e. visiting location of interest), as well as some additional platform-specific support activities (e.g. standing up using the support of assistive walker). Human indications while performing these activities are captured using low-level…
Subjects/Keywords: Assistive robotics.; Dynamic Bayesian 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):
Patel, M. (2014). A probabilistic model for assistive robotics devices to support activities of daily living. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/29215
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):
Patel, M. “A probabilistic model for assistive robotics devices to support activities of daily living.” 2014. Thesis, University of Technology, Sydney. Accessed December 13, 2019.
http://hdl.handle.net/10453/29215.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Patel, M. “A probabilistic model for assistive robotics devices to support activities of daily living.” 2014. Web. 13 Dec 2019.
Vancouver:
Patel M. A probabilistic model for assistive robotics devices to support activities of daily living. [Internet] [Thesis]. University of Technology, Sydney; 2014. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10453/29215.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Patel M. A probabilistic model for assistive robotics devices to support activities of daily living. [Thesis]. University of Technology, Sydney; 2014. Available from: http://hdl.handle.net/10453/29215
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Saskatchewan
2.
Hashemian, Mohammad Seyed.
Human dynamic networks in opportunistic routing and epidemiology.
Degree: 2011, University of Saskatchewan
URL: http://hdl.handle.net/10388/etd-03092011-110140
► Measuring human behavioral patterns has broad application across different sciences. An individual’s social, proximal and geographical contact patterns can have significant importance in Delay Tolerant…
(more)
▼ Measuring human behavioral patterns has broad application across different sciences. An individual’s social, proximal and geographical contact patterns can have significant importance in Delay Tolerant Networking (DTN) and epidemiological modeling. Recent advances in computer science have not only provided the opportunity to record these behaviors with considerably higher temporal resolution and phenomenological accuracy, but also made it possible to record specific aspects of the behaviors which have been previously difficult to measure.
This thesis presents a data collection system using tiny sensors which is capable of recording humans’ proximal contacts and their visiting pattern to a set of geographical locations. The system also collects information on participants’ health status using weekly surveys. The system is tested on a population of 36 participants and 11 high-traffic public places. The resulting dataset offers rich information on human proximal and geographic contact patterns cross-linked with their health information.
In addition to the basic analysis of the dataset, the collected data is applied to two different applications. In DTNs the dataset is used to study the importance of public places as relay nodes, and described an algorithm that takes advantage of stationary nodes to improve routing performance and load balancing in the
network. In epidemiological modeling, the collected dataset is combined with data on H1N1 infection spread over the same time period and designed a model on H1N1 pathogen transmission based on these data. Using the collected high-resolution contact data as the model’s contact patterns, this work represents the importance of contact density in addition to contact diversity in infection transmission rate. It also shows that the
network measurements which are tied to contact duration are more representative of the relation between centrality of a person and their chance of contracting the infection.
Advisors/Committee Members: Stanley, Kevin G., Waldner, Cheryl, Eager, Derek, Osgood, Nathaniel D..
Subjects/Keywords: Human dynamic network; epidemiology; networking
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):
Hashemian, M. S. (2011). Human dynamic networks in opportunistic routing and epidemiology. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-03092011-110140
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):
Hashemian, Mohammad Seyed. “Human dynamic networks in opportunistic routing and epidemiology.” 2011. Thesis, University of Saskatchewan. Accessed December 13, 2019.
http://hdl.handle.net/10388/etd-03092011-110140.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hashemian, Mohammad Seyed. “Human dynamic networks in opportunistic routing and epidemiology.” 2011. Web. 13 Dec 2019.
Vancouver:
Hashemian MS. Human dynamic networks in opportunistic routing and epidemiology. [Internet] [Thesis]. University of Saskatchewan; 2011. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10388/etd-03092011-110140.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hashemian MS. Human dynamic networks in opportunistic routing and epidemiology. [Thesis]. University of Saskatchewan; 2011. Available from: http://hdl.handle.net/10388/etd-03092011-110140
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo
3.
Tracey, Justin.
Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs.
Degree: 2017, University of Waterloo
URL: http://hdl.handle.net/10012/12602
► Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacy-conscious individuals to provide low-latency private access to…
(more)
▼ Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacy-conscious individuals to provide low-latency private access to the Internet. However, Tor’s specific design and implementation is constantly changing to improve the performance and privacy properties it seeks to provide. To test these improvements, some form of experimentation is needed. Running experiments directly on the real Tor network is often not a viable option. The users of Tor are using it presumably because of its privacy protections, and caution must be taken to avoid recording or revealing information from non-consenting parties, particularly when dealing with shortcomings in Tor’s privacy protections or using new, untested versions of Tor. Because of the need for reproducible experiments and the aforementioned ethical requirements surrounding Tor experimentation, it is often necessary to use artificially constructed Tor networks.
Several tools are available to construct such networks, such as network emulators like NetMirage, and simulators like Shadow. However, these existing tools do not provide the scalability that would be desirable when running experiments on these networks — with emulators requiring hardware capable of running all hosts in real time simultaneously, and with Shadow (the only maintained network simulator capable of running Tor code) having performance constrained by early design decisions. Since the behavior of a network can change with its size, it is better to use larger networks that more closely resemble the size of the real deployed network. Additionally, the ability to test the functional correctness of a modification to the Tor source code is considerably simpler when there is a means of quickly experimenting on a virtual Tor network to run such tests.
In both of these cases, a higher-performance testing platform is needed. To address this shortcoming, for this thesis we designed and implemented a new model of Tor network simulation, centered around a modified version of the Shadow network simulator, using large numbers of dynamically loaded binaries. This is accomplished by implementing a custom dynamic loader, which we call drow-loader, that allows for dynamically loading more binaries than any other dynamic loader that we are aware of, and with better performance. By using the features of this dynamic loader, we are able to run simulated processes isolated in “namespaces”. This allows for reduced lock contention, simpler process modeling, and the ability to migrate simulated processes between worker threads. Using simulated Tor networks ranging from hundreds to tens of thousands of hosts, we then demonstrate the performance improvements our simulation technique provides over the state of the art.
Subjects/Keywords: Tor; Network Simulation; dynamic loading
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):
Tracey, J. (2017). Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12602
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):
Tracey, Justin. “Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs.” 2017. Thesis, University of Waterloo. Accessed December 13, 2019.
http://hdl.handle.net/10012/12602.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tracey, Justin. “Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs.” 2017. Web. 13 Dec 2019.
Vancouver:
Tracey J. Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10012/12602.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tracey J. Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12602
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa
4.
Zhou, Yang.
Video Super-Resolution via Dynamic Local Filter Network
.
Degree: 2018, University of Ottawa
URL: http://hdl.handle.net/10393/37939
► Video super-resolution (VSR) aims to give a satisfying estimation of a high-resolution (HR) image from multiple similar low-resolution (LR) images by exploiting their hidden redundancy.…
(more)
▼ Video super-resolution (VSR) aims to give a satisfying estimation of a high-resolution (HR) image from multiple similar low-resolution (LR) images by exploiting their hidden redundancy. The rapid development of convolutional neural network (CNN) techniques provide numerous new possibilities to solve the VSR problem. Recent VSR methods combine CNN with motion compensation to cancel the inconsistencies among the LR images and merge them to an HR images. To compensate the motion, pixels in input frames are warped according to optical-flow-like information. In this procedure, trade-off has to be made between the distraction caused by spatio-temporal inconsistencies and the pixel-wise detail damage caused by the compensation.
We proposed a novel VSR method with the name, Video Super-Resolution via Dynamic Local Filter Network, and its upgraded edition, Video Super-Resolution with Compensation in Feature Extraction.
Both methods perform motion compensation via a dynamic local filter network, which processes the input images with dynamically generated filter kernels. These kernels are sample-specific and position-specific. Therefore, our proposed methods can eliminate the inter-frame differences during feature extractions without explicitly manipulating pixels. The experimental results demonstrate that our methods outperform the state-of-the-art VSR algorithms in terms of PSNR and SSIM and recover more details with superior visual quality.
Subjects/Keywords: super-resolution;
neural network;
dynamic filter 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):
Zhou, Y. (2018). Video Super-Resolution via Dynamic Local Filter Network
. (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/37939
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):
Zhou, Yang. “Video Super-Resolution via Dynamic Local Filter Network
.” 2018. Thesis, University of Ottawa. Accessed December 13, 2019.
http://hdl.handle.net/10393/37939.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhou, Yang. “Video Super-Resolution via Dynamic Local Filter Network
.” 2018. Web. 13 Dec 2019.
Vancouver:
Zhou Y. Video Super-Resolution via Dynamic Local Filter Network
. [Internet] [Thesis]. University of Ottawa; 2018. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10393/37939.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhou Y. Video Super-Resolution via Dynamic Local Filter Network
. [Thesis]. University of Ottawa; 2018. Available from: http://hdl.handle.net/10393/37939
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University
5.
Barua, Shubharthi.
Dynamic Operational Risk Assessment with Bayesian Network.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573
► Oil/gas and petrochemical plants are complicated and dynamic in nature. Dynamic characteristics include ageing of equipment/components, season changes, stochastic processes, operator response times, inspection and…
(more)
▼ Oil/gas and petrochemical plants are complicated and
dynamic in nature.
Dynamic characteristics include ageing of equipment/components, season changes, stochastic processes, operator response times, inspection and testing time intervals, sequential dependencies of equipment/components and timing of safety system operations, all of which are time dependent criteria that can influence
dynamic processes. The conventional risk assessment methodologies can quantify
dynamic changes in processes with limited capacity. Therefore, it is important to develop method that can address time-dependent effects. The primary objective of this study is to propose a risk assessment methodology for
dynamic systems. In this study, a new technique for
dynamic operational risk assessment is developed based on the Bayesian networks, a structure optimal suitable to organize cause-effect relations. The Bayesian
network graphically describes the dependencies of variables and the
dynamic Bayesian
network capture change of variables over time. This study proposes to develop
dynamic fault tree for a chemical process system/sub-system and then to map it in Bayesian
network so that the developed method can capture
dynamic operational changes in process due to sequential dependency of one equipment/component on others. The developed Bayesian
network is then extended to the
dynamic Bayesian
network to demonstrate
dynamic operational risk assessment. A case study on a holdup tank problem is provided to illustrate the application of the method. A dryout scenario in the tank is quantified. It has been observed that the developed method is able to provide updated probability different equipment/component failure with time incorporating the sequential dependencies of event occurrence. Another objective of this study is to show parallelism of Bayesian
network with other available risk assessment methods such as event tree, HAZOP, FMEA. In this research, an event tree mapping procedure in Bayesian
network is described. A case study on a chemical reactor system is provided to illustrate the mapping procedure and to identify factors that have significant influence on an event occurrence. Therefore, this study provides a method for
dynamic operational risk assessment capable of providing updated probability of event occurrences considering sequential dependencies with time and a model for mapping event tree in Bayesian
network.
Advisors/Committee Members: Mannan, M.Sam (advisor), Laird, Carl D. (committee member), Wortman, Martin A. (committee member).
Subjects/Keywords: Bayesian network; dynamic Bayesian network; dynamic operational risk assessment
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):
Barua, S. (2012). Dynamic Operational Risk Assessment with Bayesian Network. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573
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):
Barua, Shubharthi. “Dynamic Operational Risk Assessment with Bayesian Network.” 2012. Thesis, Texas A&M University. Accessed December 13, 2019.
http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Barua, Shubharthi. “Dynamic Operational Risk Assessment with Bayesian Network.” 2012. Web. 13 Dec 2019.
Vancouver:
Barua S. Dynamic Operational Risk Assessment with Bayesian Network. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Barua S. Dynamic Operational Risk Assessment with Bayesian Network. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Oklahoma State University
6.
Regmi, Manish.
Tinyhive: Dynamic Virtual Machine For Sensor Networks.
Degree: Computer Science Department, 2009, Oklahoma State University
URL: http://hdl.handle.net/11244/8233
► Virtual machines are becoming a popular area of research. One of the most important benefits from virtual machine is flexibility for redeployment. Though, this flexibility…
(more)
▼ Virtual machines are becoming a popular area of research. One of the most important benefits from virtual machine is flexibility for redeployment. Though, this flexibility comes at a cost of slightly slow code. So far researchers have tried to create a static virtual machine. But they all have a common problem, dynamicity. This project creates a
dynamic virtual machine called TinyHive. It enables the user to define his instruction and its handler. The user can write the handler according to the needs of his application. The handler is written in a native code executed by the underlying micro-controller. This makes the virtual machine very
dynamic. Through the use of test cases, we show that TinyHive can enable a virtual application to achieve which was not possible in traditional virtual machines. The user can define his instruction and its handler extending the scope of a virtual machine application. The study also shows that it is much cheaper power wise to write a handler in program memory than other systems like deluge. Thus TinyHive virtual machine can be used to create an application which is more
dynamic and flexible than other virtual applications.
Advisors/Committee Members: Li, Xiaolin (advisor), Thomas, Johnson (committee member), Kak, Subhash C. (committee member).
Subjects/Keywords: dynamic sensor network; dynamic virtual machine; sensor network; virtual machine
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):
Regmi, M. (2009). Tinyhive: Dynamic Virtual Machine For Sensor Networks. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/8233
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):
Regmi, Manish. “Tinyhive: Dynamic Virtual Machine For Sensor Networks.” 2009. Thesis, Oklahoma State University. Accessed December 13, 2019.
http://hdl.handle.net/11244/8233.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Regmi, Manish. “Tinyhive: Dynamic Virtual Machine For Sensor Networks.” 2009. Web. 13 Dec 2019.
Vancouver:
Regmi M. Tinyhive: Dynamic Virtual Machine For Sensor Networks. [Internet] [Thesis]. Oklahoma State University; 2009. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/11244/8233.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Regmi M. Tinyhive: Dynamic Virtual Machine For Sensor Networks. [Thesis]. Oklahoma State University; 2009. Available from: http://hdl.handle.net/11244/8233
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

IUPUI
7.
Bhamidi, Sree Bala Shruthi.
Residual Capsule Network.
Degree: 2019, IUPUI
URL: http://hdl.handle.net/1805/19902
► Indiana University-Purdue University Indianapolis (IUPUI)
The Convolutional Neural Network (CNN) have shown a substantial improvement in the field of Machine Learning. But they do come…
(more)
▼ Indiana University-Purdue University Indianapolis (IUPUI)
The Convolutional Neural Network (CNN) have shown a substantial improvement in the field of Machine Learning. But they do come with their own set of drawbacks. Capsule Networks have addressed the limitations of CNNs and have shown a great improvement by calculating the pose and transformation of the image. Deeper networks are more powerful than shallow networks but at the same time, more difficult to train. Residual Networks ease the training and have shown evidence that they can give good accuracy with considerable depth. Putting the best of Capsule Network and Residual Network together, we present Residual Capsule Network and 3-Level Residual Capsule Network, a framework that uses the best of Residual Networks and Capsule Networks. The conventional Convolutional layer in Capsule Network is replaced by skip connections like the Residual Networks to decrease the complexity of the Baseline Capsule Network and seven ensemble Capsule Network. We trained our models on MNIST and CIFAR-10 datasets and have seen a significant decrease in the number of parameters when compared to the Baseline models.
Advisors/Committee Members: El-Sharkawy, Mohamed, King, Brian, Rizkalla, Maher.
Subjects/Keywords: Residual Network; Capsule Network; Dynamic Routing; Image Classification; Neural 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):
Bhamidi, S. B. S. (2019). Residual Capsule Network. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/19902
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):
Bhamidi, Sree Bala Shruthi. “Residual Capsule Network.” 2019. Thesis, IUPUI. Accessed December 13, 2019.
http://hdl.handle.net/1805/19902.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Bhamidi, Sree Bala Shruthi. “Residual Capsule Network.” 2019. Web. 13 Dec 2019.
Vancouver:
Bhamidi SBS. Residual Capsule Network. [Internet] [Thesis]. IUPUI; 2019. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1805/19902.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Bhamidi SBS. Residual Capsule Network. [Thesis]. IUPUI; 2019. Available from: http://hdl.handle.net/1805/19902
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University
8.
Kim, So Hee.
POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY.
Degree: PhD, Public Administration, 2016, Penn State University
URL: https://etda.libraries.psu.edu/catalog/mc87pq24j
► In policy processes large numbers of actors who hold various forms of scientific and technical information, beliefs, and values interact with each other in political…
(more)
▼ In policy processes large numbers of actors who hold
various forms of scientific and technical information, beliefs, and
values interact with each other in political and institutional
contexts. The purpose of this study is to investigate the complex
policy processes in the health policy area in Illinois, using two
theoretical lenses: the policy network theory (PNT) and the
advocacy coalition framework (ACF). The PNT helps us understand the
complex networked relationships among the actors of public policy
processes. The ACF helps us explore more specifically the belief
systems of network actors and the roles such beliefs play in policy
network formation and policy change. Using the PNT and the ACF
frameworks, in this dissertation I examined the policy network
characteristics and policy changes in the case of the State
Children’s Health Insurance Program (SCHIP) in Illinois from 1997
to 2007. In my study I used AutoMap, a network analyses tool, and
ORA, a dynamic network analysis tool. Using this combination of
methods, I extracted meta-networks from the newspaper articles on
the SCHIP process in Illinois and analyzed them to identify the
policy networks and subnetworks (subgroups) and the values attached
to these subgroups. I first discuss the background of the Illinois
SCHIP policy process and the theoretical frameworks I applied in my
study (PNT and ACF). After describing and discussing the analytical
tools I used (AutoMap and ORA), I present the findings on the
structural characteristics of policy networks in the Illinois SCHIP
policy process. Next I present the results of a series of cluster
analyses, which revealed the groups of actors who formed the
advocacy policy coalitions, and compare these results with the
predictions of the ACF. I found that in the SCHIP Illinois case and
in the period I studied the predictions of ACF were only partially
confirmed: I could identify some pro- and against- policy
coalitions, but their membership or the values attached to them
were not consistent between 1997 and 2007. Instead, ORA identified
the clusters of networks (subnetworks) of policy actors and their
beliefs. I conclude that in interpreting the findings it is better
to use the relatively broader term of “policy issue networks” or
“policy issue coalitions,” instead of the ACF’s more specific term
of “advocacy coalitions.” My dissertation makes a contribution to
the policy literature by introducing innovative methods of network
text analysis (AutoMap) and dynamic network analysis (ORA) to
identify policy networks and subnetworks in texts. It also makes a
contribution by presenting an understanding of the interplay
between key policy actors and their beliefs and network
characteristics. The methods applied in this dissertation may be
used in future studies on policy processes and the findings may be
compared with those of future studies to gain a better
understanding of policy networks.
Subjects/Keywords: policy network theory; advocacy coalition framework; issue
network; SCHIP; dynamic network analysis; network text
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):
Kim, S. H. (2016). POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/mc87pq24j
Chicago Manual of Style (16th Edition):
Kim, So Hee. “POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY.” 2016. Doctoral Dissertation, Penn State University. Accessed December 13, 2019.
https://etda.libraries.psu.edu/catalog/mc87pq24j.
MLA Handbook (7th Edition):
Kim, So Hee. “POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY.” 2016. Web. 13 Dec 2019.
Vancouver:
Kim SH. POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2019 Dec 13].
Available from: https://etda.libraries.psu.edu/catalog/mc87pq24j.
Council of Science Editors:
Kim SH. POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH
INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE
STUDY. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/mc87pq24j

Addis Ababa University
9.
HAILAY, WELDEGEBRIEL.
DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
.
Degree: 2012, Addis Ababa University
URL: http://etd.aau.edu.et/dspace/handle/123456789/2828
► Enterprise or campus networks usually impose a set of rules for users to access the network in order to protect network resources and enforce institutional…
(more)
▼ Enterprise or campus networks usually impose a set of rules for users to access the
network in order to protect
network resources and enforce institutional policies (for instance, no sharing of music files or no gaming). This leaves
network administrators with the daunting task of identifying the application associated with a traffic flow as early as possible and controlling user’s traffic when needed. Therefore, accurate and early
network traffic analysis is an essential step for administrators to detect intrusion, malicious attacks, or forbidden applications. Hence, bandwidth management based on
network traffic flow analysis is a researchable area which gives the owner of the research with lots of opportunity to assess the
network behaviors. In this work protocol distribution and
network traffic load analysis are conducted on different links based on real data. Besides, it is tried to assess the potential application of ntop for measuring the global protocol distribution based on the real data. Moreover, the ingoing and outgoing traffic load is analyzed using MRTG which is a versatile tool for graphing
network data and it can run on a Web server. Every five minutes, it reads the inbound and outbound octet counter of the gateway router, and then logs the data to generate daily, weekly, monthly and yearly graphs for web pages. Weblog analysis consists in measuring the usage of relevant traffic activities. Weblog expert tracks web server log file, generating a series of statistics for each host, for operating system, for each browser, for each visitor and soon in the Mekele University (MU) inter campus
network as a whole. Based on the traffic analysis at different links and web server of MU, a
dynamic bandwidth allocator algorithm is proposed which consists of modules such as administration tool, which provides a graphical interface for configuring bandwidth allocation based on the different bandwidth demand in the intercampus
network; policy agent, which implements the configuration and handles communication with the kernel module; kernel module, which implements the packet classifier, packet selector, bandwidth estimator, unique IP address counter, Host DBA and timer.
Advisors/Committee Members: Workshet Lamenew (advisor).
Subjects/Keywords: network traffic; Dynamic Bandwidth Allocation; Bandwidth Management
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
HAILAY, W. (2012). DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
. (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/2828
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):
HAILAY, WELDEGEBRIEL. “DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
.” 2012. Thesis, Addis Ababa University. Accessed December 13, 2019.
http://etd.aau.edu.et/dspace/handle/123456789/2828.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
HAILAY, WELDEGEBRIEL. “DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
.” 2012. Web. 13 Dec 2019.
Vancouver:
HAILAY W. DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
. [Internet] [Thesis]. Addis Ababa University; 2012. [cited 2019 Dec 13].
Available from: http://etd.aau.edu.et/dspace/handle/123456789/2828.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
HAILAY W. DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS
. [Thesis]. Addis Ababa University; 2012. Available from: http://etd.aau.edu.et/dspace/handle/123456789/2828
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
10.
Oliveira, Luciana Pereira.
Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
.
Degree: 2008, Universidade Federal de Pernambuco
URL: http://repositorio.ufpe.br/handle/123456789/1708
► Diversos trabalhos na área de redes dinâmicas têm sido propostos na literatura com o objetivo de prover à arquitetura da Internet o suporte à mobilidade.…
(more)
▼ Diversos trabalhos na área de redes dinâmicas têm sido propostos na literatura
com o objetivo de prover à arquitetura da Internet o suporte à mobilidade. O problema
dessas redes instáveis na Internet consiste em oferecer um conjunto de mecanismo, tais
como endereçamento, gerenciamento da informação e encaminhamento da informação,
que suportem informação e entidade (Sistema Autônomo, Provedor de Serviços na
Internet e Clientes) móveis.
Nesse contexto, alguns trabalhos para arquitetura da Internet têm proposto uma
maneira de separar a localização (atualmente o IP) e o nome identificador, devido ao
forte relacionamento entre o IP e o nome. Em geral, eles propõem uma abordagem de
roteamento na camada overlay para separar essas informações. Outros trabalhos
acreditam que este desacoplamento não é suficiente para solucionar os problemas de
mobilidade, desde que a dinamicidade gera muitas mensagens de controle e atualizações
do vínculo entre o IP e o nome. Por essa razão, os pesquisadores também têm proposto
novos modelos para gerenciar a camada overlay.
Uma das contribuições deste trabalho é a proposta de uma solução para
arquitetura da Internet denominada Stable Society que adota a abordagem de papéis. Um
papel é uma unidade funcional que é utilizada para organizar a comunicação. Um
importante diferencial da proposta é que além de desvincular o nome e a localização, ela
também oferece soluções para os problemas relacionados a estruturação e manutenção
da camada overlay. Além disso, este trabalho define quatro papéis: o mensageiro
encaminha os dados dentro da sociedade; o guarda é a entidade mais estável para
encaminhar mensagens entre as sociedades; o operário armazena informações; e o líder
estrutura e gerencia a rede overlay.
Reduzindo o escopo para a implementação desta dissertação de mestrado, o
mensageiro e o guarda foram considerados como a camada de rede sem distinção de
estabilidade, desde que o fornecimento de um mecanismo de gerenciamento do overlay
de roteamento foi o objetivo do trabalho. Portanto, como prova do conceito apresentado
pela proposta, os líderes e operários foram implementados, porque eles agem de
maneira independente de tecnologia de acesso e são fundamentais para solucionar o
problema da instabilidade nos processos de armazenamento e descoberta da informação.
Como resultado, um novo algoritmo denominado Stable Society model over Distributes
Hash Table (SSDHT) foi proposto. Além disso, este algoritmo foi comparado com
outras soluções DHT (Chord). Os resultados mostraram que o SSDHT é um bom
algoritmo, principalmente quando se aumenta a instabilidade (carga do tráfego, grau de
mobilidade e tamanho da rede). Por exemplo, a taxa de mensagens entregue com
sucesso foi acima de 90% quando a carga de tráfego, o grau de mobilidade e o tamanho
da rede foram variados
Advisors/Committee Members: Sadok, Djamel Fawzi Hadj (advisor).
Subjects/Keywords: Internet Architecture;
Dynamic Network;
DHT Algorithms;
Overlay
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):
Oliveira, L. P. (2008). Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
. (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/1708
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):
Oliveira, Luciana Pereira. “Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
.” 2008. Thesis, Universidade Federal de Pernambuco. Accessed December 13, 2019.
http://repositorio.ufpe.br/handle/123456789/1708.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Oliveira, Luciana Pereira. “Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
.” 2008. Web. 13 Dec 2019.
Vancouver:
Oliveira LP. Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
. [Internet] [Thesis]. Universidade Federal de Pernambuco; 2008. [cited 2019 Dec 13].
Available from: http://repositorio.ufpe.br/handle/123456789/1708.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Oliveira LP. Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers
. [Thesis]. Universidade Federal de Pernambuco; 2008. Available from: http://repositorio.ufpe.br/handle/123456789/1708
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University
11.
Sun, Yuqi.
OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING.
Degree: PhD, Industrial Engineering, 2016, Penn State University
URL: https://etda.libraries.psu.edu/catalog/ng451h485
This dissertation introduces and discusses three
specific optimization problems and their applications in traffic
signal control and machine learning. We focus on proposing more
efficient algorithms to solve these optimization problems and
introducing their applications in real world.
Subjects/Keywords: optimization; dynamic network loading; machine
learning
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. (2016). OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/ng451h485
Chicago Manual of Style (16th Edition):
Sun, Yuqi. “OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING.” 2016. Doctoral Dissertation, Penn State University. Accessed December 13, 2019.
https://etda.libraries.psu.edu/catalog/ng451h485.
MLA Handbook (7th Edition):
Sun, Yuqi. “OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING.” 2016. Web. 13 Dec 2019.
Vancouver:
Sun Y. OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2019 Dec 13].
Available from: https://etda.libraries.psu.edu/catalog/ng451h485.
Council of Science Editors:
Sun Y. OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL
CONTROL AND MACHINE LEARNING. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/ng451h485

Virginia Tech
12.
Burns, Meghan Colleen.
Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks.
Degree: MS, Aerospace and Ocean Engineering, 2018, Virginia Tech
URL: http://hdl.handle.net/10919/83381
► This thesis compares three variations of the Bayesian network as an aid for decision-making using uncertain information. After reviewing the basic theory underlying probabilistic graphical…
(more)
▼ This thesis compares three variations of the Bayesian
network as an aid for decision-making using uncertain information. After reviewing the basic theory underlying probabilistic graphical models and Bayesian estimation, the thesis presents a user-defined static Bayesian
network, a static Bayesian
network in which the parameter values are learned from data, and a
dynamic Bayesian
network with learning. As a basis for the comparison, these models are used to provide a prior assessment of the safety of flight of a small unmanned aircraft, taking into consideration the state of the aircraft and weather. The results of the analysis indicate that the
dynamic Bayesian
network is more effective than the static networks at predicting safety of flight.
Advisors/Committee Members: Woolsey, Craig A. (committeechair), Patil, Mayuresh J. (committee member), Adams, Richard E. (committee member).
Subjects/Keywords: Dynamic Bayesian Network; Unmanned Aerial Systems; Risk
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):
Burns, M. C. (2018). Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/83381
Chicago Manual of Style (16th Edition):
Burns, Meghan Colleen. “Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks.” 2018. Masters Thesis, Virginia Tech. Accessed December 13, 2019.
http://hdl.handle.net/10919/83381.
MLA Handbook (7th Edition):
Burns, Meghan Colleen. “Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks.” 2018. Web. 13 Dec 2019.
Vancouver:
Burns MC. Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10919/83381.
Council of Science Editors:
Burns MC. Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/83381

University of Toronto
13.
Tran, Tony.
Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.
Degree: 2011, University of Toronto
URL: http://hdl.handle.net/1807/31609
► The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally…
(more)
▼ The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally concerned with complex combinatorial decisions for static problems, whereas queueing theory simplifies the combinatorics and focuses on dynamic systems. We examine a queueing network with flexible servers under queueing and scheduling techniques. Based on the strengths of queueing analysis and scheduling, we develop a hybrid model that guides scheduling with results from the queueing model.
In order to include setup times, we create a logic-based Benders decomposition model for a static representation of the queueing network. Our model is able to find optimal schedules up to 5 orders of magnitude faster than the only other model in the literature. A hybrid model is then developed for the dynamic problem and shown to achieve the best mean flow time while also guaranteeing maximal capacity.
MAST
Advisors/Committee Members: Beck, J. Christopher, Mechanical and Industrial Engineering.
Subjects/Keywords: Combinatorial Scheduling; Queueing Theory; Dynamic Network; 0546
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tran, T. (2011). Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31609
Chicago Manual of Style (16th Edition):
Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Masters Thesis, University of Toronto. Accessed December 13, 2019.
http://hdl.handle.net/1807/31609.
MLA Handbook (7th Edition):
Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Web. 13 Dec 2019.
Vancouver:
Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1807/31609.
Council of Science Editors:
Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31609

University of New South Wales
14.
Setiawan, Ridwan.
Plantwide dynamic operability analysis from network perspective.
Degree: Chemical Sciences & Engineering, 2012, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/51693
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true
► Increasing raw material and energy costs have caused a shift in process design philosophy for better use of energy integration and recycling resulting in growing…
(more)
▼ Increasing raw material and energy costs have caused a shift in process design philosophy for better use of energy integration and recycling resulting in growing appearances of more complex chemical plants which consist of many process units interconnected in various configurations. The unit interactions caused by these interconnections often impose limitations on the plantwide operability of chemical processes, commonly in the form of control performance degradation and operational instability in the worst case. Despite the importance of plantwide operability analysis, it is often difficult to perform such assessment at the earlier stages of process design because of the degree of complexity, interactions, and nonlinearity of the processes.This thesis provides a framework of
dynamic operability assessment for general nonlinear plantwide processes based on the concept of dissipative systems and
network perspective. An entire large-scale system is represented as a
network of smaller sub-systems and their interconnection topology can then be captured explicitly. A distinctive feature of the
network perspective lies in the distinction between the physical interconnections between different sub-systems and the signal interconnections between the physical process and its control system. Using the dissipativity of each sub-system and the process topology, the plantwide stability, stabilizability, and achievable control performance can then be assessed. The most significant contribution of the proposed approach is on the explicit analysis of interaction effects on plantwide operability.Furthermore, the resulting operability analysis problems involve linear matrix inequalities (LMIs) which are easy to solve and potentially scalable.Improvements to the above framework are also proposed to reduce the level of conservativeness of the general nonlinear approach and provide a more detailed operability analysis. By decomposing the large-scale system down to the storage level, with sub-systems represented by single state equations, the dissipativity can be determined more easily. The dissipativity property of the entire nonlinear plantwide process can also be parametrized by the dissipativity of individual sub-systems, leading to a cluster of supply rates, which in turn are optimized to achieve much less conservative operability analysis results. In addition, linearized models can be used to obtain more detailed
dynamic performance achievable, e.g., frequency domain performance indicators.
Advisors/Committee Members: Bao, Jie, Chemical Sciences & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Network perspective; Plantwide Operability; Controllability; Dynamic Operability
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):
Setiawan, R. (2012). Plantwide dynamic operability analysis from network perspective. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51693 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Setiawan, Ridwan. “Plantwide dynamic operability analysis from network perspective.” 2012. Doctoral Dissertation, University of New South Wales. Accessed December 13, 2019.
http://handle.unsw.edu.au/1959.4/51693 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true.
MLA Handbook (7th Edition):
Setiawan, Ridwan. “Plantwide dynamic operability analysis from network perspective.” 2012. Web. 13 Dec 2019.
Vancouver:
Setiawan R. Plantwide dynamic operability analysis from network perspective. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2019 Dec 13].
Available from: http://handle.unsw.edu.au/1959.4/51693 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true.
Council of Science Editors:
Setiawan R. Plantwide dynamic operability analysis from network perspective. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/51693 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true

University of Minnesota
15.
Ahmed, Rezwan.
Algorithms for mining evolving patterns in dynamic relational networks.
Degree: PhD, Computer Science, 2014, University of Minnesota
URL: http://hdl.handle.net/11299/167704
► Dynamic networks have recently being recognized as a powerful abstraction to model and represent the temporal changes and dynamic aspects of the data underlying many…
(more)
▼ Dynamic networks have recently being recognized as a powerful abstraction to model and represent the temporal changes and dynamic aspects of the data underlying many complex systems. This recognition has resulted in a burst of research activity related to modeling, analyzing, and understanding the properties, characteristics, and evolution of such dynamic networks. The focus of this growing research has been mainly defining important recurrent structural patterns and developing algorithms for their identification. Most of these tools are not designed to identify time-persistent relational patterns or do not focus on tracking the changes of these relational patterns over time. Analysis of temporal aspects of the entity relations in these networks can provide significant insight in determining the conserved relational patterns and the evolution of such patterns over time. Computational methods and tools that can efficiently and effectively analyze the changes in dynamic relational networks can substantially expand the types and diversity of dynamic networks that can be analyzed and the information that can be gained from such analysis. This may provide information on the recurrence and the stability of its relational patterns, help in the detection of abnormal patterns potentially indicating fraudulent or other malevolent behaviors, and improve the ability to predict the relations and their changes in these networks. In this dissertation we present new data mining methods for analyzing the temporal evolution of relations between entities of relational networks. Different classes of evolving relational patterns are introduced that are motivated by considering two distinct aspects of relational pattern evolution. The first is the notion of state transition and seeks to identify sets of entities whose time-persistent relations change over time and space. The second is the notion of coevolution and seeks to identify recurring sets of entities whose relations change in a consistent way over time and space. We first present a new class of patterns, referred as the evolving induced relational states (EIRS), which is designed to analyze the time-persistent relations or states between the entities of the dynamic networks. These patterns can help identify the transitions from one conserved state to the next and may provide evidence to the existence of external factors that are responsible for changing the stable relational patterns in these networks. We developed an algorithm to efficiently mine all maximal non-redundant evolution paths of the stable relational states of a dynamic network. Next we introduce a class of patterns, referred to as coevolving relational motifs (CRM), which is designed to identify recurring sets of entities whose relations change in a consistent way over time. CRMs can provide evidence to the existence of, possibly unknown, coordination mechanisms by identifying the relational motifs that evolve in a similar and highly conserved fashion. An algorithm is presented to efficiently analyze the frequent…
Subjects/Keywords: Dynamic network; Evolving patterns; Computer 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):
Ahmed, R. (2014). Algorithms for mining evolving patterns in dynamic relational networks. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/167704
Chicago Manual of Style (16th Edition):
Ahmed, Rezwan. “Algorithms for mining evolving patterns in dynamic relational networks.” 2014. Doctoral Dissertation, University of Minnesota. Accessed December 13, 2019.
http://hdl.handle.net/11299/167704.
MLA Handbook (7th Edition):
Ahmed, Rezwan. “Algorithms for mining evolving patterns in dynamic relational networks.” 2014. Web. 13 Dec 2019.
Vancouver:
Ahmed R. Algorithms for mining evolving patterns in dynamic relational networks. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/11299/167704.
Council of Science Editors:
Ahmed R. Algorithms for mining evolving patterns in dynamic relational networks. [Doctoral Dissertation]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/167704

Penn State University
16.
Luo, Rong.
Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing.
Degree: PhD, Economics, 2015, Penn State University
URL: https://etda.libraries.psu.edu/catalog/26256
► This dissertation includes three chapters on estimating structural economics models. My research focuses on empirically study consumers’ utility from different products, the impact of network…
(more)
▼ This dissertation includes three chapters on
estimating structural economics models. My research focuses on
empirically study consumers’ utility from different products, the
impact of network effects on consumers’ demand for products, and
multi-network firms’ dynamic pricing strategies. The three chapters
share the same feature of estimating a discrete choice demand
model, but differ in the static versus dynamic setting and the
underlying economics question and strategic behaviors that I’m
interested. Chapter 1 "The Operating System Network Effect and
Telecom Carriers’ Dynamic Pricing of Smartphones." The utility a
consumer realizes from owning a smartphone increases with its
operating system (OS) network size. Due to this OS network effect,
multi-network telecom carriers have a different pricing strategy
for smartphones than the single- network manufacturers in a dynamic
environment. While manufacturers choose higher prices for larger
networks, carriers, who can internalize competition across OSs,
have incentives to choose lower prices for larger networks. The
carriers’ pricing strategy contributes to the increasing smartphone
users and OS concentration. In this paper, I first analyze a
theoretical model to compare the pricing strategies of the carriers
and manufacturers. Then I design a structural model of consumers’
demand and the carriers’ dynamic pricing game for smartphones, and
empirically study the impact of the OS network effect and carriers’
two-year contract policy on the smartphone market penetration and
OS concentration. I estimate the model using product level data
from August 2011 to July 2013 in the US. I deal with the empirical
challenges of dynamic prices for multi-product carriers, high
dimension continuous state variables, and asymmetric oligopolistic
firms in the estimation. The results show that the OS network size
has a positive and significant impact on consumer utility. I then
study two counterfactual cases in which I eliminate the OS network
effect and the carriers’ pricing strategy, respectively. I find
that, without the OS network effect, the smartphone penetration
rate would decrease by 54.7% and the largest OS share difference
decrease by 31.7% by May 2013. Without the carriers’ pricing
strategy, the penetration rate would decrease by 29.1% and the OS
market share difference decrease by 11.2%. Chapter 2 "The Operating
System Network Effect and Consumers’ Dynamic Demand of Smartphones
with Two-Year Contracts." This paper studies consumers’ dynamic
demand of smartphones on two-year wireless contracts. Individuals’
demand decisions are affected by the improving quality and changing
prices of smartphones, and the OS network effect, and their current
smartphone contract status. Consumers need to pay high early
termination fees if they end active contracts. The dynamic demand
model in this paper incorporates the evolving choice set, prices,
endogenous OS network sizes, and the termination policies in the
smartphone industry. The preliminary results find that the OS
network effect is large and…
Subjects/Keywords: Network Effect; Static and Dynamic Discrete Choice; and
Dynamic Pricing
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):
Luo, R. (2015). Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/26256
Chicago Manual of Style (16th Edition):
Luo, Rong. “Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing.” 2015. Doctoral Dissertation, Penn State University. Accessed December 13, 2019.
https://etda.libraries.psu.edu/catalog/26256.
MLA Handbook (7th Edition):
Luo, Rong. “Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing.” 2015. Web. 13 Dec 2019.
Vancouver:
Luo R. Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing. [Internet] [Doctoral dissertation]. Penn State University; 2015. [cited 2019 Dec 13].
Available from: https://etda.libraries.psu.edu/catalog/26256.
Council of Science Editors:
Luo R. Essay on Network Effects, Consumer Demand, and Firms'
Dynamic Pricing. [Doctoral Dissertation]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/26256

University of Illinois – Chicago
17.
Tantipathananandh, Chayant.
Detecting and Tracking Communities in Social Networks.
Degree: 2013, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/10138
► Community detection is an important task in social network analysis. Social interactions exist within some social context and communities are a fundamental form of social…
(more)
▼ Community detection is an important task in social
network analysis. Social interactions exist within some social context and communities are a fundamental form of social contexts. Communities are intuitively characterized as “unusually densely knit” subsets of a social
network. This notation becomes more problematic if the social interactions change over time. The interplay between social interacts and social contexts are crucial to understand the evolution of networks. Thus, it is important to both detect communities and track their changes.
My contributions fall into two categories. First, I consider the problem of tracking communities over time, assuming that partitions into communities are already given for all snapshot graphs. The question is which community snapshot becomes which community snapshot at another point in time. My contributions to the first part are models and algorithms for tracking communities. I show a constant-factor approximation algorithm based on path cover, another algorithm based on a state-of-the-art approximation algorithm for the Correlation Clustering problem, and a fast heuristic algorithm which produces even better solutions in practice than the two prior algorithms. Tools developed for this task can be used for longitudinal social
network analysis, ecological inference, etc. Secondly, I consider the combined problem of detecting communities in
network snapshots and simultaneously tracking them. For this second part, I show an algorithm based on the state-of-the-art approximation algorithm, similar to the above. This gives the first algorithm for the
dynamic community detection problem which produces a numerical approximation guarantee of a solution.
Advisors/Committee Members: Berger-Wolf, Tanya (advisor).
Subjects/Keywords: algorithm; evolutionary clustering; clustering; dynamic community; dynamic 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):
Tantipathananandh, C. (2013). Detecting and Tracking Communities in Social Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/10138
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):
Tantipathananandh, Chayant. “Detecting and Tracking Communities in Social Networks.” 2013. Thesis, University of Illinois – Chicago. Accessed December 13, 2019.
http://hdl.handle.net/10027/10138.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tantipathananandh, Chayant. “Detecting and Tracking Communities in Social Networks.” 2013. Web. 13 Dec 2019.
Vancouver:
Tantipathananandh C. Detecting and Tracking Communities in Social Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10027/10138.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tantipathananandh C. Detecting and Tracking Communities in Social Networks. [Thesis]. University of Illinois – Chicago; 2013. Available from: http://hdl.handle.net/10027/10138
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Chicago
18.
Purgato, Andrea.
GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks.
Degree: 2016, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/21354
► The thesis is about a GPU-based computation used to defining the structure of a dynamic social or biological network. In particular the work is focused…
(more)
▼ The thesis is about a GPU-based computation used to defining the structure of a
dynamic social or biological
network. In particular the work is focused on brain networks computation, which is computationally expensive, with the aim to speed up the process by exploiting the computational power and the architecture of GPU. Using these fast GPU computation of the
network structure, the last part of the work is centered on an interactive visualization of the computed networks to allow a researcher to better understand
dynamic networks.
Advisors/Committee Members: Forbes, Angus (advisor).
Subjects/Keywords: GPU; Spatio-Temporal Network; Dynamic Network; High Performance Computation; Visualization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Purgato, A. (2016). GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21354
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):
Purgato, Andrea. “GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks.” 2016. Thesis, University of Illinois – Chicago. Accessed December 13, 2019.
http://hdl.handle.net/10027/21354.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Purgato, Andrea. “GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks.” 2016. Web. 13 Dec 2019.
Vancouver:
Purgato A. GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10027/21354.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Purgato A. GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21354
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

UCLA
19.
Chen, Chih-Kai.
Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems.
Degree: Electrical Engineering, 2012, UCLA
URL: http://www.escholarship.org/uc/item/1zh5j5f8
► Cognitive Radio Network (CRN) is an emerging technology to increase usages of the underutilized spectrum. Since cognitive radios (CR) join and leave CRN at will,…
(more)
▼ Cognitive Radio Network (CRN) is an emerging technology to increase usages of the underutilized spectrum. Since cognitive radios (CR) join and leave CRN at will, as a dynamic secondary overlay network operating in the dynamic scenarios, CRN faces many new practical challenges. Spectrum sensing is a key functionality enabling dynamic spectrum management. Distributed cooperative spectrum sensing can effectively overcome the hidden primary user issue. The performance of the distributed sensing scheme is affected by the number of collaborative CRs. In this dissertation, we analyze the performance of cooperative spectrum sensing for the dynamic CRN systems, which is a more realistic application scenario. Closed form exact expressions for the dynamic performance of distributed energy-based cooperative spectrum sensing over different fading channels are derived. These expressions enable the calculation of probability of detection and probability of false alarm efficiently tractable, and also provide a feasible approach for optimization of sensing performance. Quick performance evaluation is essential for CRN to achieve real-time adaptation to guarantee optimal system operations. We also study two promising applications for cognitive radio networks technologies: wireless cellular networks and public safety emergency networks. We analyze the performance of cooperative spectrum sensing in these two scenarios and the closed form expressions provide the framework to apply the cognitive radio networks technologies to perform online learning for self-organizing dynamic ad hoc cellular wireless system and public safety emergency networks system.
Subjects/Keywords: Electrical engineering; Cognitive Radio Network; Dynamic Network; Spectrum Sensing; Wireless Communications
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, C. (2012). Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/1zh5j5f8
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chen, Chih-Kai. “Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems.” 2012. Thesis, UCLA. Accessed December 13, 2019.
http://www.escholarship.org/uc/item/1zh5j5f8.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Chih-Kai. “Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems.” 2012. Web. 13 Dec 2019.
Vancouver:
Chen C. Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems. [Internet] [Thesis]. UCLA; 2012. [cited 2019 Dec 13].
Available from: http://www.escholarship.org/uc/item/1zh5j5f8.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chen C. Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/1zh5j5f8
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Washington
20.
Li, Ke.
Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis.
Degree: PhD, 2015, University of Washington
URL: http://hdl.handle.net/1773/34190
► We address three aspects of statistical methodology in the application of Exponential family Random Graphs to modeling social network processes. The first is the topic…
(more)
▼ We address three aspects of statistical methodology in the application of Exponential family Random Graphs to modeling social
network processes. The first is the topic of model degeneracy in ERGMs. We show this is a lack-of-fit problem – a function of both the model specification and the observed data – that can be diagnosed by exploiting the geometry of the model space. We propose new specifications based on nonlinear transformation of degenerate terms that are less vulnerable to degeneracy and retain the property of "locality" needed for interpretation. The second chapter focuses on methodology for estimating partnership duration models in the context of social
network dependence. We develop a statistical framework in which models with very different structures can be compared and evaluated. The third chapter presents a new ERGM-based framework for modeling the co-evolution of ties and vertex attributes (
dynamic selection-influence models). The model extends the separable temporal ERGMs developed by Krivitsky (2009), with a flexible framework for representing hypothesized social mechanisms, and a corresponding likelihood-based inference framework.
Advisors/Committee Members: Morris, Martina (advisor).
Subjects/Keywords: Degeneracy; Dynamic network; Exponential Random Graph Model; Social network; Statistics; statistics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, K. (2015). Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/34190
Chicago Manual of Style (16th Edition):
Li, Ke. “Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis.” 2015. Doctoral Dissertation, University of Washington. Accessed December 13, 2019.
http://hdl.handle.net/1773/34190.
MLA Handbook (7th Edition):
Li, Ke. “Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis.” 2015. Web. 13 Dec 2019.
Vancouver:
Li K. Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis. [Internet] [Doctoral dissertation]. University of Washington; 2015. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1773/34190.
Council of Science Editors:
Li K. Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis. [Doctoral Dissertation]. University of Washington; 2015. Available from: http://hdl.handle.net/1773/34190

Georgia Tech
21.
Marshall, Luke J.
Dynamic and continuous-time service network design.
Degree: PhD, Industrial and Systems Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/59843
► The thesis focuses on two fundamental problems in transportation and logistics, namely, service network design, and operation, with a focus on high precision, and large…
(more)
▼ The thesis focuses on two fundamental problems in transportation and logistics, namely, service
network design, and operation, with a focus on high precision, and large scale. A typical approach to solving the design problem is by modeling with time-expanded networks and solving using integer programming, however this often yields an approximation to the continuous-time optimal solution. We investigate the price of this approximation caused by the discretization of parameters involving time, and introduce two algorithms that efficiently solve the continuous-time problem. Both algorithms dynamically build and refine a subset of the full time-expanded
network, so that the associated integer program is more computationally tractable, while still providing a guarantee of continuous-time optimality. The second algorithm is further extended to support in-tree loading, and freight splitting. In-tree loading simplifies operational overhead by requiring freight with common ultimate destination cross-docked at a terminal to travel along the same path; in this way terminal operators need only look at the ultimate destination in order to load shipments. Freight splitting allows for increased utilization by arbitrarily breaking shipments into smaller pieces; it is also a modeling technique to support aggregating shipments with common origin/destination in order to keep the model size tractable. The design problem is primarily concerned with the routing of freight and service capacity, and is typically solved infrequently using predicted freight, whereas the operation problem is highly
dynamic, using actual day-to-day volumes, and focuses on loading/dispatching vehicles, as well as crew and resource scheduling. We introduce an efficient heuristic to solve a large scale real-life operation problem, as well as providing new and useful metrics for evaluating operational performance.
Advisors/Committee Members: Savelsbergh, Martin (advisor), Boland, Natashia (advisor), Erera, Alan (committee member), White III, Chelsea (committee member), Clarke, John-Paul (committee member).
Subjects/Keywords: Service network design; Time-expanded network; Time-space network; Dynamic discretization discovery
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):
Marshall, L. J. (2018). Dynamic and continuous-time service network design. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59843
Chicago Manual of Style (16th Edition):
Marshall, Luke J. “Dynamic and continuous-time service network design.” 2018. Doctoral Dissertation, Georgia Tech. Accessed December 13, 2019.
http://hdl.handle.net/1853/59843.
MLA Handbook (7th Edition):
Marshall, Luke J. “Dynamic and continuous-time service network design.” 2018. Web. 13 Dec 2019.
Vancouver:
Marshall LJ. Dynamic and continuous-time service network design. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1853/59843.
Council of Science Editors:
Marshall LJ. Dynamic and continuous-time service network design. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59843

NSYSU
22.
Ho, Po-cheng.
The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA.
Degree: PhD, Public Affairs Management, 2010, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637
► Any one organization or agency, whether for-profit or non-profit organizations that are seeking to enhance their efficiency, improve production technology, thereby achieving the goal of…
(more)
▼ Any one organization or agency, whether for-profit or non-profit organizations that are seeking to enhance their efficiency, improve production technology, thereby achieving the goal of improving productivity, with a view to the current competitive environment. Efficiency measurement is very important, it can help decision makers understand whether the organization achieve technology progress and innovation objectives. In recent years, the government and civil organizations devote themselves to measure the change of organizational efficiency and productivity. Academia constantly research and develop various models of efficiency and productivity analysis, and application to actual cases analysis. Efficiency and productivity analysis has leapt to the mainstream of production economic studies.
This empirical study adopts the census data of the classification of the Chamber of Commerce and industry of manufacturing in Taiwan, using two-stage approach to explore
dynamic agglomeration externalities of 2-digit manufacturing. In the first stage, we apply
dynamic network data envelopment analysis and Malmquist productivity index to calculate static efficiency and
dynamic efficiency of 2-digit manufacturing. In the second stage, we apply Tobit regression analysis to verify a manufacturing geographical concentration effects on productive efficiency. We also adopt two-stage least squares methods (2SLS) to validate
dynamic agglomeration externalities effects of manufacturing. Based on the results of this empical study, we propose some specific practical policy alternatives and management strategies.
In the last 20 years, the strctures of Taiwan manufacturing industries have significant changes, the livelihood industry and of the sharp decline in industry, the chemical industry, electronics industry, metal machinery industry is growing fast. There is an obvous agglomeration tendency toward northern Taiwan region. In static efficiency, labour-intensive manufacturing industries tend to be diminishing return to scale rendering, while knowledge-intensive industries are rendering the increasing trend. The scale efficiency of eastern region manufacturing is very low, resulting in their productive efficiency significantly lower than the northern, central, southern regional manufacturing. In
dynamic efficiency, the total factor productivity (TFP) of Taiwan manufacturing industries are rendering the growth trend, achieving the goal of innovation effect. However, the technical efficiency of manufacturing are rendering decline trend.
This study found that the most important impact factor on production efficiency is the internal economies of scale. Localization economies, urbanization economies, and other static agglomeration economies external effect gradually reduce. Moreover, this study also found that Taiwan manufacturing industries have notable MAR professional
dynamic external economics and notable Porter regional competitive
dynamic external economic effect. Besides, Taiwan manufacturing industries has noticeable human resource
dynamic…
Advisors/Committee Members: Ying-Fang Huang (chair), Pin-Yu Chu (chair), Jih-Hwa Wu (committee member), Tong-Po Ho (chair), Chun-Chu Liu (chair), Hsieh-Sheng Chen (chair), Mien-Yun Kuo (chair).
Subjects/Keywords: Dynamic Agglomeration Externalities; Total Factor Productivity (TFP); Manufacturing; Productive Effciency; Dynamic Network Data Envelopment 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):
Ho, P. (2010). The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637
Chicago Manual of Style (16th Edition):
Ho, Po-cheng. “The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA.” 2010. Doctoral Dissertation, NSYSU. Accessed December 13, 2019.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637.
MLA Handbook (7th Edition):
Ho, Po-cheng. “The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA.” 2010. Web. 13 Dec 2019.
Vancouver:
Ho P. The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2019 Dec 13].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637.
Council of Science Editors:
Ho P. The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637

Penn State University
23.
Meimand Kermani, Amir Hossein.
DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS.
Degree: PhD, Industrial Engineering, 2013, Penn State University
URL: https://etda.libraries.psu.edu/catalog/18978
► Recently, Stackelberg games have been employed by many economists who use game theory concepts to solve dynamic competitive service sector problems such as dynamic pricing,…
(more)
▼ Recently, Stackelberg games have been employed by many
economists who use game theory concepts to solve dynamic
competitive service sector problems such as dynamic pricing,
production planning, logistics, supply chain management, and
transportation network ow prediction and control. Hence,
Stackelberg games have become the focus of much research activity.
In this thesis, we provide a framework for studying player
interaction based on the Stackelberg-Cournot-Nash behavioral
assumption. We briey review the classical the- ory of dynamic
Stackelberg games, and show how the Nash equilibrium of a lower
level problem may be better described by so-called di¤erential
variational inequalities (DVI). We also show that when each agent
in the lower level problem is solving a stochastic optimal control
with a linear quadratic form, the stochastic Nash equilibrium can
be expressed as a Riccati system of equations. Both a DVI
formulation and a Riccati system of equations may be used to
express the solution of the lower level problem implicitly as a
function of the upper level problems controls. Hence, we are able
to convert the bi-level optimization problem into a single-level
problem. Furthermore, we study the application of di¤erential
Stackelberg games on two di¤erent areas: freight transport, and
strategic pricing and revenue management. In the
rst model, we
con- sider a Stackelberg game between a single carrier that acts as
the leader and multiple shippers involved in a Nash competition. In
the second model, we study the interaction between a supplier who
is the leader and multiple retailers who are competing to sell a
homogeneous commodity in a market when the market price evolves
based on an Ito-type stochastic process.
Subjects/Keywords: DYNAMIC GAMES; STACKELBERG GAMES; DIFFERENTIAL GAMES;
DYNAMIC PRICING; PRODUCTION PLANNING NETWORK DESIGN;
LOGISTICS
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):
Meimand Kermani, A. H. (2013). DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/18978
Chicago Manual of Style (16th Edition):
Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS.” 2013. Doctoral Dissertation, Penn State University. Accessed December 13, 2019.
https://etda.libraries.psu.edu/catalog/18978.
MLA Handbook (7th Edition):
Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS.” 2013. Web. 13 Dec 2019.
Vancouver:
Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS. [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2019 Dec 13].
Available from: https://etda.libraries.psu.edu/catalog/18978.
Council of Science Editors:
Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO
DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND
LOGISTICS. [Doctoral Dissertation]. Penn State University; 2013. Available from: https://etda.libraries.psu.edu/catalog/18978

Anna University
24.
Sivaganesan, D.
Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -.
Degree: Information and Communication
Engineering, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/24336
► Mobile Ad Hoc Networks are a collection of autonomous mobile hosts without the help of the center base stations Broadcasting is a fundamental service in…
(more)
▼ Mobile Ad Hoc Networks are a collection of
autonomous mobile hosts without the help of the center base
stations Broadcasting is a fundamental service in Mobile Ad Hoc
Networks The Broadcast nature of the wireless transmission is that
all the neighbors of a newlinehost will receive the packets when
the host transmits them The direct approach to perform broadcast is
by flooding A host on receiving a broadcast message for the first
time has the obligation to rebroadcast the message Costing n number
of transmissions in a network of hosts Flooding type of
broadcasting leading to redundant rebroadcast when a mobile host
rebroadcasts a broadcast message to its neighbors When the size of
the newlinenetwork increases and it becomes dense even a simple
broadcast operation may trigger a huge transmission collision and
contention that may lead to the collapse of the whole network This
is referred to as the Broadcast Strom Problem Numerous
investigations are going on to solve this problem that may lead to
the issues namely Redundancy ontention and Collision End to End
Delay Energy consumption Power consumption and Throughput To
overcome this drawback some sort of infrastructure is to be
developed for a network enhancing the performance of the whole
network especially when it becomes dense newline
newline
References p.96-103
Advisors/Committee Members: Venkatesan, R.
Subjects/Keywords: Dynamic Cluster Routing Protocol; Information and communication engineering; Mobile Ad Hoc Network; One Hop Dynamic Cluster 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):
Sivaganesan, D. (2014). Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24336
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):
Sivaganesan, D. “Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -.” 2014. Thesis, Anna University. Accessed December 13, 2019.
http://shodhganga.inflibnet.ac.in/handle/10603/24336.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sivaganesan, D. “Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -.” 2014. Web. 13 Dec 2019.
Vancouver:
Sivaganesan D. Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Dec 13].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24336.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sivaganesan D. Certain investigations on the broadcasting in clustered
mobile Ad Hoc networks; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24336
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
25.
Chen, Yao-Hsuan.
Network modeling of sexually transmitted diseases.
Degree: PhD, Industrial and Systems Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/51883
► We create a dynamic network model to replicate more closely the population network structures of interest. Network, Norms and HIV/STI Risk Among Youth (NNAHRAY) is…
(more)
▼ We create a
dynamic network model to replicate more closely the population
network structures of interest.
Network, Norms and HIV/STI Risk Among Youth (NNAHRAY) is a community relationship survey data set, which provides a rare sample of a human risky-behavior contact
network. Combining disease compartmental models with our
dynamic network model, we simulate the spread of Human Immunodeficiency Virus (HIV) and Herpes Simplex Type 2 Virus (HSV2) with consideration of HSV2's synergistic impact on HIV's transmission. Our model reproduces HIV prevalence, HSV-2 prevalence, and the contact
network close to those observed in NNAHRAY, with HIV annual prevalence closer to the estimated values from the literature than those of any disease spread model based on static networks. The success of fitting our model to the target data shows the importance of considering the data sampling process, contact dynamics, and contact
network structures. Our model, under certain conditions, has prevalence prediction results that are insensitive to changes in
network size. The analysis of various prevention/intervention strategies targeting different risky groups gives important insights into strategy prioritization and illustrates how our model can be used to assist in making public health policy decisions in practice, both for individual diseases and in the more-recent area of study that considers synergy between two diseases.
Advisors/Committee Members: Sokol, Joel (advisor), Tovey, Craig A. (advisor), Goldsman, David M. (advisor), Griffin, Paul (advisor), Gift, Thomas L. (advisor).
Subjects/Keywords: Dynamic network model; Contact network; Sexually transmitted diseases; Sexually transmitted disease; Mathematical models
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, Y. (2014). Network modeling of sexually transmitted diseases. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51883
Chicago Manual of Style (16th Edition):
Chen, Yao-Hsuan. “Network modeling of sexually transmitted diseases.” 2014. Doctoral Dissertation, Georgia Tech. Accessed December 13, 2019.
http://hdl.handle.net/1853/51883.
MLA Handbook (7th Edition):
Chen, Yao-Hsuan. “Network modeling of sexually transmitted diseases.” 2014. Web. 13 Dec 2019.
Vancouver:
Chen Y. Network modeling of sexually transmitted diseases. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1853/51883.
Council of Science Editors:
Chen Y. Network modeling of sexually transmitted diseases. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51883

Rochester Institute of Technology
26.
Sharma, Deepak.
Exploring Deep Neural Network Models for Classification of High-resolution Panoramas.
Degree: MS, Computer Science (GCCIS), 2019, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/9987
► The objective of this thesis is to explore Deep Learning algorithms for classifying high-resolution images. While most deep learning algorithms focus on relatively low-resolution…
(more)
▼ The objective of this thesis is to explore Deep Learning algorithms for classifying high-resolution images. While most deep learning algorithms focus on relatively low-resolution imagery (under 400×400 pixels), very high-resolution image classification poses unique challenges. These images occur in pathology and remote sensing, but here we focus on the classification of invasive plant species. We aimed to develop a computer vision system that can provide geo-coordinates of the locations of invasive plants by processing Google Map Street View images at using finite computational resources. We explore six methods for classifying these images and compare them. Our results could significantly impact the management of invasive plant species, which pose both economic and ecological threats.
Advisors/Committee Members: Christopher Kanan, Thomas Kinsman, Zack Butler.
Subjects/Keywords: Computer vision; Convolutional neural network; Deep learning; Dynamic capacity network; High-resolution; Image classification
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):
Sharma, D. (2019). Exploring Deep Neural Network Models for Classification of High-resolution Panoramas. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9987
Chicago Manual of Style (16th Edition):
Sharma, Deepak. “Exploring Deep Neural Network Models for Classification of High-resolution Panoramas.” 2019. Masters Thesis, Rochester Institute of Technology. Accessed December 13, 2019.
https://scholarworks.rit.edu/theses/9987.
MLA Handbook (7th Edition):
Sharma, Deepak. “Exploring Deep Neural Network Models for Classification of High-resolution Panoramas.” 2019. Web. 13 Dec 2019.
Vancouver:
Sharma D. Exploring Deep Neural Network Models for Classification of High-resolution Panoramas. [Internet] [Masters thesis]. Rochester Institute of Technology; 2019. [cited 2019 Dec 13].
Available from: https://scholarworks.rit.edu/theses/9987.
Council of Science Editors:
Sharma D. Exploring Deep Neural Network Models for Classification of High-resolution Panoramas. [Masters Thesis]. Rochester Institute of Technology; 2019. Available from: https://scholarworks.rit.edu/theses/9987

University of Rochester
27.
Meng, Yuan (1988 - ).
Poly(capro-lactone) networks as actively moving
polymers.
Degree: PhD, 2016, University of Rochester
URL: http://hdl.handle.net/1802/31452
► Shape-memory polymers (SMPs), as a subset of actively moving polymers, form an exciting class of materials that can store and recover elastic deformation energy upon…
(more)
▼ Shape-memory polymers (SMPs), as a subset of
actively moving polymers, form an exciting class of materials that
can store and recover elastic deformation energy upon application
of an external stimulus. Although engineering of SMPs nowadays has
lead to robust materials that can memorize multiple temporary
shapes, and can be triggered by various stimuli such as heat,
light, moisture, or applied magnetic fields, further
commercialization of SMPs is still constrained by the material’s
incapability to store large elastic energy, as well as its inherent
one-way shape-change nature.
</br>
This thesis
develops a series of model semi-crystalline shape-memory networks
that exhibit ultra-high energy storage capacity, with accurately
tunable triggering temperature; by introducing a second competing
network, or reconfiguring the existing network under strained
state, configurational chain bias can be effectively locked-in, and
give rise to two-way shape-actuators that, in the absence of an
external load, elongates upon cooling and reversibly contracts upon
heating.
</br>
We found that well-defined
network architecture plays essential role on strain-induced
crystallization and on the performance of cold-drawn shape-memory
polymers. Model networks with uniform molecular weight between
crosslinks, and specified functionality of each net-point, results
in tougher, more elastic materials with a high degree of
crystallinity and outstanding shape-memory properties. The thermal
behavior of the model networks can be finely modified by
introducing non-crystalline small molecule linkers that effectively
frustrates the crystallization of the network strands. This
resulted in shape-memory networks that are ultra-sensitive to heat,
as deformed materials can be efficiently triggered to revert to its
permanent state upon only exposure to body temperature.
</br>
We also coupled the same reaction adopted
to create the model network with conventional free-radical
polymerization to prepare a dual-cure “double network” that behaves
as a real thermal “actuator”. This approach places sub-chains under
different degrees of configurational bias within the network to
utilize the material’s propensity to undergo stress-induced
crystallization. Reconfiguration of model shape-memory networks
containing photo-sensitive linkages can also be employed to program
two-way actuator. Chain reshuffling of a partially reconfigurable
network is initiated upon exposure to light under specific strains.
Interesting photo-induced creep and stress relaxation behaviors
were demonstrated and understood based on a novel transient network
model we derived.
</br>
In summary, delicate
manipulation of shape-memory network architectures addressed
critical issues constraining the application of this type of
functional polymer material. Strategies developed in this thesis
may provide new opportunity to the field of shape-memory
polymers.
Subjects/Keywords: Actively-moving polymers; Dynamic network; Elastomer network; Poly(caprolactone); Shape-memory polymers; Stimuli-responsive materials
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):
Meng, Y. (. -. ). (2016). Poly(capro-lactone) networks as actively moving
polymers. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31452
Chicago Manual of Style (16th Edition):
Meng, Yuan (1988 - ). “Poly(capro-lactone) networks as actively moving
polymers.” 2016. Doctoral Dissertation, University of Rochester. Accessed December 13, 2019.
http://hdl.handle.net/1802/31452.
MLA Handbook (7th Edition):
Meng, Yuan (1988 - ). “Poly(capro-lactone) networks as actively moving
polymers.” 2016. Web. 13 Dec 2019.
Vancouver:
Meng Y(-). Poly(capro-lactone) networks as actively moving
polymers. [Internet] [Doctoral dissertation]. University of Rochester; 2016. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1802/31452.
Council of Science Editors:
Meng Y(-). Poly(capro-lactone) networks as actively moving
polymers. [Doctoral Dissertation]. University of Rochester; 2016. Available from: http://hdl.handle.net/1802/31452

University of California – San Francisco
28.
Lipinski-Kruszka, Joanna.
Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks.
Degree: Biological and Medical Informatics, 2014, University of California – San Francisco
URL: http://www.escholarship.org/uc/item/1nq1x2mp
► Cellular decision making is accomplished by complex networks, the structure of which has traditionally been inferred from mean gene expression data. In addition to mean…
(more)
▼ Cellular decision making is accomplished by complex networks, the structure of which has traditionally been inferred from mean gene expression data. In addition to mean data, detailed quantitative measures of distributions across a population can be obtained using techniques such as flow cytometry that measure expression in single cells. The resulting distributions, which reflect a population's variability or noise, constitute a potentially rich source of information for network reconstruction. A significant portion of molecular noise in a biological process is propagated from the upstream regulators. This propagated component provides additional information about causal network connections. Here, we devise a procedure in which we exploit equations for dynamic noise propagation in a network under non-steady state conditions to distinguish between alternate regulatory relationships in a network. We test our approach in silico using data obtained from stochastic simulations as well as in vivo using experimental data collected from synthetic circuits constructed in yeast.
Subjects/Keywords: Bioinformatics; biochemical network; computational method; dynamic noise propagation; molecular noise; network inference
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):
Lipinski-Kruszka, J. (2014). Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks. (Thesis). University of California – San Francisco. Retrieved from http://www.escholarship.org/uc/item/1nq1x2mp
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):
Lipinski-Kruszka, Joanna. “Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks.” 2014. Thesis, University of California – San Francisco. Accessed December 13, 2019.
http://www.escholarship.org/uc/item/1nq1x2mp.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lipinski-Kruszka, Joanna. “Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks.” 2014. Web. 13 Dec 2019.
Vancouver:
Lipinski-Kruszka J. Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks. [Internet] [Thesis]. University of California – San Francisco; 2014. [cited 2019 Dec 13].
Available from: http://www.escholarship.org/uc/item/1nq1x2mp.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lipinski-Kruszka J. Using Dynamic Molecular Noise to Infer Gene-Regulatory Networks. [Thesis]. University of California – San Francisco; 2014. Available from: http://www.escholarship.org/uc/item/1nq1x2mp
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech
29.
Kalim, Umar.
Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking.
Degree: PhD, Computer Science, 2017, Virginia Tech
URL: http://hdl.handle.net/10919/87387
► The Internet has made tremendous progress since its inception. The kingpin has been the transmission control protocol (TCP), which supports a large fraction of communication.…
(more)
▼ The Internet has made tremendous progress since its inception. The kingpin has
been the transmission control protocol (TCP), which supports a large fraction of
communication. With the Internet's wide-spread access, users now have increased
expectations.
The demands have evolved to an extent which TCP was never
designed to support. Since
network stacks do not provide the necessary
functionality for modern applications, developers are forced to implement them
over and over again – as part of the application or supporting libraries.
Consequently, application developers not only bear the burden of developing
application features but are also responsible for building networking libraries
to support sophisticated scenarios. This leads to considerable duplication of
effort.
The challenge for TCP in supporting modern use cases is mostly due to limiting
assumptions, simplistic communication abstractions, and (once expedient)
implementation shortcuts. To further add to the complexity, the limited TCP
options space is insufficient to support extensibility and thus, contemporary
communication patterns. Some argue that radical changes are required to extend
the networks functionality; some researchers believe that a clean slate approach
is the only path forward. Others suggest that evolution of the
network stack is
necessary to ensure wider adoption – by avoiding a flag day. In either case,
we see that the proposed solutions have not been adopted by the community at
large. This is perhaps because the cost of transition from the incumbent to the
new technology outweighs the value offered. In some cases, the limited scope of the
proposed solutions limit their value. In other cases, the lack of backward
compatibility or significant porting effort precludes incremental adoption
altogether.
In this dissertation, we focus on the development of a communication model that
explicitly acknowledges the context of the conversation and describes (much of)
modern communications. We highlight how the communication stack should be able
to discover, interact with and use available resources to compose richer
communication constructs. The model is able to do so by using session,
flow and endpoint abstractions to describe communications between
two or more endpoints. These abstractions provide means to the application
developers for setting up and manipulating constructs, while the ability to
recognize change in the operating context and reconfigure the constructs allows
applications to adapt to the changing requirements. The model considers two or
more participants to be involved in the conversation and thus enables most
modern communication patterns, which is in contrast with the well-established
two-participant model.
Our contributions also include an implementation of a framework that realizes
such communication methods and enables future innovation. We substantiate our
claims by demonstrating case studies where we use the proposed abstractions to
highlight the gains. We also…
Advisors/Committee Members: Feng, Wu-Chun (committeechair), Yang, Yaling (committee member), Gardner, Mark K. (committee member), Balaji, Pavan (committee member), Tilevich, Eli (committee member).
Subjects/Keywords: Session Management; Context Awareness; Dynamic Network Configuration; Network-Stack Extensions; Next-Generation Networking
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):
Kalim, U. (2017). Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/87387
Chicago Manual of Style (16th Edition):
Kalim, Umar. “Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking.” 2017. Doctoral Dissertation, Virginia Tech. Accessed December 13, 2019.
http://hdl.handle.net/10919/87387.
MLA Handbook (7th Edition):
Kalim, Umar. “Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking.” 2017. Web. 13 Dec 2019.
Vancouver:
Kalim U. Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking. [Internet] [Doctoral dissertation]. Virginia Tech; 2017. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/10919/87387.
Council of Science Editors:
Kalim U. Cognizant Networks: A Model and Framework for Session-based Communications and Adaptive Networking. [Doctoral Dissertation]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/87387

Queens University
30.
Li, Wenjie.
Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
.
Degree: Computing, 2015, Queens University
URL: http://hdl.handle.net/1974/13414
► The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks…
(more)
▼ The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this thesis, I present a novel strategy in ICN for adaptive caching of variable video contents tailored to different sizes and bit rates. My objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, my approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. I incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In my proposed model, named DASCache, I present queuing analysis for Round-Trip Time (RTT) of cached objects, providing a cap on expected delay in accessing video content. In DASCache, I present a Binary Integer Programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, I present an elaborate performance evaluation carried out on ndnSIM, over NS-3.
Subjects/Keywords: in-network caching;
Optimization;
Content-centric network;
Queueing analysis;
Binary integer programming;
Dynamic adaptive streaming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, W. (2015). Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
. (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/13414
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
.” 2015. Thesis, Queens University. Accessed December 13, 2019.
http://hdl.handle.net/1974/13414.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
.” 2015. Web. 13 Dec 2019.
Vancouver:
Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
. [Internet] [Thesis]. Queens University; 2015. [cited 2019 Dec 13].
Available from: http://hdl.handle.net/1974/13414.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks
. [Thesis]. Queens University; 2015. Available from: http://hdl.handle.net/1974/13414
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [15] ▶
.