subject:(Dynamic network)

University of Saskatchewan

1. 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

❌

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

APA (6^th 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 (16^th Edition):

Hashemian, Mohammad Seyed. “Human dynamic networks in opportunistic routing and epidemiology.” 2011. Thesis, University of Saskatchewan. Accessed March 07, 2021. 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 (7^th Edition):

Hashemian, Mohammad Seyed. “Human dynamic networks in opportunistic routing and epidemiology.” 2011. Web. 07 Mar 2021.

Vancouver:

Hashemian MS. Human dynamic networks in opportunistic routing and epidemiology. [Internet] [Thesis]. University of Saskatchewan; 2011. [cited 2021 Mar 07]. 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

2. 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

❌

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

APA (6^th 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 (16^th Edition):

Tracey, Justin. “Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs.” 2017. Thesis, University of Waterloo. Accessed March 07, 2021. 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 (7^th Edition):

Tracey, Justin. “Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs.” 2017. Web. 07 Mar 2021.

Vancouver:

Tracey J. Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Mar 07]. 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 Technology, Sydney

3. 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

❌

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

APA (6^th 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 (16^th Edition):

Patel, M. “A probabilistic model for assistive robotics devices to support activities of daily living.” 2014. Thesis, University of Technology, Sydney. Accessed March 07, 2021. 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 (7^th Edition):

Patel, M. “A probabilistic model for assistive robotics devices to support activities of daily living.” 2014. Web. 07 Mar 2021.

Vancouver:

Patel M. A probabilistic model for assistive robotics devices to support activities of daily living. [Internet] [Thesis]. University of Technology, Sydney; 2014. [cited 2021 Mar 07]. 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

Texas A&M University

4. Barua, Shubharthi. Dynamic Operational Risk Assessment with Bayesian Network.

Degree: MS, Safety Engineering, 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

❌

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

APA (6^th Edition):

Barua, S. (2012). Dynamic Operational Risk Assessment with Bayesian Network. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573

Chicago Manual of Style (16^th Edition):

Barua, Shubharthi. “Dynamic Operational Risk Assessment with Bayesian Network.” 2012. Masters Thesis, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573.

MLA Handbook (7^th Edition):

Barua, Shubharthi. “Dynamic Operational Risk Assessment with Bayesian Network.” 2012. Web. 07 Mar 2021.

Vancouver:

Barua S. Dynamic Operational Risk Assessment with Bayesian Network. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573.

Council of Science Editors:

Barua S. Dynamic Operational Risk Assessment with Bayesian Network. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11573

Penn State University

5. Kim, So Hee. POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY.

Degree: 2016, Penn State University

URL: https://submit-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. Advisors/Committee Members: Dr. Göktuğ Morçöl, Dissertation Advisor/Co-Advisor, Dr. Göktuğ Morçöl, Committee Chair/Co-Chair, Dr. Bing Ran, Committee Member, Dr. Triparna B. Vasavada, Committee Member, Dr. Rhoda Joseph, Outside Member.

Subjects/Keywords: policy network theory; advocacy coalition framework; issue network; SCHIP; dynamic network analysis; network text analysis

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kim, S. H. (2016). POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/mc87pq24j

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

Chicago Manual of Style (16^th Edition):

Kim, So Hee. “POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY.” 2016. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/mc87pq24j.

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

MLA Handbook (7^th Edition):

Kim, So Hee. “POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY.” 2016. Web. 07 Mar 2021.

Vancouver:

Kim SH. POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY. [Internet] [Thesis]. Penn State University; 2016. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/mc87pq24j.

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

Council of Science Editors:

Kim SH. POLICY ISSUE NETWORKS IN THE STATE CHILDREN’S HEALTH INSURANCE PROGRAM (SCHIP) IN ILLINOIS: A LONGITUDINAL CASE STUDY. [Thesis]. Penn State University; 2016. Available from: https://submit-etda.libraries.psu.edu/catalog/mc87pq24j

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

6. 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

❌

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

APA (6^th 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 (16^th 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 March 07, 2021. 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 (7^th Edition):

Oliveira, Luciana Pereira. “Future internet architecture to structure and to manage dynamic autonomous systems, internet service providers and customers .” 2008. Web. 07 Mar 2021.

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 2021 Mar 07]. 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

7. Sun, Yuqi. OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING.

Degree: 2016, Penn State University

URL: https://submit-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. Advisors/Committee Members: Tao Yao, Dissertation Advisor/Co-Advisor.

Subjects/Keywords: optimization; dynamic network loading; machine learning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sun, Y. (2016). OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/ng451h485

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

Chicago Manual of Style (16^th Edition):

Sun, Yuqi. “OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING.” 2016. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/ng451h485.

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

MLA Handbook (7^th Edition):

Sun, Yuqi. “OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING.” 2016. Web. 07 Mar 2021.

Vancouver:

Sun Y. OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING. [Internet] [Thesis]. Penn State University; 2016. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/ng451h485.

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

Council of Science Editors:

Sun Y. OPTIMIZATION ALGORITHMS AND APPLICATIONS IN TRAFFIC SIGNAL CONTROL AND MACHINE LEARNING. [Thesis]. Penn State University; 2016. Available from: https://submit-etda.libraries.psu.edu/catalog/ng451h485

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

Addis Ababa University

8. 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

❌

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

APA (6^th 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 (16^th Edition):

HAILAY, WELDEGEBRIEL. “DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS .” 2012. Thesis, Addis Ababa University. Accessed March 07, 2021. 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 (7^th Edition):

HAILAY, WELDEGEBRIEL. “DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS .” 2012. Web. 07 Mar 2021.

Vancouver:

HAILAY W. DEVELOPING DYNAMIC BANDWIDTH ALLOCATION PROTOTYPE MODEL FOR CAMPUS NETWORK BASED ON NETWORK TRAFFIC ANALYSIS . [Internet] [Thesis]. Addis Ababa University; 2012. [cited 2021 Mar 07]. 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

University of Toronto

9. 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)

Subjects/Keywords: Combinatorial Scheduling; Queueing Theory; Dynamic Network; 0546

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Masters Thesis, University of Toronto. Accessed March 07, 2021. http://hdl.handle.net/1807/31609.

MLA Handbook (7^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Web. 07 Mar 2021.

Vancouver:

Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Mar 07]. 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

Delft University of Technology

10. Sprangers, Wesley (author). Modelling, simulation and analysis of green gas injection into the gas distribution network.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7a06dda9-bfa4-4b1e-aee7-a1086dbad968

► The increase of the average world temperature, as a result of greenhouse gasses, is one of the greatest challenges the world is currently facing and… (more)

▼ The increase of the average world temperature, as a result of greenhouse gasses, is one of the greatest challenges the world is currently facing and will be facing in the future. One of the many efforts to reduce the increase of carbon dioxide, is to decarbonize the gas network by replacing natural gas with renewable gasses like green gas. Since the current gas network is not always suited for the injection of big green gas volumes, especially during summer periods, the process of decarbonizing the natural gas network requires adjustments of the current functioning of the gas network. Several technical adjustments for obtaining an increased green gas injection capacity exists, although, up to now, the potential green gas injection capacity obtained per solution was not known. Within this study, a dynamic gas network simulation model was developed wherein different gas network function strategies can be explored to obtain the potential green gas injection capacities. With the developed dynamic gas network simulation model one is capable to implement and simulate different gas distribution network configurations, specify green gas suppliers on the location of choice, simulate different gas demand scenarios and consumer profiles, adjust the city gate station pressure used for simulations of static- and dynamic pressure management, and to model the injection of excess green gas into a storage- and from the storage into the network. Within this study, the gas distribution network of Northeast Friesland, The Netherlands was analyzed on its green gas injection capacity after applying static pressure management, dynamic pressure management, and a pressure management strategy combined with storage. The gas network of Northeast Friesland was explicitly chosen since currently, green gas injection problems are experienced within this network. Following the results obtained from the simulations, a city gate station inlet pressure - demand table was defined. Within this table, the total gas demand measured within the network was plotted against the minimum city gate station inlet pressures, while still in compliance with the lower pressure boundary condition. Using this table, the optimal period to statically decrease- and increase the city gate station inlet pressures from 8.3 to 6.5 bar and from 6.5 bar to 8.3 bar, appeared to be respectively 1 May and 1 October. By changing the pressure to 6.5 bar, a safety margin of 1.5 bar was taken into account. For both static- and dynamic pressure management, green gas injection capacities ranging from 400 to 1600 m³/h, divided over three green gas suppliers, were analysed. The results were depicted against the total injectable hours, providing insight in the maximum green gas injection capacity while remaining eligible for the Stimulation of Sustainable Energy Production (SDE+) subsidy. Since with dynamic pressure management the city gate station can inject at lower inlet pressures, dynamic pressure management results in a greater green gas injection capacity. To point out, static… Advisors/Committee Members: Herder, Paulien (mentor), Heijnen, Petra (graduation committee), Cutz IJchajchal, Luis (graduation committee), Pishbin, S.I. (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Green gas; Gas network; Dynamic simulation; Biomethane

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sprangers, W. (. (2020). Modelling, simulation and analysis of green gas injection into the gas distribution network. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7a06dda9-bfa4-4b1e-aee7-a1086dbad968

Chicago Manual of Style (16^th Edition):

Sprangers, Wesley (author). “Modelling, simulation and analysis of green gas injection into the gas distribution network.” 2020. Masters Thesis, Delft University of Technology. Accessed March 07, 2021. http://resolver.tudelft.nl/uuid:7a06dda9-bfa4-4b1e-aee7-a1086dbad968.

MLA Handbook (7^th Edition):

Sprangers, Wesley (author). “Modelling, simulation and analysis of green gas injection into the gas distribution network.” 2020. Web. 07 Mar 2021.

Vancouver:

Sprangers W(. Modelling, simulation and analysis of green gas injection into the gas distribution network. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 07]. Available from: http://resolver.tudelft.nl/uuid:7a06dda9-bfa4-4b1e-aee7-a1086dbad968.

Council of Science Editors:

Sprangers W(. Modelling, simulation and analysis of green gas injection into the gas distribution network. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:7a06dda9-bfa4-4b1e-aee7-a1086dbad968

University of Minnesota

11. 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

❌

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

APA (6^th 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 (16^th Edition):

Ahmed, Rezwan. “Algorithms for mining evolving patterns in dynamic relational networks.” 2014. Doctoral Dissertation, University of Minnesota. Accessed March 07, 2021. http://hdl.handle.net/11299/167704.

MLA Handbook (7^th Edition):

Ahmed, Rezwan. “Algorithms for mining evolving patterns in dynamic relational networks.” 2014. Web. 07 Mar 2021.

Vancouver:

Ahmed R. Algorithms for mining evolving patterns in dynamic relational networks. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2021 Mar 07]. 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

University of New South Wales

12. 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

❌

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

APA (6^th 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 (16^th Edition):

Setiawan, Ridwan. “Plantwide dynamic operability analysis from network perspective.” 2012. Doctoral Dissertation, University of New South Wales. Accessed March 07, 2021. http://handle.unsw.edu.au/1959.4/51693 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10360/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Setiawan, Ridwan. “Plantwide dynamic operability analysis from network perspective.” 2012. Web. 07 Mar 2021.

Vancouver:

Setiawan R. Plantwide dynamic operability analysis from network perspective. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2021 Mar 07]. 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 Oklahoma

13. Yang, Mu. Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations.

Degree: PhD, 2017, University of Oklahoma

URL: http://hdl.handle.net/11244/53080

► This dissertation is devoted to the development of distributed algorithms, with which nodes in a large decentralized network can accomplish tasks that are seemingly difficult… (more)

▼ This dissertation is devoted to the development of distributed algorithms, with which nodes in a large decentralized network can accomplish tasks that are seemingly difficult without an omniscient central node. The tasks include estimating the graph spectrum, from which each node can draw its own conclusion about the network structure, computing the eigenvector centrality, from which every node can judge its own importance in the network, and solving a system of linear equations whose data are scattered across the network or discovering that no solution exists. The ability to perform these tasks enhances the capability of existing and emerging networks such as smart power grids, social networks, and ad hoc sensor networks, potentially allowing them to function in ways that are not previously thought to be possible. We begin with the design of a novel, two-stage distributed algorithm that enables nodes in an undirected and connected graph to jointly estimate the spectrum of a matrix associated with the graph, which includes the adjacency and Laplacian matrices as special cases. In the first stage, the algorithm uses a discrete-time linear iteration and the Cayley-Hamilton theorem to convert the problem into one of solving linear equations, where each equation is known to a node. In the second stage, if the nodes happen to know that said matrix is cyclic, the algorithm uses a Lyapunov approach to asymptotically solve the equations with an exponential rate of convergence. Otherwise, it uses a random perturbation approach and a structural controllability result to approximately solve the equations with an error that can be made small. We then consider the fundamental problem of cooperatively solving a general system of linear equations over a network, for which a continuous-time distributed algorithm is devised. We show that the algorithm enables the nodes to asymptotically agree on a solution when there are infinitely many solutions, determine the solution when there is exactly one, and detect that no solution exists when there are none. We also establish that the algorithm is globally exponentially convergent, derive an explicit lower bound on its convergence rate that it can do no worse than, and prove that the larger the network's algebraic connectivity, or the further away from being singular the system of equations, the larger this lower bound. Finally, we address the open question of whether it is possible to calculate eigenvector centrality over a network. We provide an affirmative answer by presenting a class of continuous-time distributed algorithms and an asynchronous gossip algorithm, which allow every node i in a graph to compute the ith entry of the Perron-Frobenius eigenvector of a symmetric, Metzler, and irreducible matrix induced by the graph, as well as the corresponding eigenvalue, when node i knows only row i of the matrix. We show that each continuous-time distributed algorithm is a nonlinear networked dynamical system with a skew-symmetric structure, whose state is guaranteed to… Advisors/Committee Members: Tang, Choon Yik (advisor), Cruz, J. R. (committee member), Lakshmivarahan, S. (committee member), Thulasiraman, Krishnaiyan (committee member), Runolfsson, Thordur (committee member).

Subjects/Keywords: Control; Distributed Algorithm; Network System; Dynamic System

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yang, M. (2017). Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/53080

Chicago Manual of Style (16^th Edition):

Yang, Mu. “Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations.” 2017. Doctoral Dissertation, University of Oklahoma. Accessed March 07, 2021. http://hdl.handle.net/11244/53080.

MLA Handbook (7^th Edition):

Yang, Mu. “Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations.” 2017. Web. 07 Mar 2021.

Vancouver:

Yang M. Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations. [Internet] [Doctoral dissertation]. University of Oklahoma; 2017. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/11244/53080.

Council of Science Editors:

Yang M. Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations. [Doctoral Dissertation]. University of Oklahoma; 2017. Available from: http://hdl.handle.net/11244/53080

Penn State University

14. Luo, Rong. Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing.

Degree: 2015, Penn State University

URL: https://submit-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)

Subjects/Keywords: Network Effect; Static and Dynamic Discrete Choice; and Dynamic Pricing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Luo, R. (2015). Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26256

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

Chicago Manual of Style (16^th Edition):

Luo, Rong. “Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing.” 2015. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/26256.

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

MLA Handbook (7^th Edition):

Luo, Rong. “Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing.” 2015. Web. 07 Mar 2021.

Vancouver:

Luo R. Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/26256.

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

Council of Science Editors:

Luo R. Essay on Network Effects, Consumer Demand, and Firms' Dynamic Pricing. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/26256

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

University of Illinois – Chicago

15. 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)

Subjects/Keywords: algorithm; evolutionary clustering; clustering; dynamic community; dynamic network

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Tantipathananandh, Chayant. “Detecting and Tracking Communities in Social Networks.” 2013. Thesis, University of Illinois – Chicago. Accessed March 07, 2021. 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 (7^th Edition):

Tantipathananandh, Chayant. “Detecting and Tracking Communities in Social Networks.” 2013. Web. 07 Mar 2021.

Vancouver:

Tantipathananandh C. Detecting and Tracking Communities in Social Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2021 Mar 07]. 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

Penn State University

16. Vu, Duy Quang. Statistical Models and Algorithms for Large Network Analysis.

Degree: 2012, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/14640

► The emergence and growth of online social media and network services has provided us with new data collection tools to study human behaviors. Traces of… (more)

Subjects/Keywords: network work analysis; survival modeling; dynamic network formation; latent class modeling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Vu, D. Q. (2012). Statistical Models and Algorithms for Large Network Analysis. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/14640

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

Chicago Manual of Style (16^th Edition):

Vu, Duy Quang. “Statistical Models and Algorithms for Large Network Analysis.” 2012. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/14640.

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

MLA Handbook (7^th Edition):

Vu, Duy Quang. “Statistical Models and Algorithms for Large Network Analysis.” 2012. Web. 07 Mar 2021.

Vancouver:

Vu DQ. Statistical Models and Algorithms for Large Network Analysis. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/14640.

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

Council of Science Editors:

Vu DQ. Statistical Models and Algorithms for Large Network Analysis. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/14640

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

UCLA

17. 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)

Subjects/Keywords: Electrical engineering; Cognitive Radio Network; Dynamic Network; Spectrum Sensing; Wireless Communications

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Chen, Chih-Kai. “Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems.” 2012. Thesis, UCLA. Accessed March 07, 2021. 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 (7^th Edition):

Chen, Chih-Kai. “Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems.” 2012. Web. 07 Mar 2021.

Vancouver:

Chen C. Distributed Cooperative Spectrum Sensing for Overlay Self-organizing Dynamic Cognitive Radios Network Systems. [Internet] [Thesis]. UCLA; 2012. [cited 2021 Mar 07]. 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 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)

Subjects/Keywords: GPU; Spatio-Temporal Network; Dynamic Network; High Performance Computation; Visualization

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Purgato, Andrea. “GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks.” 2016. Thesis, University of Illinois – Chicago. Accessed March 07, 2021. 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 (7^th Edition):

Purgato, Andrea. “GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks.” 2016. Web. 07 Mar 2021.

Vancouver:

Purgato A. GPU Acceleration and Interactive Visualization for Spatio-Temporal Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Mar 07]. 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

University of Washington

19. 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)

