Zaloguj się

Gotowe bibliografie tematyczne / Combinatorial circuits / Artykuły w czasopismach

Artykuły w czasopismach na temat „Combinatorial circuits”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Combinatorial circuits.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 20 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Combinatorial circuits”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Tsuiki, Shigeya, i Takahiro Haga. "AND-inverse detecting circuit for the combinatorial logic circuits". Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 73, nr 11 (1990): 51–60. http://dx.doi.org/10.1002/ecjc.4430731106.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Matsushima, Ayano, i Ann M. Graybiel. "Combinatorial Developmental Controls on Striatonigral Circuits". Cell Reports 38, nr 2 (styczeń 2022): 110272. http://dx.doi.org/10.1016/j.celrep.2021.110272.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Matsushima, Ayano, i Ann M. Graybiel. "Combinatorial Developmental Controls on Striatonigral Circuits". Cell Reports 31, nr 11 (czerwiec 2020): 107778. http://dx.doi.org/10.1016/j.celrep.2020.107778.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Donovan, Zola, Gregory Gutin, Vahan Mkrtchyan i K. Subramani. "Clustering without replication in combinatorial circuits". Journal of Combinatorial Optimization 38, nr 2 (21.02.2019): 481–501. http://dx.doi.org/10.1007/s10878-019-00394-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Fang, K. Y., i A. S. Wojcik. "Modular decomposition of combinatorial multiple-values circuits". IEEE Transactions on Computers 37, nr 10 (1988): 1293–301. http://dx.doi.org/10.1109/12.5993.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Chen, Ethan, i Vanessa Chen. "Statistical RF/Analog Integrated Circuit Design Using Combinatorial Randomness for Hardware Security Applications". Mathematics 8, nr 5 (20.05.2020): 829. http://dx.doi.org/10.3390/math8050829.

Pełny tekst źródła

Streszczenie:

While integrated circuit technologies keep scaling aggressively, analog, mixed-signal, and radio-frequency (RF) circuits encounter challenges by creating robust designs in advanced complementary metal–oxide–semiconductor (CMOS) processes with the diminishing voltage headroom. The increasing random mismatch of smaller feature sizes in leading-edge technology nodes severely limit the benefits of scaling for (RF)/analog circuits. This paper describes the details of the combinatorial randomness by statistically selecting device elements that relies on the significant growth in subsets number of combinations. The randomness can be utilized to provide post-manufacturing reconfiguration of the selectable circuit elements to achieve required specifications for ultra-low-power systems. The calibration methodology is demonstrated with an ultra-low-voltage chaos-based true random number generator (TRNG) for energy-constrained Internet of things (IoT) devices in the secure communications.

Style APA, Harvard, Vancouver, ISO itp.

7

URAHAMA, KIICHI, i SHIN-ICHIRO UENO. "A GRADIENT SYSTEM SOLUTION TO POTTS MEAN FIELD EQUATIONS AND ITS ELECTRONIC IMPLEMENTATION". International Journal of Neural Systems 04, nr 01 (marzec 1993): 27–34. http://dx.doi.org/10.1142/s0129065793000043.

Pełny tekst źródła

Streszczenie:

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Style APA, Harvard, Vancouver, ISO itp.

8

Wróblewski, Artur, Christian V. Schimpfle, Otto Schumacher i Josef A. Nossek. "Minimizing Spurious Switching Activities with Transistor Sizing". VLSI Design 15, nr 2 (1.01.2002): 537–45. http://dx.doi.org/10.1080/1065514021000012156.

Pełny tekst źródła

Streszczenie:

In combinatorial blocks of static CMOS circuits transistor sizing can be applied for delay balancing as to guarantee synchronously arriving signal slopes at the input of logic gates, thereby avoiding glitches. Since the delay of logic gates depends directly on transistor sizes, their variation allows equalizing different path delays without influencing the total delay of the circuit. Unfortunately, not only the delay, but also power consumption circuits depend on the transistor sizes. To achieve optimal results, transistor lengths have to be increased, which results in both increased gate capacitances and area. Splitting the long transistors counteracts this negative influence.

Style APA, Harvard, Vancouver, ISO itp.

9

Zhu, Enqiang, Congzhou Chen, Yongsheng Rao i Weicheng Xiong. "Biochemical Logic Circuits Based on DNA Combinatorial Displacement". IEEE Access 8 (2020): 34096–103. http://dx.doi.org/10.1109/access.2020.2974024.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Fujiwara, Yuichiro, i Charles J. Colbourn. "A Combinatorial Approach to X-Tolerant Compaction Circuits". IEEE Transactions on Information Theory 56, nr 7 (lipiec 2010): 3196–206. http://dx.doi.org/10.1109/tit.2010.2048468.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Vakhania, Nodari, i Frank Werner. "Near to Optimal Size Selection in Combinatorial Circuits". IFAC Proceedings Volumes 45, nr 6 (maj 2012): 63–68. http://dx.doi.org/10.3182/20120523-3-ro-2023.00060.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Waites, William, Göksel Mısırlı, Matteo Cavaliere, Vincent Danos i Anil Wipat. "A Genetic Circuit Compiler: Generating Combinatorial Genetic Circuits with Web Semantics and Inference". ACS Synthetic Biology 7, nr 12 (8.11.2018): 2812–23. http://dx.doi.org/10.1021/acssynbio.8b00201.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

