نتایج جستجو برای: molecular computation

تعداد نتایج: 776240  

1999
Takashi Yokomori

This paper proposes a new model for DNA computation called YAC that is based on self-assembly principle. The advantages of the proposed model may be summarized as follows : (i) the model has the universal computability of Turing machines, (ii) nevertheless, it only requires surprisingly simple and basic biomolecular operations, i.e., besides annealing and melting in one-pot reaction, its comput...

1996
Wolfgang Banzhaf Hilmar Rauhe

Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used as part of the emergent computation paradigm in Computer Science. We review in this contribution the idea behind the chemical computational metaphor and outline its relevance for nanotechnology. We s...

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...

Journal: :Proceedings of the National Academy of Sciences 2004

Journal: :ICGA Journal 1993

2007
MARCUS WEBER Marcus Weber

For the treatment of equilibrated molecular systems in a heat bath we propose a transition state theory that is based on conformation dynamics. In general, a set-based discretization of a Markov operator P does not preserve the Markov property. In this article, we propose a discretization method which is based on a Galerkin approach. This discretization method preserves the Markov property of t...

Journal: :CoRR 2010
Manas Ranjan Pradhan E. G. Rajan

This research paper is proposing the idea of pseudo code representation to molecular programming used in designing molecular electronics devices. Already the schematic representation of logical gates like AND, OR, NOT etc.from molecular diodes or resonant tunneling diode are available. This paper is setting a generic pseudo code model so that various logic gates can be formulated. These molecul...

Journal: :Argument & Computation 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید