Matching Items (101)
Description
Intellectual property (IP) is the lifeblood of the U.S. economy. Despite being an important motivator for innovation, IP laws and IP protections are largely unknown by most individuals outside of the legal field. The purpose of this work is to condense some of the most fundamental concepts in U.S. intellectual property law and describe them in an understandable way for non-lawyers. This thesis covers basic information on U.S. patents, copyrights, trademarks, trade secrets, and the ways in which they impact both science and society. Additionally, this thesis discusses the need for better IP education and presents a solution to this problem in the form of a partly completed draft for an educational book. The book itself is meant to illustrate how the research of this thesis can be utilized in introductory educational materials while also demonstrating the potential for presenting IP law concepts in a fun and visual way.
ContributorsFarmer, Bethany (Author) / Blanks, Zachary (Co-author) / Martin, Thomas (Thesis director) / Prosser, Eric (Committee member) / Irving, Tom (Committee member) / Barrett, The Honors College (Contributor) / Dean, W.P. Carey School of Business (Contributor)
Created2023-05
Description
Intellectual property (IP) is the lifeblood of the U.S. economy. Despite being an important motivator for innovation, IP laws and IP protections are largely unknown by most individuals outside of the legal field. The purpose of this work is to condense some of the most fundamental concepts in U.S. intellectual property law and describe them in an understandable way for non-lawyers. This thesis covers basic information on U.S. patents, copyrights, trademarks, trade secrets, and the ways in which they impact both science and society. Additionally, this thesis discusses the need for better IP education and presents a solution to this problem in the form of a partly completed draft for an educational book. The book itself is meant to illustrate how the research of this thesis can be utilized in introductory educational materials while also demonstrating the potential for presenting IP law concepts in a fun and visual way.
ContributorsBlanks, Zachary (Author) / Farmer, Bethany (Co-author) / Martin, Thomas (Thesis director) / Prosser, Eric (Committee member) / Irving, Tom (Committee member) / Barrett, The Honors College (Contributor) / School of Molecular Sciences (Contributor)
Created2023-05
Description
Massive glycerol cluster ions with many charges (~ 106 Da, ~ ±100 charges) have been generated by electrospray to bombard biomolecules and biological sample surfaces. The low impact energy per nucleon facilitates intact sputtering and ionization of biomolecules which can be subsequently imaged. Various lipids, peptides and proteins have been studied. The primary cluster ion source has been coupled with an ion-microscope imaging mass spectrometer (TRIFT-1, Physical Electronics). A lateral resolution of ~3µm has been demonstrated, which is acceptable for sub-cellular imaging of animal cells (e.g. single cancer cell imaging in early diagnosis). Since the available amount of target molecules per pixel is limited in biological samples, the measurement of useful ion yields (ratio of detected molecular ion counts to the sample molecules sputtered) is important to determine whether enough ion counts per pixel can be obtained. The useful ion yields of several lipids and peptides are in the 1-3×10-5 range. A 3×3 µm2lipid bilayer can produce ~260 counts/pixel for a meaningful 3×3 µm2 pixel ion image. This method can probably be used in cell imaging in the future, when there is a change in the lipid contents of the cell membrane (e.g. cancer cells vs. normal cells).
ContributorsZhang, Jitao (Author) / Williams, Peter (Thesis advisor) / Hayes, Mark (Committee member) / Nelson, Randall (Committee member) / Arizona State University (Publisher)
Created2015
Description
The research on the topology and dynamics of complex networks is one of the most focused area in complex system science. The goals are to structure our understanding of the real-world social, economical, technological, and biological systems in the aspect of networks consisting a large number of interacting units and to develop corresponding detection, prediction, and control strategies. In this highly interdisciplinary field, my research mainly concentrates on universal estimation schemes, physical controllability, as well as mechanisms behind extreme events and cascading failure for complex networked systems.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
ContributorsChen, Yuzhong (Author) / Lai, Ying-Cheng (Thesis advisor) / Spanias, Andreas (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Ying, Lei (Committee member) / Arizona State University (Publisher)
Created2016
Description
The purpose of information source detection problem (or called rumor source detection) is to identify the source of information diffusion in networks based on available observations like the states of the nodes and the timestamps at which nodes adopted the information (or called infected). The solution of the problem can be used to answer a wide range of important questions in epidemiology, computer network security, etc. This dissertation studies the fundamental theory and the design of efficient and robust algorithms for the information source detection problem.
For tree networks, the maximum a posterior (MAP) estimator of the information source is derived under the independent cascades (IC) model with a complete snapshot and a Short-Fat Tree (SFT) algorithm is proposed for general networks based on the MAP estimator. Furthermore, the following possibility and impossibility results are established on the Erdos-Renyi (ER) random graph: $(i)$ when the infection duration $<\frac{2}{3}t_u,$ SFT identifies the source with probability one asymptotically, where $t_u=\left\lceil\frac{\log n}{\log \mu}\right\rceil+2$ and $\mu$ is the average node degree, $(ii)$ when the infection duration $>t_u,$ the probability of identifying the source approaches zero asymptotically under any algorithm; and $(iii)$ when infection duration $
In practice, other than the nodes' states, side information like partial timestamps may also be available. Such information provides important insights of the diffusion process. To utilize the partial timestamps, the information source detection problem is formulated as a ranking problem on graphs and two ranking algorithms, cost-based ranking (CR) and tree-based ranking (TR), are proposed. Extensive experimental evaluations of synthetic data of different diffusion models and real world data demonstrate the effectiveness and robustness of CR and TR compared with existing algorithms.
For tree networks, the maximum a posterior (MAP) estimator of the information source is derived under the independent cascades (IC) model with a complete snapshot and a Short-Fat Tree (SFT) algorithm is proposed for general networks based on the MAP estimator. Furthermore, the following possibility and impossibility results are established on the Erdos-Renyi (ER) random graph: $(i)$ when the infection duration $<\frac{2}{3}t_u,$ SFT identifies the source with probability one asymptotically, where $t_u=\left\lceil\frac{\log n}{\log \mu}\right\rceil+2$ and $\mu$ is the average node degree, $(ii)$ when the infection duration $>t_u,$ the probability of identifying the source approaches zero asymptotically under any algorithm; and $(iii)$ when infection duration $
In practice, other than the nodes' states, side information like partial timestamps may also be available. Such information provides important insights of the diffusion process. To utilize the partial timestamps, the information source detection problem is formulated as a ranking problem on graphs and two ranking algorithms, cost-based ranking (CR) and tree-based ranking (TR), are proposed. Extensive experimental evaluations of synthetic data of different diffusion models and real world data demonstrate the effectiveness and robustness of CR and TR compared with existing algorithms.
ContributorsZhu, Kai (Author) / Ying, Lei (Thesis advisor) / Lai, Ying-Cheng (Committee member) / Liu, Huan (Committee member) / Shakarian, Paulo (Committee member) / Arizona State University (Publisher)
Created2015
Description
Cell heterogeneity is widely present in the biological world and exists even in an isogenic population. Resolving the protein heterogeneity at the single cell level is of enormous biological and clinical relevance. However, single cell protein analysis has proven to be challenging due to extremely low amount of protein in a single cell and the huge complexity of proteome. This requires appropriate sampling and sensitive detection techniques. Here, a new approach, microfluidics combined with MALDI-TOF mass spectrometry was brought forward, for the analysis of proteins in single cells. The detection sensitivity of peptides as low as 300 molecules and of proteins as low as 10^6 molecules has been demonstrated. Furthermore, an immunoassay was successfully integrated in the microfluidic device for capturing the proteins of interest and further identifying them by subsequent enzymatic digestion. Moreover, an improved microfluidic platform was designed with separate chambers and valves, allowing the absolute quantification by employing iTRAQ tags or an isotopically labeled peptide. The study was further extended to analyze a protein in MCF-7 cell lysate. The approach capable of identifying and quantifying protein molecules in MCF-7 cells is promising for future proteomic studies at the single cell level.
ContributorsYang, Mian (Author) / Ros, Alexandra (Thesis advisor) / Hayes, Mark (Committee member) / Nelson, Randall (Committee member) / Arizona State University (Publisher)
Created2016
Description
Conductance fluctuations associated with quantum transport through quantumdot systems are currently understood to depend on the nature of the corresponding classical dynamics, i.e., integrable or chaotic. There are a couple of interesting phenomena about conductance fluctuation and quantum tunneling related to geometrical shapes of graphene systems. Firstly, in graphene quantum-dot systems, when a magnetic field is present, as the Fermi energy or the magnetic flux is varied, both regular oscillations and random fluctuations in the conductance can occur, with alternating transitions between the two. Secondly, a scheme based on geometrical rotation of rectangular devices to effectively modulate the conductance fluctuations is presented. Thirdly, when graphene is placed on a substrate of heavy metal, Rashba spin-orbit interaction of substantial strength can occur. In an open system such as a quantum dot, the interaction can induce spin polarization. Finally, a problem using graphene systems with electron-electron interactions described by the Hubbard Hamiltonian in the setting of resonant tunneling is investigated.
Another interesting problem in quantum transport is the effect of disorder or random impurities since it is inevitable in real experiments. At first, for a twodimensional Dirac ring, as the disorder density is systematically increased, the persistent current decreases slowly initially and then plateaus at a finite nonzero value, indicating remarkable robustness of the persistent currents, which cannot be discovered in normal metal and semiconductor rings. In addition, in a Floquet system with a ribbon structure, the conductance can be remarkably enhanced by onsite disorder.
Recent years have witnessed significant interest in nanoscale physical systems, such as semiconductor supperlattices and optomechanical systems, which can exhibit distinct collective dynamical behaviors. Firstly, a system of two optically coupled optomechanical cavities is considered and the phenomenon of synchronization transition associated with quantum entanglement transition is discovered. Another useful issue is nonlinear dynamics in semiconductor superlattices caused by its key potential application lies in generating radiation sources, amplifiers and detectors in the spectral range of terahertz. In such a system, transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt.
Another interesting problem in quantum transport is the effect of disorder or random impurities since it is inevitable in real experiments. At first, for a twodimensional Dirac ring, as the disorder density is systematically increased, the persistent current decreases slowly initially and then plateaus at a finite nonzero value, indicating remarkable robustness of the persistent currents, which cannot be discovered in normal metal and semiconductor rings. In addition, in a Floquet system with a ribbon structure, the conductance can be remarkably enhanced by onsite disorder.
Recent years have witnessed significant interest in nanoscale physical systems, such as semiconductor supperlattices and optomechanical systems, which can exhibit distinct collective dynamical behaviors. Firstly, a system of two optically coupled optomechanical cavities is considered and the phenomenon of synchronization transition associated with quantum entanglement transition is discovered. Another useful issue is nonlinear dynamics in semiconductor superlattices caused by its key potential application lies in generating radiation sources, amplifiers and detectors in the spectral range of terahertz. In such a system, transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt.
ContributorsYing, Lei (Author) / Lai, Ying-Cheng (Thesis advisor) / Vasileska, Dragica (Committee member) / Chen, Tingyong (Committee member) / Yao, Yu (Committee member) / Arizona State University (Publisher)
Created2016
Description
This dissertation treats a number of related problems in control and data analysis of complex networks.
First, in existing linear controllability frameworks, the ability to steer a network from any initiate state toward any desired state is measured by the minimum number of driver nodes. However, the associated optimal control energy can become unbearably large, preventing actual control from being realized. Here I develop a physical controllability framework and propose strategies to turn physically uncontrollable networks into physically controllable ones. I also discover that although full control can be guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control energy to achieve actual control, and my work provides a framework to address this issue.
Second, in spite of recent progresses in linear controllability, controlling nonlinear dynamical networks remains an outstanding problem. Here I develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another. I introduce the concept of attractor network and formulate a quantifiable framework: a network is more controllable if the attractor network is more strongly connected. I test the control framework using examples from various models and demonstrate the beneficial role of noise in facilitating control.
Third, I analyze large data sets from a diverse online social networking (OSN) systems and find that the growth dynamics of meme popularity exhibit characteristically different behaviors: linear, “S”-shape and exponential growths. Inspired by cell population growth model in microbial ecology, I construct a base growth model for meme popularity in OSNs. Then I incorporate human interest dynamics into the base model and propose a hybrid model which contains a small number of free parameters. The model successfully predicts the various distinct meme growth dynamics.
At last, I propose a nonlinear dynamics model to characterize the controlling of WNT signaling pathway in the differentiation of neural progenitor cells. The model is able to predict experiment results and shed light on the understanding of WNT regulation mechanisms.
First, in existing linear controllability frameworks, the ability to steer a network from any initiate state toward any desired state is measured by the minimum number of driver nodes. However, the associated optimal control energy can become unbearably large, preventing actual control from being realized. Here I develop a physical controllability framework and propose strategies to turn physically uncontrollable networks into physically controllable ones. I also discover that although full control can be guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control energy to achieve actual control, and my work provides a framework to address this issue.
Second, in spite of recent progresses in linear controllability, controlling nonlinear dynamical networks remains an outstanding problem. Here I develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another. I introduce the concept of attractor network and formulate a quantifiable framework: a network is more controllable if the attractor network is more strongly connected. I test the control framework using examples from various models and demonstrate the beneficial role of noise in facilitating control.
Third, I analyze large data sets from a diverse online social networking (OSN) systems and find that the growth dynamics of meme popularity exhibit characteristically different behaviors: linear, “S”-shape and exponential growths. Inspired by cell population growth model in microbial ecology, I construct a base growth model for meme popularity in OSNs. Then I incorporate human interest dynamics into the base model and propose a hybrid model which contains a small number of free parameters. The model successfully predicts the various distinct meme growth dynamics.
At last, I propose a nonlinear dynamics model to characterize the controlling of WNT signaling pathway in the differentiation of neural progenitor cells. The model is able to predict experiment results and shed light on the understanding of WNT regulation mechanisms.
ContributorsWang, Lezhi (Author) / Lai, Ying-Cheng (Thesis advisor) / Wang, Xiao (Thesis advisor) / Papandreoou-Suppappola, Antonia (Committee member) / Brafman, David (Committee member) / Arizona State University (Publisher)
Created2017
Description
Online social media is popular due to its real-time nature, extensive connectivity and a large user base. This motivates users to employ social media for seeking information by reaching out to their large number of social connections. Information seeking can manifest in the form of requests for personal and time-critical information or gathering perspectives on important issues. Social media platforms are not designed for resource seeking and experience large volumes of messages, leading to requests not being fulfilled satisfactorily. Designing frameworks to facilitate efficient information seeking in social media will help users to obtain appropriate assistance for their needs
and help platforms to increase user satisfaction.
Several challenges exist in the way of facilitating information seeking in social media. First, the characteristics affecting the user’s response time for a question are not known, making it hard to identify prompt responders. Second, the social context in which the user has asked the question has to be determined to find personalized responders. Third, users employ rhetorical requests, which are statements having the
syntax of questions, and systems assisting information seeking might be hindered from focusing on genuine questions. Fouth, social media advocates of political campaigns employ nuanced strategies to prevent users from obtaining balanced perspectives on
issues of public importance.
Sociological and linguistic studies on user behavior while making or responding to information seeking requests provides concepts drawing from which we can address these challenges. We propose methods to estimate the response time of the user for a given question to identify prompt responders. We compute the question specific social context an asker shares with his social connections to identify personalized responders. We draw from theories of political mobilization to model the behaviors arising from the strategies of people trying to skew perspectives. We identify rhetorical questions by modeling user motivations to post them.
and help platforms to increase user satisfaction.
Several challenges exist in the way of facilitating information seeking in social media. First, the characteristics affecting the user’s response time for a question are not known, making it hard to identify prompt responders. Second, the social context in which the user has asked the question has to be determined to find personalized responders. Third, users employ rhetorical requests, which are statements having the
syntax of questions, and systems assisting information seeking might be hindered from focusing on genuine questions. Fouth, social media advocates of political campaigns employ nuanced strategies to prevent users from obtaining balanced perspectives on
issues of public importance.
Sociological and linguistic studies on user behavior while making or responding to information seeking requests provides concepts drawing from which we can address these challenges. We propose methods to estimate the response time of the user for a given question to identify prompt responders. We compute the question specific social context an asker shares with his social connections to identify personalized responders. We draw from theories of political mobilization to model the behaviors arising from the strategies of people trying to skew perspectives. We identify rhetorical questions by modeling user motivations to post them.
ContributorsRanganath, Suhas (Author) / Liu, Huan (Thesis advisor) / Lai, Ying-Cheng (Thesis advisor) / Tong, Hanghang (Committee member) / Vaculin, Roman (Committee member) / Arizona State University (Publisher)
Created2017
Description
Resilience is emerging as the preferred way to improve the protection of infrastructure systems beyond established risk management practices. Massive damages experienced during tragedies like Hurricane Katrina showed that risk analysis is incapable to prevent unforeseen infrastructure failures and shifted expert focus towards resilience to absorb and recover from adverse events. Recent, exponential growth in research is now producing consensus on how to think about infrastructure resilience centered on definitions and models from influential organizations like the US National Academy of Sciences. Despite widespread efforts, massive infrastructure failures in 2017 demonstrate that resilience is still not working, raising the question: Are the ways people think about resilience producing resilient infrastructure systems?
This dissertation argues that established thinking harbors misconceptions about infrastructure systems that diminish attempts to improve their resilience. Widespread efforts based on the current canon focus on improving data analytics, establishing resilience goals, reducing failure probabilities, and measuring cascading losses. Unfortunately, none of these pursuits change the resilience of an infrastructure system, because none of them result in knowledge about how data is used, goals are set, or failures occur. Through the examination of each misconception, this dissertation results in practical, new approaches for infrastructure systems to respond to unforeseen failures via sensing, adapting, and anticipating processes. Specifically, infrastructure resilience is improved by sensing when data analytics include the modeler-in-the-loop, adapting to stress contexts by switching between multiple resilience strategies, and anticipating crisis coordination activities prior to experiencing a failure.
Overall, results demonstrate that current resilience thinking needs to change because it does not differentiate resilience from risk. The majority of research thinks resilience is a property that a system has, like a noun, when resilience is really an action a system does, like a verb. Treating resilience as a noun only strengthens commitment to risk-based practices that do not protect infrastructure from unknown events. Instead, switching to thinking about resilience as a verb overcomes prevalent misconceptions about data, goals, systems, and failures, and may bring a necessary, radical change to the way infrastructure is protected in the future.
This dissertation argues that established thinking harbors misconceptions about infrastructure systems that diminish attempts to improve their resilience. Widespread efforts based on the current canon focus on improving data analytics, establishing resilience goals, reducing failure probabilities, and measuring cascading losses. Unfortunately, none of these pursuits change the resilience of an infrastructure system, because none of them result in knowledge about how data is used, goals are set, or failures occur. Through the examination of each misconception, this dissertation results in practical, new approaches for infrastructure systems to respond to unforeseen failures via sensing, adapting, and anticipating processes. Specifically, infrastructure resilience is improved by sensing when data analytics include the modeler-in-the-loop, adapting to stress contexts by switching between multiple resilience strategies, and anticipating crisis coordination activities prior to experiencing a failure.
Overall, results demonstrate that current resilience thinking needs to change because it does not differentiate resilience from risk. The majority of research thinks resilience is a property that a system has, like a noun, when resilience is really an action a system does, like a verb. Treating resilience as a noun only strengthens commitment to risk-based practices that do not protect infrastructure from unknown events. Instead, switching to thinking about resilience as a verb overcomes prevalent misconceptions about data, goals, systems, and failures, and may bring a necessary, radical change to the way infrastructure is protected in the future.
ContributorsEisenberg, Daniel Alexander (Author) / Seager, Thomas P. (Thesis advisor) / Park, Jeryang (Thesis advisor) / Alderson, David L. (Committee member) / Lai, Ying-Cheng (Committee member) / Arizona State University (Publisher)
Created2018