MELKONIAN, VARDGES. "CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS". Discrete Mathematics, Algorithms and Applications 03, nr 01 (marzec 2011): 101–19. http://dx.doi.org/10.1142/s179383091100105x.

Pełny tekst źródła

Streszczenie:

Reducing the size of a logic circuit through lattice identities is an important and well-studied discrete optimization problem. In this paper, we consider a related problem of integrating several circuits into a single hypercircuit using the recently developed concept of lattice hyperterms. We give a combinatorial algorithm for integrating k-out-of-n symmetrical diagrams which play an important role in reliability theory. Our results show that the integration can reduce the number of circuit gates by more than twice.

Style APA, Harvard, Vancouver, ISO itp.

14

Kubica, Marcin, Adam Opara i Dariusz Kania. "Logic Synthesis Strategy Oriented to Low Power Optimization". Applied Sciences 11, nr 19 (22.09.2021): 8797. http://dx.doi.org/10.3390/app11198797.

Pełny tekst źródła

Streszczenie:

The article presents a synthesis strategy focused on low power implementations of combinatorial circuits in an array-type FPGA structure. Logic functions are described by means of BDD. A new form of the SWitch activity BDD diagram (SWBDD) is proposed, which enables a function decomposition to minimize the switching activity of circuits. The essence of the proposed idea lies in the proper ordering of the variables and cutting the diagram, ensuring the minimization of switching in the combination circuit. This article contains the results of experiments confirming the effectiveness of the developed concept of decomposition. They were performed on popular benchmarks using academic and commercial synthesis systems.

Style APA, Harvard, Vancouver, ISO itp.

15

Caravelli, Francesco. "Asymptotic Behavior of Memristive Circuits". Entropy 21, nr 8 (13.08.2019): 789. http://dx.doi.org/10.3390/e21080789.

Pełny tekst źródła

Streszczenie:

The interest in memristors has risen due to their possible application both as memory units and as computational devices in combination with CMOS. This is in part due to their nonlinear dynamics, and a strong dependence on the circuit topology. We provide evidence that also purely memristive circuits can be employed for computational purposes. In the present paper we show that a polynomial Lyapunov function in the memory parameters exists for the case of DC controlled memristors. Such a Lyapunov function can be asymptotically approximated with binary variables, and mapped to quadratic combinatorial optimization problems. This also shows a direct parallel between memristive circuits and the Hopfield-Little model. In the case of Erdos-Renyi random circuits, we show numerically that the distribution of the matrix elements of the projectors can be roughly approximated with a Gaussian distribution, and that it scales with the inverse square root of the number of elements. This provides an approximated but direct connection with the physics of disordered system and, in particular, of mean field spin glasses. Using this and the fact that the interaction is controlled by a projector operator on the loop space of the circuit. We estimate the number of stationary points of the approximate Lyapunov function and provide a scaling formula as an upper bound in terms of the circuit topology only.

Style APA, Harvard, Vancouver, ISO itp.

16

Gopsill, James, Guy Johns i Ben Hicks. "QUANTUM COMBINATORIAL DESIGN". Proceedings of the Design Society 1 (27.07.2021): 2511–20. http://dx.doi.org/10.1017/pds.2021.512.

Pełny tekst źródła

Streszczenie:

AbstractCombinatorial Design such as configuration design, design optioneering, component selection, and generative design, is common across engineering. Generating solutions for a combinatorial design task often involves the application of classical computing solvers that can either map or navigate design spaces. However, it has been observed that classical computing resource power-law scales with many design space models. This observation suggests classical computing may not be capable of modelling our future design space needs.To meet future design space modelling needs, this paper examines quantum computing and the characteristics that enables its resources to scale polynomially with design space size. The paper then continues to present a combinatorial design problem that is subsequently represented, constrained and solved by quantum computing. The results of which are the derivation of an initial set of circuits that represent design space constraints. The study shows the game-changing possibilities of quantum computing as an engineering design tool and is the start of an exciting new journey for design research.

Style APA, Harvard, Vancouver, ISO itp.

17

Wozniak, Ryan J., Sunduz Keles, Jesse J. Lugus, Ken H. Young, Meghan E. Boyer, Tuan M. Tran, Kyunghee Choi i Emery H. Bresnick. "Molecular Hallmarks of Endogenous Chromatin Complexes Containing Master Regulators of Hematopoiesis". Molecular and Cellular Biology 28, nr 21 (8.09.2008): 6681–94. http://dx.doi.org/10.1128/mcb.01061-08.

