The Experts below are selected from a list of 223326 Experts worldwide ranked by ideXlab platform
Eddy Van Der Meijden - One of the best experts on this subject based on the ideXlab platform.
-
size specific Interaction Patterns and size matching in a plant pollinator Interaction web
Annals of Botany, 2009Co-Authors: Martina Stang, Peter G. L. Klinkhamer, Nickolas M. Waser, Ingo Stang, Eddy Van Der MeijdenAbstract:Background and Aims Many recent studies show that plant–pollinator Interaction webs exhibit consistent structural features such as long-tailed distributions of the degree of generalization, nestedness of Interactions and asymmetric Interaction dependencies. Recognition of these shared features has led to a variety of mechanistic attempts at explanation. Here it is hypothesized that beside size thresholds and species abundances, the frequency distribution of sizes (nectar depths and proboscis lengths) will play a key role in determining observed Interaction Patterns.
-
Size-specific Interaction Patterns and size matching in a plant–pollinator Interaction web
Annals of botany, 2009Co-Authors: Martina Stang, Peter G. L. Klinkhamer, Nickolas M. Waser, Ingo Stang, Eddy Van Der MeijdenAbstract:Background and Aims Many recent studies show that plant–pollinator Interaction webs exhibit consistent structural features such as long-tailed distributions of the degree of generalization, nestedness of Interactions and asymmetric Interaction dependencies. Recognition of these shared features has led to a variety of mechanistic attempts at explanation. Here it is hypothesized that beside size thresholds and species abundances, the frequency distribution of sizes (nectar depths and proboscis lengths) will play a key role in determining observed Interaction Patterns.
Kyungsook Han - One of the best experts on this subject based on the ideXlab platform.
-
Computational analysis of hydrogen bonds in protein-RNA complexes for Interaction Patterns.
FEBS letters, 2003Co-Authors: Hyunwoo Kim, Euna Jeong, Seong-wook Lee, Kyungsook HanAbstract:Structural analysis of protein-RNA complexes is labor-intensive, yet provides insight into the Interaction Patterns between a protein and RNA. As the number of protein-RNA complex structures reported has increased substantially in the last few years, a systematic method is required for automatically identifying Interaction Patterns. This paper presents a computational analysis of the hydrogen bonds in the most representative set of protein-RNA complexes. The analysis revealed several interesting Interaction Patterns. (1) While residues in the beta-sheets favored unpaired nucleotides, residues in the helices showed no preference and residues in turns favored paired nucleotides. (2) The backbone hydrogen bonds were more dominant than the base hydrogen bonds in the paired nucleotides, but the reverse was observed in the unpaired nucleotides. (3) The protein-RNA complexes contained more paired nucleotides than unpaired nucleotides, but the unpaired nucleotides were observed more frequently interacting with the proteins. And (4) Arg-U, Thr-A, Lys-A, and Asn-U were the most frequently observed pairs. The Interaction Patterns discovered from the analysis will provide us with useful information in predicting the structure of the RNA binding protein and the structure of the protein binding RNA.
-
Computational analysis of hydrogen bonds in protein-RNA complexes for Interaction Patterns.
FEBS Letters, 2003Co-Authors: Hyunwoo Kim, Euna Jeong, Seong-wook Lee, Kyungsook HanAbstract:Structural analysis of protein–RNA complexes is labor-intensive, yet provides insight into the Interaction Patterns between a protein and RNA. As the number of protein–RNA complex structures reported has increased substantially in the last few years, a systematic method is required for automatically identifying Interaction Patterns. This paper presents a computational analysis of the hydrogen bonds in the most representative set of protein–RNA complexes. The analysis revealed several interesting Interaction Patterns. (1) While residues in the β-sheets favored unpaired nucleotides, residues in the helices showed no preference and residues in turns favored paired nucleotides. (2) The backbone hydrogen bonds were more dominant than the base hydrogen bonds in the paired nucleotides, but the reverse was observed in the unpaired nucleotides. (3) The protein–RNA complexes contained more paired nucleotides than unpaired nucleotides, but the unpaired nucleotides were observed more frequently interacting with the proteins. And (4) Arg–U, Thr–A, Lys–A, and Asn–U were the most frequently observed pairs. The Interaction Patterns discovered from the analysis will provide us with useful information in predicting the structure of the RNA binding protein and the structure of the protein binding RNA.
Martina Stang - One of the best experts on this subject based on the ideXlab platform.
-
size specific Interaction Patterns and size matching in a plant pollinator Interaction web
Annals of Botany, 2009Co-Authors: Martina Stang, Peter G. L. Klinkhamer, Nickolas M. Waser, Ingo Stang, Eddy Van Der MeijdenAbstract:Background and Aims Many recent studies show that plant–pollinator Interaction webs exhibit consistent structural features such as long-tailed distributions of the degree of generalization, nestedness of Interactions and asymmetric Interaction dependencies. Recognition of these shared features has led to a variety of mechanistic attempts at explanation. Here it is hypothesized that beside size thresholds and species abundances, the frequency distribution of sizes (nectar depths and proboscis lengths) will play a key role in determining observed Interaction Patterns.
-
Size-specific Interaction Patterns and size matching in a plant–pollinator Interaction web
Annals of botany, 2009Co-Authors: Martina Stang, Peter G. L. Klinkhamer, Nickolas M. Waser, Ingo Stang, Eddy Van Der MeijdenAbstract:Background and Aims Many recent studies show that plant–pollinator Interaction webs exhibit consistent structural features such as long-tailed distributions of the degree of generalization, nestedness of Interactions and asymmetric Interaction dependencies. Recognition of these shared features has led to a variety of mechanistic attempts at explanation. Here it is hypothesized that beside size thresholds and species abundances, the frequency distribution of sizes (nectar depths and proboscis lengths) will play a key role in determining observed Interaction Patterns.
Tal Rabin - One of the best experts on this subject based on the ideXlab platform.
-
ITCS - Secure Multiparty Computation with General Interaction Patterns
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016Co-Authors: Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal RabinAbstract:We present a unified framework for studying secure multiparty computation (MPC) with arbitrarily restricted Interaction Patterns such as a chain, a star, a directed tree, or a directed graph. Our study generalizes both standard MPC and recent models for MPC with specific restricted Interaction Patterns, such as those studied by Halevi et al. (Crypto 2011), Goldwasser et al. (Eurocrypt 2014), and Beimel et al. (Crypto 2014). Since restricted Interaction Patterns cannot always yield full security for MPC, we start by formalizing the notion of "best possible security" for any Interaction pattern. We then obtain the following main results: Completeness theorem. We prove that the star Interaction pattern is complete for the problem of MPC with general Interaction Patterns. Positive results. We present both information-theoretic and computationally secure protocols for computing arbitrary functions with general Interaction Patterns. We also present more efficient protocols for computing symmetric functions, both in the computational and in the information-theoretic setting. Our computationally secure protocols for general functions necessarily rely on indistinguishability obfuscation while the ones for computing symmetric functions make simple use of multilinear maps. Negative results. We show that, in many cases, the complexity of our information-theoretic protocols is essentially the best that can be achieved. All of our protocols rely on a correlated randomness setup, which is necessary in our setting (for computing general functions). In the computational case, we also present a generic procedure to make any correlated randomness setup reusable, in the common random string model. Although most of our information-theoretic protocols have exponential complexity, they may be practical for functions on small domains (e.g., f0; 1g20), where they are concretely faster than their computational counterparts.
-
secure multiparty computation with general Interaction Patterns
Conference on Innovations in Theoretical Computer Science, 2016Co-Authors: Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal RabinAbstract:We present a unified framework for studying secure multiparty computation (MPC) with arbitrarily restricted Interaction Patterns such as a chain, a star, a directed tree, or a directed graph. Our study generalizes both standard MPC and recent models for MPC with specific restricted Interaction Patterns, such as those studied by Halevi et al. (Crypto 2011), Goldwasser et al. (Eurocrypt 2014), and Beimel et al. (Crypto 2014). Since restricted Interaction Patterns cannot always yield full security for MPC, we start by formalizing the notion of "best possible security" for any Interaction pattern. We then obtain the following main results: Completeness theorem. We prove that the star Interaction pattern is complete for the problem of MPC with general Interaction Patterns. Positive results. We present both information-theoretic and computationally secure protocols for computing arbitrary functions with general Interaction Patterns. We also present more efficient protocols for computing symmetric functions, both in the computational and in the information-theoretic setting. Our computationally secure protocols for general functions necessarily rely on indistinguishability obfuscation while the ones for computing symmetric functions make simple use of multilinear maps. Negative results. We show that, in many cases, the complexity of our information-theoretic protocols is essentially the best that can be achieved. All of our protocols rely on a correlated randomness setup, which is necessary in our setting (for computing general functions). In the computational case, we also present a generic procedure to make any correlated randomness setup reusable, in the common random string model. Although most of our information-theoretic protocols have exponential complexity, they may be practical for functions on small domains (e.g., f0; 1g20), where they are concretely faster than their computational counterparts.
-
Secure Multiparty Computation with General Interaction Patterns.
IACR Cryptology ePrint Archive, 2015Co-Authors: Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal RabinAbstract:We present a unified framework for studying secure multi-party computation (MPC) with arbitrarily restricted Interaction Patterns. Our study generalizes both standard MPC and recent models for MPC with specific restricted Interaction Patterns (such as a chain or a star), which were studied by Halevi et al. (Crypto 2011), Goldwasser et al. (Eurocrypt 2014), and Beimel et al. (Crypto 2014). Since restricted Interaction Patterns cannot always yield full security for MPC, we start by formalizing the notion of “best possible security” for any Interaction pattern. We then obtain the following results: • Completeness theorem. We prove that the star Interaction pattern is complete for the problem of MPC with general Interaction Patterns. • Positive results. We present both information-theoretic and computationally secure protocols for computing arbitrary functions with general Interaction Patterns. We also present more efficient protocols for computing symmetric functions and for computing arbitrary functions over a chain. • Negative results. We give evidence that our information-theoretic protocols for general functions will be hard to substantially improve on. All of our protocols rely on a correlated randomness setup, which is necessary for computing general functions in our setting. In the computational case, we also present a generic procedure to make any correlated randomness setup reusable, in the common random string model. Although most of our information-theoretic protocols have exponential complexity, they may be practical for functions on small domains (e.g., {0, 1}), where they are concretely faster than their computational counterparts.
Karsten Wolf - One of the best experts on this subject based on the ideXlab platform.
-
service Interaction Patterns formalization and analysis
Formal Methods, 2009Co-Authors: Wil M P Van Der Aalst, Arjan J Mooij, Christian Stahl, Karsten WolfAbstract:As systems become more service oriented and processes increasingly cross organizational boundaries, Interaction becomes more important. New technologies support the development of such systems. However, the paradigm shift towards service orientation, requires a fundamentally different way of looking at processes. This survey aims to provide some foundational notions related to service Interaction. A set of service Interaction Patterns is given to illustrate the challenges in this domain. Moreover, key results are given for three of these challenges: (1) How to expose a service?, (2) How to replace and refine services?, and (3) How to generate service adapters? These challenges will be addressed in a Petri net setting. However, the results extend to other languages used in this domain.
-
SFM - Service Interaction: Patterns, Formalization, and Analysis
Formal Methods for Web Services, 2009Co-Authors: Wil M P Van Der Aalst, Arjan J Mooij, Christian Stahl, Karsten WolfAbstract:As systems become more service oriented and processes increasingly cross organizational boundaries, Interaction becomes more important. New technologies support the development of such systems. However, the paradigm shift towards service orientation, requires a fundamentally different way of looking at processes. This survey aims to provide some foundational notions related to service Interaction. A set of service Interaction Patterns is given to illustrate the challenges in this domain. Moreover, key results are given for three of these challenges: (1) How to expose a service?, (2) How to replace and refine services?, and (3) How to generate service adapters? These challenges will be addressed in a Petri net setting. However, the results extend to other languages used in this domain.