Subjects/Keywords: Degeneracy; Dynamic network; Exponential Random Graph Model; Social network; Statistics; statistics

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 March 07, 2021. http://hdl.handle.net/1773/34190.

MLA Handbook (7^th Edition):

Li, Ke. “Degeneracy, Duration, and Co-evolution: Extending Exponential Random Graph Models (ERGM) for Social Network Analysis.” 2015. Web. 07 Mar 2021.

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 2021 Mar 07]. 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

University of Texas – Austin

20. -9138-510X. Data-driven placement of centroid connectors in dynamic traffic assignment.

Degree: MSin Engineering, Civil engineering, 2016, University of Texas – Austin

URL: http://hdl.handle.net/2152/41749

► Recent technological advances allows transportation engineering professions to collect, share, and handle unprecedented quantities of data, which has the potential to transform current transportation planning… (more)

▼ Recent technological advances allows transportation engineering professions to collect, share, and handle unprecedented quantities of data, which has the potential to transform current transportation planning paradigms. In the immediate future, data can be used to improve the precision and capabilities of existing transportation network modeling frameworks. Parcel data is a large, readily available data source that represents the location of public lands, businesses, and residences and is frequently used by government and businesses for land use and zoning decisions. This thesis looks at the viability of using parcel data to inform static traffic assignment (STA) and dynamic traffic assignment (DTA) connector placement in a medium sized network in the Austin, TX region. Simulation-based DTA models are particularly sensitive to the topological detail of the traffic network, including the location of centroid connectors. Traditional centroid connector placement strategies may lead to excessive congestion and unrealistic traffic patterns, while manual network refinement is prohibitive in large regional models. In this thesis, parcel-level data is used to both allocate travel demand between two sub-regions in each considered traffic analysis zone and to select appropriate nodes for the centroid connector placement. Numerical experiments suggest that the proposed approach better approximates both corridor travel times and traffic counts throughout the network, with improvements of more than 40 percent in travel time estimation accuracy, and 12 percent in traffic count estimation. Additionally, the scenarios that best matched count and travel time data were the scenarios that had the highest average parcel density per entry/exit node, indicating that parcel data is an acceptable proxy for high demand points in the network. When applied in STA, the results were not quite as promising. Although this methodology was able to improve the utilization of lower capacity links, the results ultimately did not better resemble volume count data. However, this does represent a simple, transparent, and data-driven approach for centroid connector placement in static traffic assignment that performs as well as traditional methods. Advisors/Committee Members: Boyles, Stephen David, 1982- (advisor), Gemar, Mason D (committee member).