Pełny tekst źródła

Streszczenie:

ABSTRACT Combinatorial interactions among trans-acting factors establish transcriptional circuits that orchestrate cellular differentiation, survival, and development. Unlike circuits instigated by individual factors, efforts to identify gene ensembles controlled by multiple factors simultaneously are in their infancy. A paradigm has emerged in which the important regulators of hematopoiesis GATA-1 and GATA-2 function combinatorially with Scl/TAL1, another key regulator of hematopoiesis. The underlying mechanism appears to involve preferential assembly of a multimeric complex on a composite DNA element containing WGATAR and E-box motifs. Based on this paradigm, one would predict that GATA-2 and Scl/TAL1 would commonly co-occupy such composite elements in cells. However, chromosome-wide analyses indicated that the vast majority of conserved composite elements were occupied by neither GATA-2 nor Scl/TAL1. Intriguingly, the highly restricted set of GATA-2-occupied composite elements had characteristic molecular hallmarks, specifically Scl/TAL1 occupancy, a specific epigenetic signature, specific neighboring cis elements, and preferential enhancer activity in GATA-2-expressing cells. Genes near the GATA-2-Scl/TAL1-occupied composite elements were regulated by GATA-2 or GATA-1, and therefore these fundamental studies on combinatorial transcriptional mechanisms were also leveraged to discover novel GATA factor-mediated cell regulatory pathways.

Style APA, Harvard, Vancouver, ISO itp.

18

Kampel, Ludwig, Paris Kitsos i Dimitris E. Simos. "Locating Hardware Trojans Using Combinatorial Testing for Cryptographic Circuits". IEEE Access 10 (2022): 18787–806. http://dx.doi.org/10.1109/access.2022.3151378.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Abdulbaqia, Alaa Ghazi, i Yasir Hashim. "Design and Implementation of General Hardware Binary Multiplier (2ⁿ x 2ⁿ) Bits". Journal of Physics: Conference Series 2312, nr 1 (1.08.2022): 012084. http://dx.doi.org/10.1088/1742-6596/2312/1/012084.

Pełny tekst źródła

Streszczenie:

Abstract In this paper, a new general 2n x 2n bits hardware multiplier based on combinatorial has been designed, implemented and analysed. First, a new design for circuit to multiply two binary numbers with 2n bits length, this new design starts with basic 2x2 bits circuit multiplier, n here equal to 1. Then based on this circuit, the 4x4 bits circuit multiplier has been designed. And based on 4x4, the 8x8 bits multiplier has been designed and continually the 16x16 bits multiplier. The final design for general 2nx2n bits multiplier has been presented. All these circuits have been mathematically proved and tested to get the final results.

Style APA, Harvard, Vancouver, ISO itp.

20

CHEN, S. K., F. K. HWANG i Y. C. LIU. "SOME COMBINATORIAL PROPERTIES OF MIXED CHORDAL RINGS". Journal of Interconnection Networks 04, nr 01 (marzec 2003): 3–16. http://dx.doi.org/10.1142/s0219265903000702.

Pełny tekst źródła

Streszczenie:

We propose a new network called the mixed chordal ring where the amount of hardware and its structure are very comparable to the (directed) double-loop network, and yet can achieve a better diameter. We also investigated other combinatorial properties such as connectivity and hamiltonian circuits in the mixed chordal ring.

Style APA, Harvard, Vancouver, ISO itp.

21

Khairy, Sami, Ruslan Shaydulin, Lukasz Cincio, Yuri Alexeev i Prasanna Balaprakash. "Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems". Proceedings of the AAAI Conference on Artificial Intelligence 34, nr 03 (3.04.2020): 2367–75. http://dx.doi.org/10.1609/aaai.v34i03.5616.

Pełny tekst źródła

Streszczenie:

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

Style APA, Harvard, Vancouver, ISO itp.

22

LEE, ORLANDO, i YOSHIKO WAKABAYASHI. "On the Circuit Cover Problem for Mixed Graphs". Combinatorics, Probability and Computing 11, nr 1 (styczeń 2002): 43–59. http://dx.doi.org/10.1017/s0963548301004989.

Pełny tekst źródła

Streszczenie:

The circuit cover problem for mixed graphs (those containing edges and/or arcs) is defined as follows. Given a mixed graph M with a nonnegative integer weight function p on its edges and arcs, decide whether (M, p) has a circuit cover, that is, a list of circuits in M such that every edge (arc) e is contained in exactly p(e) circuits of the list. In the special case when M is a directed graph (contains only arcs), the problem is easy, but when M is an undirected graph not many results are known. For general mixed graphs this problem was shown to be NP-complete by Arkin and Papadimitriou in 1986. We prove that this problem remains NP-complete for planar mixed graphs. Furthermore, we present a good characterization for the existence of a circuit cover when M is series-parallel (a similar result holds for the fractional version). We also describe a polynomial algorithm to find such a circuit cover, when it exists. This is an ellipsoid-based algorithm whose separation problem is the minimum circuit problem on series-parallel mixed graphs, which we show to be polynomially solvable. Results on two well-known combinatorial problems, the problem of detecting negative circuits and the problem of finding shortest paths, are also presented. We prove that both problems are NP-hard for planar mixed graphs.

