The Experts below are selected from a list of 96804 Experts worldwide ranked by ideXlab platform

I.v. Rokach - One of the best experts on this subject based on the ideXlab platform.

  • modal approach for processing one and three point bend test data for dsif Time Diagram determination part i theory
    Fatigue & Fracture of Engineering Materials & Structures, 1998
    Co-Authors: I.v. Rokach
    Abstract:

    A hybrid experimental/numerical method for the determination of the variation in the dynamic stress intensity factor (DSIF) with Time during one- or three-point bend impact tests is presented. According to the concept of hybrid methods, a DSIF-Time Diagram is calculated for a particular mathematical model for the specimen using experimentally registered loading as the model excitation. The simple expression for the impact DSIF-response function is derived for an arbitrary linear model of the specimen, using the modal superposition method. Finally, formulae for DSIF calculations for different types of loading approximation are derived.

  • modal approach for processing one and three point bend test data for dsif Time Diagram determination part ii calculations and results
    Fatigue & Fracture of Engineering Materials & Structures, 1998
    Co-Authors: I.v. Rokach
    Abstract:

    In Part I of this paper, using the modal superposition method, equations for dynamic SIF calculations are derived for an arbitrary linear model of an impact bend specimen. In this paper (Part II), modal parameters and other data which are necessary for the DSIF determination have been calculated for three types of specimen model: the Euler–Bernoulli beam model, and two- (2D) and three-dimensional (3D) solid models. For the latter two cases, calculations were performed using the finite element program ADINA. Results for the 2D model of the specimen were fitted by polynomials for a wide range of specimen geometry parameters and Poisson’s ratio values. Considerable differences were observed between the beam model parameters and the 2D or 3D ones. The differences in results for the 2D and 3D models are small and mainly connected with non-uniformity of the SIF distribution along the front of a through-crack in the 3D solid. Results of processing one- and three-point bend test data reported in the literature are presented. Numerical DSIF values are compared with the experimental ones.

Seki Shinnosuke - One of the best experts on this subject based on the ideXlab platform.

  • Oritatami: A Computational Model for Molecular Co-Transcriptional Folding
    'MDPI AG', 2019
    Co-Authors: Geary Cody, Meunier Pierre-etienne, Schabanel Nicolas, Seki Shinnosuke
    Abstract:

    International audienceWe introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to fold before its production is complete. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale from RNA, where strands of RNA fold into programmable shapes during their transcription from an engineered sequence of synthetic DNA. In the model of Oritatami, we explore the process of folding a single-strand bit by bit in such a way that the final fold emerges as a space-Time Diagram of computation. One major requirement in order to compute within this model is the ability to program a single sequence to fold into different shapes dependent on the state of the surrounding inputs. Another challenge is to embed all of the computing components within a contiguous strand, and in such a way that different fold patterns of the same strand perform different functions of computation. Here, we introduce general design techniques to solve these challenges in the Oritatami model. Our main result in this direction is the demonstration of a periodic Oritatami system that folds upon itself algorithmically into a prescribed set of shapes, depending on its current local environment, and whose final folding displays the sequence of binary integers from 0 to N " 2 k ´ 1 with a seed of size Opkq. We prove that designing Oritatami is NP-hard in the number of possible local environments for the folding. Nevertheless, we provide an efficient algorithm, linear in the length of the sequence, that solves the Oritatami design problem when the number of local environments is a small fixed constant. This shows that this problem is in fact fixed parameter tractable (FPT) and can thus be solved in practice efficiently. We hope that the numerous structural strategies employed in Oritatami enabling computation will inspire new architectures for computing in RNA that take advantage of the rapid kinetic-folding of RNA

  • Oritatami: A Computational Model for Molecular Co-Transcriptional Folding
    MDPI, 2019
    Co-Authors: Geary Cody, Meunier Pierre-etienne, Schabanel Nicolas, Seki Shinnosuke
    Abstract:

    We introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to fold before its production is complete. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale from RNA, where strands of RNA fold into programmable shapes during their transcription from an engineered sequence of synthetic DNA. In the model of Oritatami, we explore the process of folding a single-strand bit by bit in such a way that the final fold emerges as a space-Time Diagram of computation. One major requirement in order to compute within this model is the ability to program a single sequence to fold into different shapes dependent on the state of the surrounding inputs. Another challenge is to embed all of the computing components within a contiguous strand, and in such a way that different fold patterns of the same strand perform different functions of computation. Here, we introduce general design techniques to solve these challenges in the Oritatami model. Our main result in this direction is the demonstration of a periodic Oritatami system that folds upon itself algorithmically into a prescribed set of shapes, depending on its current local environment, and whose final folding displays the sequence of binary integers from 0 to N = 2^k−1 with a seed of size O(k) . We prove that designing Oritatami is NP-hard in the number of possible local environments for the folding. Nevertheless, we provide an efficient algorithm, linear in the length of the sequence, that solves the Oritatami design problem when the number of local environments is a small fixed constant. This shows that this problem is in fact fixed parameter tractable (FPT) and can thus be solved in practice efficiently. We hope that the numerous structural strategies employed in Oritatami enabling computation will inspire new architectures for computing in RNA that take advantage of the rapid kinetic-folding of RNA

