Christopher Griffin | The Pennsylvania State University (original) (raw)
Uploads
Papers by Christopher Griffin
U.S. Department of Energy Office of Scientific and Technical Information - OSTI OAI, Jun 1, 2008
Horticulture Research
The capacity of plants to resist abiotic stresses is of great importance to agricultural, ecologi... more The capacity of plants to resist abiotic stresses is of great importance to agricultural, ecological and environmental sustainability, but little is known about its genetic underpinnings. Existing genetic tools can identify individual genetic variants mediating biochemical, physiological, and cellular defenses, but fail to chart an overall genetic atlas behind stress resistance. We view stress response as an eco-evo-devo process by which plants adaptively respond to stress through complex interactions of developmental canalization, phenotypic plasticity, and phenotypic integration. As such, we define and quantify stress response as the developmental change of adaptive traits from stress-free to stress-exposed environments. We integrate composite functional mapping and evolutionary game theory to reconstruct omnigenic, information-flow interaction networks for stress response. Using desert-adapted Euphrates poplar as an example, we infer salt resistance-related genome-wide interactom...
Physica A: Statistical Mechanics and its Applications, 2020
In this paper, we study the problem of determining a minimum state probabilistic finite state mac... more In this paper, we study the problem of determining a minimum state probabilistic finite state machine capable of generating statistically identical symbol sequences to samples provided. This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) An algorithm for pattern discovery in time series. Technical Report 02-10-060, Santa Fe Institute. arxiv.org/abs/cs.LG/0210025. We show that the underlying problem is NP-hard and thus all existing polynomial time algorithms must be approximations on finite data sets. Using our NP-hardness proof, we show how to construct a provably correct algorithm for constructing a minimum state probabilistic finite state machine given data and empirically study its running time.
. We show that the underlying problem is mathrmNP\mathrm{NP}mathrmNP-hard and thus all existing polynomial time... more . We show that the underlying problem is mathrmNP\mathrm{NP}mathrmNP-hard and thus all existing polynomial time algorithms must be approximations on finite data sets. Using our mathrmNP\mathrm{NP}mathrmNP-hardness proof, we show how to construct a provably correct algorithm for constructing a minimum state probabilistic finite state machine given data and empirically study its running time.
2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing, 2011
2012 IEEE Symposium on Security and Privacy Workshops, 2012
We show a simple method for constructing an infinite family of graph formation games with link bi... more We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a pairwise stable solution, a graph with an arbitrarily specified degree distribution. Pairwise stability is used as the equilibrium condition over the more commonly used Nash equilibrium to prevent the occurrence of ill-behaved equilibrium strategies that do not occur in ordinary play. We construct this family of games by solving an integer programming problem whose constraints enforce the terminal pairwise stability property we desire.
The emergence of online social networks and the growing popularity of digital communication has r... more The emergence of online social networks and the growing popularity of digital communication has resulted in an increasingly amount of information about individuals available on the Internet. Social network users are given the freedom to create complex digital identities, and enrich them with truthful or even fake personal information. However, this freedom has led to serious security and privacy incidents, due to the role users' identities play in establishing social and privacy settings. In this paper, we take a step toward a better understanding of online information exposure. Based on the detailed analysis of a sample of real-world data, we develop a deception model for online users. The model uses a game theoretic approach to characterizing a user's willingness to release, withhold or lie about information depending on the behavior of individuals within the user's circle of friends. In the model, we take into account both the heterogeneous nature of users and their d...
Lecture Notes in Computer Science, 2015
2011 IEEE International Conference on Communications (ICC), 2011
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing, 2012
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2013
2012 IEEE Symposium on Security and Privacy Workshops, 2012
2012 International Conference on Social Informatics, 2012
2012 International Conference on Social Informatics, 2012
Advances in Internet of Things, 2011
personal.psu.edu
Stop! Stop right now! This is a set of lecture notes. It is not a book. Go away and come back whe... more Stop! Stop right now! This is a set of lecture notes. It is not a book. Go away and come back when you have a real textbook on Linear Programming. Okay, do you have a book? Alright, let's move on then. This is a set of lecture notes for Math 484–Penn State's undergraduate Linear Programming course. Since I use these notes while I teach, there may be typographical errors that I noticed in class, but did not fix in the notes. If you see a typo, send me an e-mail and I'll add an acknowledgement. There may be many typos, that's why you ...
Counter Insurgency operations require the ability to develop accurate representations of the phys... more Counter Insurgency operations require the ability to develop accurate representations of the physical environment and the human landscape in various conditions (eg, urban and non-urban, day and night, and various weather conditions). We are developing innovative sensor suites and processing techniques suitable for such domains as part of a larger effort to support human-centric hard/soft data fusion. In this paper, we present a sensor suite, an information processing architecture, examples of the resulting ...
Arxiv preprint arXiv:1108.4114, Aug 20, 2011
Abstract: Recently, it has been shown that networks with an arbitrary degree sequence may be a st... more Abstract: Recently, it has been shown that networks with an arbitrary degree sequence may be a stable solution to a network formation game. Further, in recent years there has been a rise in the number of firms participating in collaborative efforts. In this paper, we show conditions under which a graph with an arbitrary degree sequence is admitted as a stable firm collaboration graph.
U.S. Department of Energy Office of Scientific and Technical Information - OSTI OAI, Jun 1, 2008
Horticulture Research
The capacity of plants to resist abiotic stresses is of great importance to agricultural, ecologi... more The capacity of plants to resist abiotic stresses is of great importance to agricultural, ecological and environmental sustainability, but little is known about its genetic underpinnings. Existing genetic tools can identify individual genetic variants mediating biochemical, physiological, and cellular defenses, but fail to chart an overall genetic atlas behind stress resistance. We view stress response as an eco-evo-devo process by which plants adaptively respond to stress through complex interactions of developmental canalization, phenotypic plasticity, and phenotypic integration. As such, we define and quantify stress response as the developmental change of adaptive traits from stress-free to stress-exposed environments. We integrate composite functional mapping and evolutionary game theory to reconstruct omnigenic, information-flow interaction networks for stress response. Using desert-adapted Euphrates poplar as an example, we infer salt resistance-related genome-wide interactom...
Physica A: Statistical Mechanics and its Applications, 2020
In this paper, we study the problem of determining a minimum state probabilistic finite state mac... more In this paper, we study the problem of determining a minimum state probabilistic finite state machine capable of generating statistically identical symbol sequences to samples provided. This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) An algorithm for pattern discovery in time series. Technical Report 02-10-060, Santa Fe Institute. arxiv.org/abs/cs.LG/0210025. We show that the underlying problem is NP-hard and thus all existing polynomial time algorithms must be approximations on finite data sets. Using our NP-hardness proof, we show how to construct a provably correct algorithm for constructing a minimum state probabilistic finite state machine given data and empirically study its running time.
. We show that the underlying problem is mathrmNP\mathrm{NP}mathrmNP-hard and thus all existing polynomial time... more . We show that the underlying problem is mathrmNP\mathrm{NP}mathrmNP-hard and thus all existing polynomial time algorithms must be approximations on finite data sets. Using our mathrmNP\mathrm{NP}mathrmNP-hardness proof, we show how to construct a provably correct algorithm for constructing a minimum state probabilistic finite state machine given data and empirically study its running time.
2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing, 2011
2012 IEEE Symposium on Security and Privacy Workshops, 2012
We show a simple method for constructing an infinite family of graph formation games with link bi... more We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a pairwise stable solution, a graph with an arbitrarily specified degree distribution. Pairwise stability is used as the equilibrium condition over the more commonly used Nash equilibrium to prevent the occurrence of ill-behaved equilibrium strategies that do not occur in ordinary play. We construct this family of games by solving an integer programming problem whose constraints enforce the terminal pairwise stability property we desire.
The emergence of online social networks and the growing popularity of digital communication has r... more The emergence of online social networks and the growing popularity of digital communication has resulted in an increasingly amount of information about individuals available on the Internet. Social network users are given the freedom to create complex digital identities, and enrich them with truthful or even fake personal information. However, this freedom has led to serious security and privacy incidents, due to the role users' identities play in establishing social and privacy settings. In this paper, we take a step toward a better understanding of online information exposure. Based on the detailed analysis of a sample of real-world data, we develop a deception model for online users. The model uses a game theoretic approach to characterizing a user's willingness to release, withhold or lie about information depending on the behavior of individuals within the user's circle of friends. In the model, we take into account both the heterogeneous nature of users and their d...
Lecture Notes in Computer Science, 2015
2011 IEEE International Conference on Communications (ICC), 2011
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing, 2012
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2013
2012 IEEE Symposium on Security and Privacy Workshops, 2012
2012 International Conference on Social Informatics, 2012
2012 International Conference on Social Informatics, 2012
Advances in Internet of Things, 2011
personal.psu.edu
Stop! Stop right now! This is a set of lecture notes. It is not a book. Go away and come back whe... more Stop! Stop right now! This is a set of lecture notes. It is not a book. Go away and come back when you have a real textbook on Linear Programming. Okay, do you have a book? Alright, let's move on then. This is a set of lecture notes for Math 484–Penn State's undergraduate Linear Programming course. Since I use these notes while I teach, there may be typographical errors that I noticed in class, but did not fix in the notes. If you see a typo, send me an e-mail and I'll add an acknowledgement. There may be many typos, that's why you ...
Counter Insurgency operations require the ability to develop accurate representations of the phys... more Counter Insurgency operations require the ability to develop accurate representations of the physical environment and the human landscape in various conditions (eg, urban and non-urban, day and night, and various weather conditions). We are developing innovative sensor suites and processing techniques suitable for such domains as part of a larger effort to support human-centric hard/soft data fusion. In this paper, we present a sensor suite, an information processing architecture, examples of the resulting ...
Arxiv preprint arXiv:1108.4114, Aug 20, 2011
Abstract: Recently, it has been shown that networks with an arbitrary degree sequence may be a st... more Abstract: Recently, it has been shown that networks with an arbitrary degree sequence may be a stable solution to a network formation game. Further, in recent years there has been a rise in the number of firms participating in collaborative efforts. In this paper, we show conditions under which a graph with an arbitrary degree sequence is admitted as a stable firm collaboration graph.