Style APA, Harvard, Vancouver, ISO itp.

23

Blyudov, A. A., V. V. Sapozhnikov i Vl V. Sapozhnikov. "A modified summation code for organizing control of combinatorial circuits". Automation and Remote Control 73, nr 1 (styczeń 2012): 153–60. http://dx.doi.org/10.1134/s0005117912010122.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Flaquer, J. Torras, J. M. Daveau, L. Naviner i P. Roche. "Fast reliability analysis of combinatorial logic circuits using conditional probabilities". Microelectronics Reliability 50, nr 9-11 (wrzesień 2010): 1215–18. http://dx.doi.org/10.1016/j.microrel.2010.07.058.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Alolaiyan, Hanan, Muhammad Aamir, Awais Yousaf i Abdul Razaq. "Counting of Distinct Equivalence Classes of Circuits in PSL 2 , Z -Space". Journal of Mathematics 2022 (9.04.2022): 1–9. http://dx.doi.org/10.1155/2022/4863429.

Pełny tekst źródła

Streszczenie:

Graham Higman was the first who studied the transitive actions of the extended modular group PGL 2 , Z over PL F q = F q ∪ ∞ graphically and named it as coset diagram. In these sorts of graphs, a closed path of edges and triangles is known as a circuit. Coset diagrams evolve through the joining of these circuits. In a coset diagram, a circuit is termed as a length- l circuit if its one vertex is fixed by x 1 x 2 π 1 x 1 x 2 − 1 π 2 x 1 x 2 π 3 , … , x 1 x 2 − 1 π l ∈ PSL 2 , Z , and it is denoted by π 1 , π 2 , π 3 , … , π l . In this study, we shall formulate combinatorial sequences and find the number of distinct equivalence classes of a length-6 circuit π 1 , π 2 , π 3 , π 4 , π 5 , π 6 for a fixed number of triangle Δ of class Π .

Style APA, Harvard, Vancouver, ISO itp.

26

Fan, Daoqing, Erkang Wang i Shaojun Dong. "An intelligent universal system yields double results with half the effort for engineering a DNA “Contrary Logic Pairs” library and various DNA combinatorial logic circuits". Materials Horizons 4, nr 5 (2017): 924–31. http://dx.doi.org/10.1039/c7mh00564d.

Pełny tekst źródła

Streszczenie:

We proposed the concept “Contrary Logic Pairs” (CLPs), and constructed an intelligent universal system for engineering a DNA “CLPs” library and various combinatorial logic circuits based on two fluorescent substrates of G-quadruplex DNAzyme.

Style APA, Harvard, Vancouver, ISO itp.

27

Hasegawa, Tetsu, Kyoko Miura, Toshiaki Ohmameuda i Hideo Ito. "Test generation for sequential circuits using state transition diagram and test generation for combinatorial circuit part". Electronics and Communications in Japan (Part II: Electronics) 84, nr 8 (sierpień 2001): 20–28. http://dx.doi.org/10.1002/ecjb.1046.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

BANDYOPADHYAY, S., V. P. ROYCHOWDHURY i D. B. JANES. "CHEMICALLY SELF-ASSEMBLED NANOELECTRONIC COMPUTING NETWORKS". International Journal of High Speed Electronics and Systems 09, nr 01 (marzec 1998): 1–35. http://dx.doi.org/10.1142/s0129156498000038.

Pełny tekst źródła

Streszczenie:

Recent advances in chemical self-assembly will soon make it possible to synthesize extremely powerful computing machinery from metallic clusters and organic molecules. These self-organized networks can function as Boolean logic circuits, associative memory, image processors, and combinatorial optimizers. Computational or signal processing activity is elicited from simple charge interactions between clusters which are resistively/capacitively linked by conjugated molecular wires or ribbons. The resulting circuits are massively parallel, fault-tolerant, ultrafast, ultradense and dissipate very little power.

Style APA, Harvard, Vancouver, ISO itp.

29

