نتایج جستجو برای: majority gate

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

Journal: :CoRR 2012
Mostafa Rahimi Azghadi Omid Kavehei Keivan Navi

Quantum dot Cellular Automata (QCA) is a novel and potentially attractive technology for implementing computing architectures at the nano-scale. The basic Boolean primitive in QCA is the majority gate. In this paper we present a novel design for QCA cells and another possible and unconventional scheme for majority gates. By applying these items, the hardware requirements for a QCA design can be...

Journal: :Electronic Notes in Discrete Mathematics 2015
Máté Vizer Dániel Gerbner Balázs Keszegh Dömötör Pálvölgyi Balázs Patkós Gábor Wiener

Suppose we are given a set of n balls {b1, . . . , bn} each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query any triple of balls {bi1 , bi2 , bi3}. As an answer to such a query we obtain (the index of) a majority ball, that is, a ball whose color is the same as the color of another ball from the triple. Our goal is to find a non-m...

Journal: :international journal of advanced biological and biomedical research 2015
hadi taleshi ahangari ali ghanbari nasroallah moradi kor

objective: different categories are available for estimating of radiation dose. radioisotopes with the same energy and almost the same physical properties have similar effects. monte carlo technique is a computerized method based on mathematical simulation of physical processes. the main purpose of this study is to show that beta particles are not able to penetrate deep into the water. also dif...

Journal: :Electr. Notes Theor. Comput. Sci. 1995
Igor Litovsky Yves Métivier Éric Sopena

Journal: :Discrete Applied Mathematics 2011
Henry Martyn Mulder Beth Novick

Abstract The general problem in location theory deals with functions that find sites on a graph (discrete case) or network (continuous case) in such a way as to minimize some cost (or maximize some benefit) to a given set of clients represented by vertices on the graph or points on the network. The axiomatic approach seeks to uniquely distinguish, by using a list of intuitively pleasing axioms,...

2006
Isabelle Bloch Ramón Pino Pérez Carlos Uzcátegui

In this paper we introduce a median operator between two sets of interpretations (worlds) in a finite propositional language. Our definition is based on morphological operations and Hausdorff distance. It provides a result which lies “halfway” between both sets and accounts for the “extension” or “shape” of the sets. We prove several interesting properties of this operator and compare it with f...

Journal: :Chemical communications 2015
Yulia V Gerasimova Dmitry M Kolpashchikov

Logic gates made of DNA have received significant attention as biocompatible building blocks for molecular circuits. The majority of DNA logic gates, however, are controlled by the minimum number of inputs: one, two or three. Here we report a strategy to design a multi-input logic gate by splitting a DNA construct.

2014
Srdjan Brkic Goran Djordjevic

In this paper we present a method for symbolic analysis of unreliable logic circuits in the presence of correlated and data-dependent gate failures, described by Markov chains. Furthermore, using this method we investigate the influence of data-dependent failures on the performance of majority logic and multiple input XOR gates.

Journal: :Nano express 2021

Abstract In this study, we propose a nanomagnetic logic (NML) based 2 bit multiplier architecture design for the first time to best of author’s knowledge. This complex combinational (nanomagnetic multiplier) proposed is built by exploiting shape, positional hybrid anisotropy and ferromagnetically coupled fixed input majority gate. Subsequently, extend along with NML adder in introducing convolu...

1993
Shi-Chun Tsai

Deene the MOD m-degree of a boolean function F to be the smallest degree of any polynomial P, over the ring of integers modulo m, such that for all 0-1 assignments ~ x, F(~ x) = 0 ii P(~ x) = 0. By exploring the periodic property of the binomial coeecients modulo m, two new lower bounds on the MOD m-degree of the MOD l and :MOD m functions are proved, where m is any composite integer and l has ...

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

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