Subjects/Keywords: Dynamic traffic assignment; Centroid connectors; Network modeling; Network loading

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

-9138-510X. (2016). Data-driven placement of centroid connectors in dynamic traffic assignment. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/41749

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

-9138-510X. “Data-driven placement of centroid connectors in dynamic traffic assignment.” 2016. Masters Thesis, University of Texas – Austin. Accessed March 07, 2021. http://hdl.handle.net/2152/41749.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

-9138-510X. “Data-driven placement of centroid connectors in dynamic traffic assignment.” 2016. Web. 07 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-9138-510X. Data-driven placement of centroid connectors in dynamic traffic assignment. [Internet] [Masters thesis]. University of Texas – Austin; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2152/41749.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-9138-510X. Data-driven placement of centroid connectors in dynamic traffic assignment. [Masters Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/41749

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Colorado State University

21. Fagan, Jesse M. Evolution of community structure in the system of global environmental governance.

Degree: MA, Sociology, 2011, Colorado State University

URL: http://hdl.handle.net/10217/47269

► Self-organization can arise in systems where actors interact in non-trivial ways and adapt their rule-sets in response to their environment. In the global system of… (more)

Subjects/Keywords: community structure; social network analysis; network analysis; international environmental treaties; dynamic network

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fagan, J. M. (2011). Evolution of community structure in the system of global environmental governance. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/47269

Chicago Manual of Style (16^th Edition):

Fagan, Jesse M. “Evolution of community structure in the system of global environmental governance.” 2011. Masters Thesis, Colorado State University. Accessed March 07, 2021. http://hdl.handle.net/10217/47269.

MLA Handbook (7^th Edition):

Fagan, Jesse M. “Evolution of community structure in the system of global environmental governance.” 2011. Web. 07 Mar 2021.

Vancouver:

Fagan JM. Evolution of community structure in the system of global environmental governance. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10217/47269.

Council of Science Editors:

Fagan JM. Evolution of community structure in the system of global environmental governance. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/47269

Georgia Tech

22. 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

❌

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

APA (6^th 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 (16^th Edition):

Marshall, Luke J. “Dynamic and continuous-time service network design.” 2018. Doctoral Dissertation, Georgia Tech. Accessed March 07, 2021. http://hdl.handle.net/1853/59843.

MLA Handbook (7^th Edition):

Marshall, Luke J. “Dynamic and continuous-time service network design.” 2018. Web. 07 Mar 2021.

Vancouver:

Marshall LJ. Dynamic and continuous-time service network design. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Mar 07]. 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

Penn State University

23. Park, Kijung. Characterization and Modeling of Product Family Evolution.

Degree: 2017, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/13912kzp5116

► Products continuously change over time to satisfy new customer needs and technologies. This successive emergence of new products within a product family can be considered… (more)

▼ Products continuously change over time to satisfy new customer needs and technologies. This successive emergence of new products within a product family can be considered as product family evolution, which is derived from inherent evolving properties and adaptation to dynamic product environments. Although product family design has been widely discussed, product family evolution has not been sufficiently explored in an analytical manner. To tackle this issue, this research aims to demonstrate the underlying properties of product family evolution and to model the process of product family evolution. The methodology of this research is based on a network science approach and consists of two phases: 1) characterization of product family evolution and 2) modeling of product family evolution. In the first phase, a network representation for product family architectures is devised to effectively describe relationships between components. Then, topological properties and significant network motifs in the product family network at each time period are investigated through a case study using the smartphone models of a major company. The results show that both individual product and product family networks follow the properties observed in other real networks. The network properties and significant motifs of the individual smartphone networks suggest that the individual product structure grows as a scale-free network with common building blocks. On the other hand, the smartphone product family network evolves with both scale-free and small-world properties due to commonality in a product family. Also, the product family network changes with common and specific motifs during each specific time duration. In the second phase, the complex adaptive process of product family evolution is simplified and modeled to estimate configurational changes in product family architecture design. In this model, evolution modes embedding specific variant generation mechanisms are realized through a mixed-strategy game theory and an evolving network model - fitness model. For the proposed product family evolution model, illustrative examples are introduced to describe the dynamic configuration process of a product family structure. Finally, evolutionary opportunities for product and product family design focusing on the universality of network properties are addressed from the perspectives of topological robustness and complexity. From theoretical and empirical evidences, it is identified that a design structure with scale-free network topology and commonality has topological robustness since it has less complexity in structural connectivity and variety. Given the increasing awareness of dynamic product environment, this research serves as a foundation for the analysis of product family evolution. Advisors/Committee Members: Gül E. Okudan Kremer, Dissertation Advisor/Co-Advisor, Gül E. Okudan Kremer, Committee Chair/Co-Chair, Soundar R. T. Kumara, Committee Member, Conrad S. Tucker, Committee Member, Réka Albert, Outside Member.