Zhang, Xuncai, Weiwei Zhang, Taotao Zhao, Yanfeng Wang i Guangzhao Cui. "Design of Logic Circuits Based on Combinatorial Displacement of DNA Strands". Journal of Computational and Theoretical Nanoscience 12, nr 7 (1.07.2015): 1161–64. http://dx.doi.org/10.1166/jctn.2015.3867.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Schaerli, Yolanda, i Mark Isalan. "Building synthetic gene circuits from combinatorial libraries: screening and selection strategies". Molecular BioSystems 9, nr 7 (2013): 1559. http://dx.doi.org/10.1039/c2mb25483b.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Roybal, Kole T., Levi J. Rupp, Leonardo Morsut, Whitney J. Walker, Krista A. McNally, Jason S. Park i Wendell A. Lim. "Precision Tumor Recognition by T Cells With Combinatorial Antigen-Sensing Circuits". Cell 164, nr 4 (luty 2016): 770–79. http://dx.doi.org/10.1016/j.cell.2016.01.011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Goldsworthy, Victoria, Geneva LaForce, Seth Abels i Emil Khisamutdinov. "Fluorogenic RNA Aptamers: A Nano-platform for Fabrication of Simple and Combinatorial Logic Gates". Nanomaterials 8, nr 12 (28.11.2018): 984. http://dx.doi.org/10.3390/nano8120984.

Pełny tekst źródła

Streszczenie:

RNA aptamers that bind non-fluorescent dyes and activate their fluorescence are highly sensitive, nonperturbing, and convenient probes in the field of synthetic biology. These RNA molecules, referred to as light-up aptamers, operate as molecular nanoswitches that alter folding and fluorescence function in response to ligand binding, which is important in biosensing and molecular computing. Herein, we demonstrate a conceptually new generation of smart RNA nano-devices based on malachite green (MG)-binding RNA aptamer, which fluorescence output controlled by addition of short DNA oligonucleotides inputs. Four types of RNA switches possessing AND, OR, NAND, and NOR Boolean logic functions were created in modular form, allowing MG dye binding affinity to be changed by altering 3D conformation of the RNA aptamer. It is essential to develop higher-level logic circuits for the production of multi-task nanodevices for data processing, typically requiring combinatorial logic gates. Therefore, we further designed and synthetized higher-level half adder logic circuit by “in parallel” integration of two logic gates XOR and AND within a single RNA nanoparticle. The design utilizes fluorescence emissions from two different RNA aptamers: MG-binding RNA aptamer (AND gate) and Broccoli RNA aptamer that binds DFHBI dye (XOR gate). All computationally designed RNA devices were synthesized and experimentally tested in vitro. The ability to design smart nanodevices based on RNA binding aptamers offers a new route to engineer “label-free” ligand-sensing regulatory circuits, nucleic acid detection systems, and gene control elements.

Style APA, Harvard, Vancouver, ISO itp.

33

Beneš, David, Petr Sosík i Alfonso Rodríguez-Patón. "An Autonomous In Vivo Dual Selection Protocol for Boolean Genetic Circuits". Artificial Life 21, nr 2 (maj 2015): 247–60. http://dx.doi.org/10.1162/artl_a_00160.

Pełny tekst źródła

Streszczenie:

Success in synthetic biology depends on the efficient construction of robust genetic circuitry. However, even the direct engineering of the simplest genetic elements (switches, logic gates) is a challenge and involves intense lab work. As the complexity of biological circuits grows, it becomes more complicated and less fruitful to rely on the rational design paradigm, because it demands many time-consuming trial-and-error cycles. One of the reasons is the context-dependent behavior of small assembly parts (like BioBricks), which in a complex environment often interact in an unpredictable way. Therefore, the idea of evolutionary engineering (artificial directed in vivo evolution) based on screening and selection of randomized combinatorial genetic circuit libraries became popular. In this article we build on the so-called dual selection technique. We propose a plasmid-based framework using toxin-antitoxin pairs together with the relaxase conjugative protein, enabling an efficient autonomous in vivo evolutionary selection of simple Boolean circuits in bacteria (E. coli was chosen for demonstration). Unlike previously reported protocols, both on and off selection steps can run simultaneously in various cells in the same environment without human intervention; and good circuits not only survive the selection process but are also horizontally transferred by conjugation to the neighbor cells to accelerate the convergence rate of the selection process. Our directed evolution strategy combines a new dual selection method with fluorescence-based screening to increase the robustness of the technique against mutations. As there are more orthogonal toxin-antitoxin pairs in E. coli, the approach is likely to be scalable to more complex functions. In silico experiments based on empirical data confirm the high search and selection capability of the protocol.

Style APA, Harvard, Vancouver, ISO itp.

34

BALL, CARSTEN F., i DIETER A. MLYNSKI. "FUZZY BI- AND MULTI-PARTITIONING FOR CIRCUITS REPRESENTED BY HYPERGRAPHS". Journal of Circuits, Systems and Computers 06, nr 05 (październik 1996): 503–26. http://dx.doi.org/10.1142/s0218126696000340.

Pełny tekst źródła

Streszczenie:

A new strategy for partitioning hypergraphs in complex LSI and VLSI circuits is presented. A new fuzzy net-cut model has been developed to treat multi-pin-nets without splitting into two-pin-nets. The combinatorial optimization algorithm is derived from statistical physics. The circuit graph is modeled as a highly coupled spin system and the mean field approximation is used to achieve linear time complexity. Fuzzy partitioning enables a qualitative and macroscopic approach by interpreting the mean values of the spin system as fuzzy membership degrees. The proposed strategy is tested with MCNC benchmark problems and compared to results achieved recently. The performance of the new algorithm is comparable with neural networks and simulated annealing, but much faster, because of its linear time complexity. Furthermore, the partitioning algorithm has been implemented in an industrial CAD design tool and results are given.