Gerardo F. Goya - One of the best experts on this subject based on the ideXlab platform.

  • Relaxation Time Diagram for identifying heat generation mechanisms in magnetic fluid hyperthermia
    Journal of Nanoparticle Research, 2014
    Co-Authors: Enio Lima, Emilio De Biasi, Roberto D. Zysler, Marcelo Vasquez Mansilla, Mary L. Mojica-pisciotti, Teobaldo E. Torres, M. Pilar Calatayud, C. Marquina, M. Ricardo Ibarra, Gerardo F. Goya
    Abstract:

    We present a versatile Diagram to envisage the dominant relaxation mechanism of single-domain magnetic nanoparticles (MNPs) under alternating magnetic fields, as those used in magnetic fluid hyperthermia (MFH). The Diagram allows estimating the heating efficiency, measured by the Specific Power Absorption (SPA), originated in the magnetic and viscous relaxation Times of single-domain MNPs for a given frequency of the ac magnetic field (AFM). The Diagram has been successfully applied to different colloids, covering a wide variety of MNPs with different magnetic anisotropy and particle size, and dispersed in different viscous liquid carriers. From the general Diagram, we derived a specific chart based on the Linear Response Theory in order to easily estimate the experimental condition for the optimal SPA values of most colloids currently used in MFH.

F Jimenezmorales - One of the best experts on this subject based on the ideXlab platform.

  • the evolution of 3 d c a to perform a collective behaviour task
    International Conference on Evolvable Systems, 2000
    Co-Authors: F Jimenezmorales
    Abstract:

    Here we extend previous results in which a genetic algorithm (GA) is used to evolve three dimensional cellular automata (CA) to perform a non-trivial collective behavior (NTCB) task. Under a fitness function that is defined as an averaged area in the iterative map, the GA discovers CA rules with quasiperiod-3(QP3) collective behavior and others with period-3. We describe the generational progression of the GA and the synchronization necessary to maintain the global behavior is shown using a generalized space-Time Diagram that reveals the existence of propagating structures inside the system.

  • evolving three dimensional cellular automata to perform a quasiperiod 3 collective behavior task
    Physical Review E, 1999
    Co-Authors: F Jimenezmorales
    Abstract:

    We present results from experiments in which a genetic algorithm (GA) is used to develop three-dimensional cellular automata (CA) to perform a nontrivial collective behavior task. Under a fitness function that is defined as an averaged area in the iterative map, the GA detects a CA rule with quasiperiod-3 (QP3) collective behavior and another with period-3. For rules with QP3 the Time autocorrelation function decays as a power law with an exponent of -1/2, according to the predictions of the Kardar-Parisi-Zhang equation, and a space-Time Diagram reveals the existence of propagating structures inside the system.

Geary Cody - One of the best experts on this subject based on the ideXlab platform.

  • Oritatami: A Computational Model for Molecular Co-Transcriptional Folding
    'MDPI AG', 2019
    Co-Authors: Geary Cody, Meunier Pierre-etienne, Schabanel Nicolas, Seki Shinnosuke
    Abstract:

    International audienceWe introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to fold before its production is complete. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale from RNA, where strands of RNA fold into programmable shapes during their transcription from an engineered sequence of synthetic DNA. In the model of Oritatami, we explore the process of folding a single-strand bit by bit in such a way that the final fold emerges as a space-Time Diagram of computation. One major requirement in order to compute within this model is the ability to program a single sequence to fold into different shapes dependent on the state of the surrounding inputs. Another challenge is to embed all of the computing components within a contiguous strand, and in such a way that different fold patterns of the same strand perform different functions of computation. Here, we introduce general design techniques to solve these challenges in the Oritatami model. Our main result in this direction is the demonstration of a periodic Oritatami system that folds upon itself algorithmically into a prescribed set of shapes, depending on its current local environment, and whose final folding displays the sequence of binary integers from 0 to N " 2 k ´ 1 with a seed of size Opkq. We prove that designing Oritatami is NP-hard in the number of possible local environments for the folding. Nevertheless, we provide an efficient algorithm, linear in the length of the sequence, that solves the Oritatami design problem when the number of local environments is a small fixed constant. This shows that this problem is in fact fixed parameter tractable (FPT) and can thus be solved in practice efficiently. We hope that the numerous structural strategies employed in Oritatami enabling computation will inspire new architectures for computing in RNA that take advantage of the rapid kinetic-folding of RNA

  • Oritatami: A Computational Model for Molecular Co-Transcriptional Folding
    MDPI, 2019
    Co-Authors: Geary Cody, Meunier Pierre-etienne, Schabanel Nicolas, Seki Shinnosuke
    Abstract:

    We introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to fold before its production is complete. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale from RNA, where strands of RNA fold into programmable shapes during their transcription from an engineered sequence of synthetic DNA. In the model of Oritatami, we explore the process of folding a single-strand bit by bit in such a way that the final fold emerges as a space-Time Diagram of computation. One major requirement in order to compute within this model is the ability to program a single sequence to fold into different shapes dependent on the state of the surrounding inputs. Another challenge is to embed all of the computing components within a contiguous strand, and in such a way that different fold patterns of the same strand perform different functions of computation. Here, we introduce general design techniques to solve these challenges in the Oritatami model. Our main result in this direction is the demonstration of a periodic Oritatami system that folds upon itself algorithmically into a prescribed set of shapes, depending on its current local environment, and whose final folding displays the sequence of binary integers from 0 to N = 2^k−1 with a seed of size O(k) . We prove that designing Oritatami is NP-hard in the number of possible local environments for the folding. Nevertheless, we provide an efficient algorithm, linear in the length of the sequence, that solves the Oritatami design problem when the number of local environments is a small fixed constant. This shows that this problem is in fact fixed parameter tractable (FPT) and can thus be solved in practice efficiently. We hope that the numerous structural strategies employed in Oritatami enabling computation will inspire new architectures for computing in RNA that take advantage of the rapid kinetic-folding of RNA