Subjects/Keywords: Product Family Evolution; Product Family Design; Product Family Architecture Network; Network Science; Network Characterization; Dynamic Network Modeling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Park, K. (2017). Characterization and Modeling of Product Family Evolution. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/13912kzp5116

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

Chicago Manual of Style (16^th Edition):

Park, Kijung. “Characterization and Modeling of Product Family Evolution.” 2017. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/13912kzp5116.

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

MLA Handbook (7^th Edition):

Park, Kijung. “Characterization and Modeling of Product Family Evolution.” 2017. Web. 07 Mar 2021.

Vancouver:

Park K. Characterization and Modeling of Product Family Evolution. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/13912kzp5116.

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

Council of Science Editors:

Park K. Characterization and Modeling of Product Family Evolution. [Thesis]. Penn State University; 2017. Available from: https://submit-etda.libraries.psu.edu/catalog/13912kzp5116

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

NSYSU

24. 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

❌

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

APA (6^th 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 (16^th 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 March 07, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721110-202637.

MLA Handbook (7^th Edition):

Ho, Po-cheng. “The Study of Dynamic Agglomeration Externalities in Taiwan Manufacturing Industries:An Application for Dynamic Network DEA.” 2010. Web. 07 Mar 2021.

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 2021 Mar 07]. 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

25. Steinway, Steven Nathaniel. Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease.

Degree: 2015, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/24852

► Biology is incredibly complex – at the molecular, cellular, tissue, and population level, there exists a tremendous number of discrete interacting components tightly regulating the… (more)

▼ Biology is incredibly complex – at the molecular, cellular, tissue, and population level, there exists a tremendous number of discrete interacting components tightly regulating the processes that sustain life. Biological systems have traditionally been viewed in a reductionist manner often literally (and metaphorically) through a magnifying glass, leading to insight into how the individual parts work. Network theory, on the other hand, can be used to put the pieces together, to understand how complex and emergent behaviors arise from the totality of interactions in complex systems, such as those seen in biology. Network theory is the study of systems of discrete interacting components and provides a framework for understanding complex systems. A network-focused investigation of a complex biological system allows for the understanding of the system’s emergent properties, for example its function and dynamics. Network dynamics are of particular interest biologically because biological systems are not static but are constantly changing in response to perturbations and environmental stimuli in space and time. Systems level biological analysis has been aided by the recent explosion of high throughput data. This has led to an abundance of quantitative and qualitative information related to the activation of biological systems, but frequently there is still a paucity of kinetic and temporal information. Discrete dynamic modeling provides a means to create predictive models of biological systems by integrating fragmentary and qualitative interaction information. Using discrete dynamic modeling, a structural (static) network of biological regulatory relationships can be translated into a mathematical model without the use of kinetic parameters. This model can describe the dynamics of a biological system (i.e. how it changes over time), both in normal and in perturbation (e.g. disease) scenarios. In this dissertation we present the application of network theory and discrete dynamic modeling integrated with experimental laboratory analysis to understand biological diseases in three contexts. The first is the construction of a network model of epidermal derived growth factor receptor (EGFR) signaling in cancer. We translate this model into two types of discrete models: a Boolean model and a three-state model. We show how the effects of an EGFR inhibitor (such as the drug gefitinib) can suppress tumor growth, and we model how genomic variants can augment the effect of EGFR inhibition in tumor growth. Importantly, we compare discrete modeling outcomes to an alternative modeling framework, which relies on detailed kinetic information, called ordinary differential equation (ODE) modeling and show that both models achieve similar findings. Our results demonstrate that discrete dynamic model can accurately model biomedical systems and make important predictions about the effect a drug will have on a disease (e.g. tumor growth) in the context of various perturbations. Importantly, discrete dynamic models can be employed in the… Advisors/Committee Members: Reka Z Albert, Dissertation Advisor/Co-Advisor, "Thomas P Loughran, Jr", Dissertation Advisor/Co-Advisor, Reka Z Albert, Committee Chair/Co-Chair, David J Feith, Committee Member, James Riley Broach, Committee Member, Diane M Thiboutot, Committee Member.

Subjects/Keywords: Network analysis; dynamic modeling; discrete dynamic modeling; cancer; microbiome; tumor invasion & metastasis

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Steinway, S. N. (2015). Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/24852

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

Chicago Manual of Style (16^th Edition):

Steinway, Steven Nathaniel. “Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease.” 2015. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/24852.

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

MLA Handbook (7^th Edition):

Steinway, Steven Nathaniel. “Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease.” 2015. Web. 07 Mar 2021.

Vancouver:

Steinway SN. Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/24852.

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

Council of Science Editors:

Steinway SN. Predictive Network Modeling And Experimentation In Complex Biological Systems: Applications To Cancer And Infectious Disease. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/24852

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

Penn State University

26. Meimand Kermani, Amir Hossein. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.

Degree: 2013, Penn State University

URL: https://submit-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 brie‡y 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 problem’s 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. Advisors/Committee Members: Terry Lee Friesz, Dissertation Advisor/Co-Advisor, Terry Lee Friesz, Committee Chair/Co-Chair, Venkataraman Shankar, Committee Chair/Co-Chair, Tao Yao, Committee Member, Soundar Kumara, Committee Member, Alberto Bressan, Committee Member.

Subjects/Keywords: DYNAMIC GAMES; STACKELBERG GAMES; DIFFERENTIAL GAMES; DYNAMIC PRICING; PRODUCTION PLANNING NETWORK DESIGN; LOGISTICS

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Meimand Kermani, A. H. (2013). DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/18978

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

Chicago Manual of Style (16^th Edition):

Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.” 2013. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/18978.

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

MLA Handbook (7^th Edition):

Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.” 2013. Web. 07 Mar 2021.

Vancouver:

Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/18978.

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

Council of Science Editors:

Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/18978

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

Anna University

27. 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)

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

❌

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

APA (6^th 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 (16^th Edition):

Sivaganesan, D. “Certain investigations on the broadcasting in clustered mobile Ad Hoc networks; -.” 2014. Thesis, Anna University. Accessed March 07, 2021. 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 (7^th Edition):

Sivaganesan, D. “Certain investigations on the broadcasting in clustered mobile Ad Hoc networks; -.” 2014. Web. 07 Mar 2021.

Vancouver:

Sivaganesan D. Certain investigations on the broadcasting in clustered mobile Ad Hoc networks; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Mar 07]. 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

The Ohio State University

28. Kim, Woojin. The Persistent Topology of Dynamic Data.

Degree: PhD, Mathematics, 2020, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1587503336988272

► We refine the theoretical foundations of Topological Data Analysis (TDA) for the multiscale analysis of dynamic topology, such as dynamic metric spaces or dynamic networks.… (more)

Subjects/Keywords: Mathematics; dynamic metric space; dynamic network; dynamic topology; spatiotemporal persistent homology; formigram; topological data analysis; persistence diagram

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kim, W. (2020). The Persistent Topology of Dynamic Data. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1587503336988272

Chicago Manual of Style (16^th Edition):

Kim, Woojin. “The Persistent Topology of Dynamic Data.” 2020. Doctoral Dissertation, The Ohio State University. Accessed March 07, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587503336988272.

MLA Handbook (7^th Edition):

Kim, Woojin. “The Persistent Topology of Dynamic Data.” 2020. Web. 07 Mar 2021.

Vancouver:

Kim W. The Persistent Topology of Dynamic Data. [Internet] [Doctoral dissertation]. The Ohio State University; 2020. [cited 2021 Mar 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1587503336988272.

Council of Science Editors:

Kim W. The Persistent Topology of Dynamic Data. [Doctoral Dissertation]. The Ohio State University; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1587503336988272

University of Rochester

29. 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

❌

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

APA (6^th 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 (16^th Edition):

Meng, Yuan (1988 - ). “Poly(capro-lactone) networks as actively moving polymers.” 2016. Doctoral Dissertation, University of Rochester. Accessed March 07, 2021. http://hdl.handle.net/1802/31452.

MLA Handbook (7^th Edition):

Meng, Yuan (1988 - ). “Poly(capro-lactone) networks as actively moving polymers.” 2016. Web. 07 Mar 2021.

Vancouver:

Meng Y(-). Poly(capro-lactone) networks as actively moving polymers. [Internet] [Doctoral dissertation]. University of Rochester; 2016. [cited 2021 Mar 07]. 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 Michigan

30. Oselio, Brandon. Models and Inference with Network Structure.

Degree: PhD, Electrical Engineering: Systems, 2019, University of Michigan

URL: http://hdl.handle.net/2027.42/153433

► In this thesis, the focus is on data that has network structure and on problems that benefit from the application of network-based algorithms. We target… (more)

Subjects/Keywords: network data; exchangeability; dynamic networks; network inference; meta learning; Bayes error rate; Electrical Engineering; Engineering

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Oselio, B. (2019). Models and Inference with Network Structure. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/153433

Chicago Manual of Style (16^th Edition):

Oselio, Brandon. “Models and Inference with Network Structure.” 2019. Doctoral Dissertation, University of Michigan. Accessed March 07, 2021. http://hdl.handle.net/2027.42/153433.

MLA Handbook (7^th Edition):

Oselio, Brandon. “Models and Inference with Network Structure.” 2019. Web. 07 Mar 2021.

Vancouver:

Oselio B. Models and Inference with Network Structure. [Internet] [Doctoral dissertation]. University of Michigan; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2027.42/153433.

Council of Science Editors:

Oselio B. Models and Inference with Network Structure. [Doctoral Dissertation]. University of Michigan; 2019. Available from: http://hdl.handle.net/2027.42/153433

Open Access Theses and Dissertations