Style APA, Harvard, Vancouver, ISO itp.

35

Li, Zeyu, Junjie Wang, Zhao Huang, Nan Luo i Quan Wang. "Towards Trust Hardware Deployment of Edge Computing: Mitigation of Hardware Trojans based on Evolvable Hardware". Applied Sciences 12, nr 13 (29.06.2022): 6601. http://dx.doi.org/10.3390/app12136601.

Pełny tekst źródła

Streszczenie:

Hardware Trojans (HTs) are malicious hardware components designed to leak confidential information or cause the chip/circuit on which they are integrated to malfunction during operation. When we deploy such hardware platforms for edge computing, FPGA-based implementations of Coarse-Grained Reconfigurable Array (CGRA) are also currently falling victim to HT insertion. However, for CGRA, an evolvable hardware (EHW) platform, which has the ability to dynamically change its configuration and behavioral characteristics based on inputs from the environment, provides us with a new way to mitigate HT attacks. In this regard, we investigate the feasibility of using EHW to mitigate HTs that disrupt normal functionality in CGRA in this paper. When it is determined that HT is inserted into certain processing elements (PEs), the array autonomously reconfigures the circuit structure based on an evolutionary algorithm (EA) to avoid the use of HT-infected (HT-I) PEs. We show that the proposed approach is applicable to: (1) hardware platforms that support coarse-grained reconfiguration; and (2) pure combinatorial circuits. In a simulation environment built in Python, this paper reports experimental results for two target evolutionary circuits and outlines the effectiveness of the proposed method.

Style APA, Harvard, Vancouver, ISO itp.

36

Su, Zhenhua. "Calculating Crossing Numbers of Graphs Using Combinatorial Principles". Mathematical Problems in Engineering 2022 (7.06.2022): 1–8. http://dx.doi.org/10.1155/2022/4550953.

Pełny tekst źródła

Streszczenie:

The crossing numbers of graphs were started from Turán’s brick factory problem (TBFP). Because of its wide range of applications, it has been used in computer networks, electrical circuits, and biological engineering. Recently, many experts began to pay much attention to the crossing number of G \ e , which obtained from graph G by deleting an edge e . In this paper, by using some combinatorial skills, we determine the exact value of crossing numbers of K 1,4 , n \ e and K 2,3 , n \ e . These results are an in-depth work of TBFP, which will be beneficial to the further study of crossing numbers and its applications.

Style APA, Harvard, Vancouver, ISO itp.

37

Morgenshtein, A., A. Fish i I. A. Wagner. "Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits". IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10, nr 5 (październik 2002): 566–81. http://dx.doi.org/10.1109/tvlsi.2002.801578.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Santos-Moreno, Javier, i Yolanda Schaerli. "A Framework for the Modular and Combinatorial Assembly of Synthetic Gene Circuits". ACS Synthetic Biology 8, nr 7 (11.06.2019): 1691–97. http://dx.doi.org/10.1021/acssynbio.9b00174.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Mossé, B., i É. Remy. "A Combinatorial Exploration of Boolean Dynamics Generated by Isolated and Chorded Circuits". Acta Biotheoretica 68, nr 1 (12.08.2019): 87–117. http://dx.doi.org/10.1007/s10441-019-09355-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Kim, Hyo Jin, Timothy Lee Turner i Yong-Su Jin. "Combinatorial genetic perturbation to refine metabolic circuits for producing biofuels and biochemicals". Biotechnology Advances 31, nr 6 (listopad 2013): 976–85. http://dx.doi.org/10.1016/j.biotechadv.2013.03.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

MIASNIKOV, ALEXEI G., ALEXANDER USHAKOV i DONG WOOK WON. "POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY". International Journal of Algebra and Computation 22, nr 06 (31.08.2012): 1250047. http://dx.doi.org/10.1142/s0218196712500476.

Pełny tekst źródła

Streszczenie:

Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x ⋅ 2y, z = x ⋅ 2-y (the former two are partial) and predicates < and =. Notice that in this case very large numbers, which are obtained as n towers of exponentiation in the base 2 can be realized as n applications of the operation x ⋅ 2y, so working with such numbers given in the usual binary expansions requires super exponential space. We define a new compressed representation for integers by power circuits (a particular type of straight-line programs) which is unique and easily computable, and show that the operations above can be performed in polynomial time if the numbers are presented by power circuits. We mention several applications of this technique to algorithmic problems, in particular, we prove that the quantifier-free theories of various exponential algebras are decidable in polynomial time.

Style APA, Harvard, Vancouver, ISO itp.

42

Morel, Mathieu, Roman Shtrahman, Varda Rotter, Lior Nissim i Roy H. Bar-Ziv. "Cellular heterogeneity mediates inherent sensitivity–specificity tradeoff in cancer targeting by synthetic circuits". Proceedings of the National Academy of Sciences 113, nr 29 (6.07.2016): 8133–38. http://dx.doi.org/10.1073/pnas.1604391113.

Pełny tekst źródła

Streszczenie:

Synthetic gene circuits are emerging as a versatile means to target cancer with enhanced specificity by combinatorial integration of multiple expression markers. Such circuits must also be tuned to be highly sensitive because escape of even a few cells might be detrimental. However, the error rates of decision-making circuits in light of cellular variability in gene expression have so far remained unexplored. Here, we measure the single-cell response function of a tunable logic AND gate acting on two promoters in heterogeneous cell populations. Our analysis reveals an inherent tradeoff between specificity and sensitivity that is controlled by the AND gate amplification gain and activation threshold. We implement a tumor-mimicking cell-culture model of cancer cells emerging in a background of normal ones, and show that molecular parameters of the synthetic circuits control specificity and sensitivity in a killing assay. This suggests that, beyond the inherent tradeoff, synthetic circuits operating in a heterogeneous environment could be optimized to efficiently target malignant state with minimal loss of specificity.

Style APA, Harvard, Vancouver, ISO itp.

43

Vahabi, Mohsen, Pavel Lyakhov, Ali Newaz Bahar, Akira Otsuki i Khan A. Wahid. "Novel Reversible Comparator Design in Quantum Dot-Cellular Automata with Power Dissipation Analysis". Applied Sciences 12, nr 15 (4.08.2022): 7846. http://dx.doi.org/10.3390/app12157846.

Pełny tekst źródła

Streszczenie:

In very large-scale integration (VLSI) circuits, a partial of energy lost leads to information loss in irreversible computing because, in conventional combinatorial circuits, each bit of information generates heat and power consumption, thus resulting in energy dissipation. When information is lost in conventional circuits, it will not be recoverable, as a result, the circuits are provided based on the reversible logic and according to reversible gates for data retrieval. Since comparators are one of the basic building blocks in digital logic design, in which they compare two numbers, the aim of this research is to design a 1-bit comparator building block based on reversible logic and implement it in the QCA with the minimum cell consumption, less occupied area, and lower latency, as well as to design it in a single layer. The proposed 1-bit reversible comparator is denser, cost-effective, and more efficient in quantum cost, power dissipation, and the main QCA parameters than that of previous works.

Style APA, Harvard, Vancouver, ISO itp.

44

TRALDI, LORENZO. "A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS". Journal of Knot Theory and Its Ramifications 19, nr 04 (kwiecień 2010): 547–86. http://dx.doi.org/10.1142/s0218216510007978.

Pełny tekst źródła

Streszczenie:

Let D be an oriented classical or virtual link diagram with directed universe [Formula: see text]. Let C denote a set of directed Euler circuits, one in each connected component of U. There is then an associated looped interlacement graph [Formula: see text] whose construction involves very little geometric information about the way D is drawn in the plane; consequently [Formula: see text] is different from other combinatorial structures associated with classical link diagrams, like the checkerboard graph, which can be difficult to extend to arbitrary virtual links. [Formula: see text] is determined by three things: the structure of [Formula: see text] as a 2-in, 2-out digraph, the distinction between crossings that make a positive contribution to the writhe and those that make a negative contribution, and the relationship between C and the directed circuits in [Formula: see text] arising from the link components; this relationship is indicated by marking the vertices where C does not follow the incident link component(s). We introduce a bracket polynomial for arbitrary marked graphs, defined using either a formula involving matrix nullities or a recursion involving the local complement and pivot operations; the marked-graph bracket of [Formula: see text] is the same as the Kauffman bracket of D. This provides a unified combinatorial description of the Jones polynomial that applies seamlessly to both classical and non-classical virtual links.

Style APA, Harvard, Vancouver, ISO itp.

45

Miki, Tsukasa, Ryo Okita, Moe Shimada, Daisuke Tsukayama i Jun-ichi Shirakashi. "Variational Ansatz preparation to avoid CNOT-gates on noisy quantum devices for combinatorial optimizations". AIP Advances 12, nr 3 (1.03.2022): 035247. http://dx.doi.org/10.1063/5.0077706.

Pełny tekst źródła

Streszczenie:

The variational quantum eigensolver (VQE), which is a quantum–classical hybrid approach, has latent powers to leverage near-term quantum devices by effectively managing a limited number of qubits with finite coherent lifetimes. While it is generally argued that the quantum approximate optimization algorithm (QAOA), which is a special case of VQE with a variational Ansatz based on the adiabatic theorem, may enable practical applications of noisy quantum devices for classical combinatorial optimizations, the strategy to improve the performance of this algorithm by increasing the circuit depth conflicts with the limited coherence time of near-term quantum devices. Here, we introduce strategies involving the VQE to reduce the circuit resources required for solving combinatorial optimizations. Our concept of a parameterized quantum circuit allows the Ansatz preparation to be achieved by only single-qubit operation. We find that the variational Ansatz without controlled X-gates leads to quick convergence in a classical subroutine used to determine the variational parameters. In addition, the variational Ansatz with optimized parameters maintains performance over the problem sizes both on the numerical simulation and IBM 27-qubit processor “ibm_kawasaki.” Therefore, the variational Ansatz introduced in this study has several advantages considering the total calculation time and performance scaling over the problem sizes. We also show that the variational Ansatz consisting of a lower number of gate operations than that of QAOA can approximate the eigenstates of diagonal Hamiltonians with high accuracy. We illustrate our ideas with a maximum-cut problem and show that near-term quantum applications may be feasible using short-depth circuits.

Style APA, Harvard, Vancouver, ISO itp.

46

Helman, P., i A. Rosenthal. "A decomposition scheme for the analysis of fault trees and other combinatorial circuits". IEEE Transactions on Reliability 38, nr 3 (1989): 312–27. http://dx.doi.org/10.1109/24.44173.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Pradhan, Manjari, i Bhargab B. Bhattacharya. "COMEDI: Combinatorial Election of Diagnostic Vectors From Detection Test Sets for Logic Circuits". IEEE Transactions on Very Large Scale Integration (VLSI) Systems 25, nr 4 (kwiecień 2017): 1467–76. http://dx.doi.org/10.1109/tvlsi.2016.2642343.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Lucay, Freddy, Edelmira Gálvez i Luis Cisternas. "Design of Flotation Circuits Using Tabu-Search Algorithms: Multispecies, Equipment Design, and Profitability Parameters". Minerals 9, nr 3 (15.03.2019): 181. http://dx.doi.org/10.3390/min9030181.

Pełny tekst źródła

Streszczenie:

The design of a flotation circuit based on optimization techniques requires a superstructure for representing a set of alternatives, a mathematical model for modeling the alternatives, and an optimization technique for solving the problem. The optimization techniques are classified into exact and approximate methods. The first has been widely used. However, the probability of finding an optimal solution decreases when the problem size increases. Genetic algorithms have been the approximate method used for designing flotation circuits when the studied problems were small. The Tabu-search algorithm (TSA) is an approximate method used for solving combinatorial optimization problems. This algorithm is an adaptive procedure that has the ability to employ many other methods. The TSA uses short-term memory to prevent the algorithm from being trapped in cycles. The TSA has many practical advantages but has not been used for designing flotation circuits. We propose using the TSA for solving the flotation circuit design problem. The TSA implemented in this work applies diversification and intensification strategies: diversification is used for exploring new regions, and intensification for exploring regions close to a good solution. Four cases were analyzed to demonstrate the applicability of the algorithm: different objective function, different mathematical models, and a benchmarking between TSA and Baron solver. The results indicate that the developed algorithm presents the ability to converge to a solution optimal or near optimal for a complex combination of requirements and constraints, whereas other methods do not. TSA and the Baron solver provide similar designs, but TSA is faster. We conclude that the developed TSA could be useful in the design of full-scale concentration circuits.

Style APA, Harvard, Vancouver, ISO itp.

49

Nakashima, Ai, Naoki Ihara, Mayo Shigeta, Hiroshi Kiyonari, Yuji Ikegaya i Haruki Takeuchi. "Structured spike series specify gene expression patterns for olfactory circuit formation". Science 365, nr 6448 (6.06.2019): eaaw5030. http://dx.doi.org/10.1126/science.aaw5030.

Pełny tekst źródła

Streszczenie:

Neural circuits emerge through the interplay of genetic programming and activity-dependent processes. During the development of the mouse olfactory map, axons segregate into distinct glomeruli in an olfactory receptor (OR)–dependent manner. ORs generate a combinatorial code of axon-sorting molecules whose expression is regulated by neural activity. However, it remains unclear how neural activity induces OR-specific expression patterns of axon-sorting molecules. We found that the temporal patterns of spontaneous neuronal spikes were not spatially organized but were correlated with the OR types. Receptor substitution experiments demonstrated that ORs determine spontaneous activity patterns. Moreover, optogenetically differentiated patterns of neuronal activity induced specific expression of the corresponding axon-sorting molecules and regulated axonal segregation. Thus, OR-dependent temporal patterns of spontaneous activity play instructive roles in generating the combinatorial code of axon-sorting molecules during olfactory map formation.

Style APA, Harvard, Vancouver, ISO itp.

50

Pulvermüller, Friedemann. "Brain embodiment of syntax and grammar: Discrete combinatorial mechanisms spelt out in neuronal circuits". Brain and Language 112, nr 3 (marzec 2010): 167–79. http://dx.doi.org/10.1016/j.bandl.2009.08.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!