نتایج جستجو برای: circuit analysis computing

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

Journal: :IJUC 2005
Tetsuya Asai Yusuke Kanazawa Tetsuya Hirose Yoshihito Amemiya

We introduce analog integrated circuits that imitate a typical model of a reaction diffusion system, called the Belousov-Zhabotinsky (BZ) reaction. The BZ reaction gives us many insights into developing new architectures based on a new computing paradigm such as in active wave computing. The analog unit circuit exhibits both excitatory and oscillatory behaviors with very stiff responses, as obs...

2014
Sriram Nandha Premnath Zygmunt J. Haas

Cloud computing systems, in which clients rent and share computing resources of third party platforms, have gained widespread use in recent years. Furthermore, cloud computing for mobile systems (i.e., systems in which the clients are mobile devices) have too been receiving considerable attention in technical literature. We propose a new method of delegating computations of resource-constrained...

2014
Jaspreet Kaur Harpreet Kaur

Reversible logic circuits have emerged as a promising technology having its applications in low power CMOS, Quantum Computing, nanotechnology, and optical computing. Power is the major constraint for any circuit Each circuit demands not only low power, but fast speed. This paper is focused on the efficient design of the full Adder/Subtractor with the help of half adder subtractor with single co...

2012
F. Moro R. Turri

In this work, approximate formulas are presented for computing the magnetic field intensity near electric power transmission lines. Original expressions are given for single circuit lines of any type of arrangement and double circuit lines in both super-bundle and low-reactance conductor phasing. These expressions can be used for assessing directly the Right-of-Way width of power lines related ...

2003
István Katsányi

In this paper we give efficient molecular computing solutions to seven well-known NP-complete problems, namely the Hamiltonian circuit, Path with forbidden pairs, Longest path, Monochromatic triangle, Partition into triangles, Partition into paths of length two, Circuit satisfiability problems in the Parallel filtering model of Amos et al.

Journal: :علوم زیستی ورزشی 0
محمد رضا کردی دانشگاه تهران عباس قنبری نیاکی دانشگاه مازندران علی اصغر فلاحی دانشگاه تهران-دانشجوی دکتری علی رضا عباسی دانشگاه تهران-کارشناس ارشد

the purpose of this study was to evaluate the effect of short time circuit-resistance exercise with difference intensities on ghi/igf-i growth axis in healthy male students. for this purpose, 27 male students with mean and standard deviation of age 21.40±1.78 yr, height 172±0.45 cm, weight 68.85±5.39 kg were selected and randomly divided into three resistance exercise groups (each group, 9 subj...

2013
Majid Haghparast Masoumeh Shams Keivan Navi

Reversible computation is of the growing interests to power minimization having applications in low power CMOS design, quantum computing, optical information processing, DNA computing, bioinformatics and nanotechnology. This paper proposes a novel 4x4 bit reversible Multiplier circuit. It is faster and has lower hardware complexity compared to the existing designs. In addition, the proposed rev...

Journal: :Computers & Electrical Engineering 2007
Stephen Coe Shawki Areibi Medhat A. Moussa

During the last decade, the complexity and size of circuits have been rapidly increasing, placing a stressing demand on industry for faster and more efficient CAD tools for VLSI circuit layout. One major problem is the computational requirements for optimizing the place and route operations of a VLSI circuit. Thus, this paper investigates the feasibility of using reconfigurable computing platfo...

2008
Robert R. Tucci

We propose a new family of quantum computing algorithms which generalize the Deutsch-Jozsa, Simon and Shor ones. The goal of our algorithms is to estimate conditional probability distributions. Such estimates are useful in applications of Decision Theory and Artificial Intelligence, where inferences are made based on uncertain knowledge. The family of algorithms that we propose is based on a co...

Journal: :Discrete Applied Mathematics 2008
Bruno Gaujal Jean Mairesse

In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but using a minimal number of registers? The construction of such a circuit can be done in polynomial time and is based on a result of Orlin for one periodic bi-infinite graphs showing that the cardinality maximum flow is...

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

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