Einloggen

Thematische Bibliographien / Register Automata / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Register Automata.

Zeitschriftenartikel zum Thema „Register Automata“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Register Automata" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

FIGUEIRA, DIEGO, PIOTR HOFMAN und SŁAWOMIR LASOTA. „Relating timed and register automata“. Mathematical Structures in Computer Science 26, Nr. 6 (05.12.2014): 993–1021. http://dx.doi.org/10.1017/s0960129514000322.

Der volle Inhalt der Quelle

Annotation:

Timed and register automata are well-known models of computation over timed and data words, respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave differently in appearance, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance.This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton over ordered data domain, and conversely that a run of a register automaton can be simulated by a timed automaton. These are exponential time reductions hold both in the finite and infinite words settings. Our results allow to transfer decidability results back and forth between these two kinds of models, as well complexity results modulo an exponential time reduction. We justify the usefulness of these reductions by obtaining new results on register automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Tzevelekos, Nikos. „Fresh-register automata“. ACM SIGPLAN Notices 46, Nr. 1 (26.01.2011): 295–306. http://dx.doi.org/10.1145/1925844.1926420.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Figueira, Diego, Piotr Hofman und Sławomir Lasota. „Relating timed and register automata“. Electronic Proceedings in Theoretical Computer Science 41 (28.11.2010): 61–75. http://dx.doi.org/10.4204/eptcs.41.5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Murawski, A. S., S. J. Ramsay und N. Tzevelekos. „Reachability in pushdown register automata“. Journal of Computer and System Sciences 87 (August 2017): 58–83. http://dx.doi.org/10.1016/j.jcss.2017.02.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Quaas, Karin, und Mahsa Shirmohammadi. „Synchronizing Data Words for Register Automata“. ACM Transactions on Computational Logic 20, Nr. 2 (04.04.2019): 1–27. http://dx.doi.org/10.1145/3309760.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Almagor, Shaull, Michaël Cadilhac, Filip Mazowiecki und Guillermo A. Pérez. „Weak Cost Register Automata are Still Powerful“. International Journal of Foundations of Computer Science 31, Nr. 06 (September 2020): 689–709. http://dx.doi.org/10.1142/s0129054120410026.

Der volle Inhalt der Quelle

Annotation:

We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over [Formula: see text] with updates using [Formula: see text] and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, namely equivalence, upperboundedness, and semilinearity. In particular, the undecidability of equivalence disproves a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Orlov, Alexei O., Ravi Kummamuru, R. Ramasubramaniam, Craig S. Lent, Gary H. Bernstein und Gregory L. Snider. „Clocked quantum-dot cellular automata shift register“. Surface Science 532-535 (Juni 2003): 1193–98. http://dx.doi.org/10.1016/s0039-6028(03)00214-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Seki, Hiroyuki, Reo Yoshimura und Yoshiaki Takata. „Optimal run problem for weighted register automata“. Theoretical Computer Science 850 (Januar 2021): 185–201. http://dx.doi.org/10.1016/j.tcs.2020.11.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Allender, Eric, Andreas Krebs und Pierre McKenzie. „Better Complexity Bounds for Cost Register Automata“. Theory of Computing Systems 63, Nr. 3 (13.06.2018): 367–85. http://dx.doi.org/10.1007/s00224-018-9871-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Kadiev, P. A., K. K. Nazarov und Z. G. Kardashova. „Formation of streams of binary sequences with controlled structure of "cellular" automata in homogeneous register environments“. Herald of Dagestan State Technical University. Technical Sciences 48, Nr. 4 (11.02.2022): 90–99. http://dx.doi.org/10.21822/2073-6185-2021-48-4-90-99.

Der volle Inhalt der Quelle

Annotation:

Objective. Development of a method for organizing the process of forming flows register structure, patented by the author at the Department of DSTU, which is a cellular automaton of binary sequences with a controlled structure of "cellular" automata in homogeneous register environments. Method. To solve the set system problem, a process model was built in order to determine the factors that allow changing the sequence of flow elements. Result. When studying the most common generators of pseudo-random streams based on linear register media with modulo two adders in feedback circuits, which are "cellular" automata, it was established from the tables of environment states that the factors determining the structure of the generated streams of binary sequences are the sequence of states , are the initial state of the register of a homogeneous medium and the feedback structure determined by the transition function of the cellular automaton. Conclusion. It is shown that by varying the initial state of the cellular automaton and the structure of feedbacks as control tools, it seems possible to form binary pseudo-random streams of states with different structures, different order of flow elements, bringing their characteristics closer to random ones. Examples of the implementation of the flow structure control process are given, confirming this assumption. A typical structure of a stream shaper with a managed structure based on a homogeneous one is given.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Chen, Yu-Fang, Bow-Yaw Wang und Di-De Yen. „A Finite Exact Representation of Register Automata Configurations“. Electronic Proceedings in Theoretical Computer Science 140 (23.02.2014): 16–34. http://dx.doi.org/10.4204/eptcs.140.2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Demri, Stéphane, und Ranko Lazić. „LTL with the freeze quantifier and register automata“. ACM Transactions on Computational Logic 10, Nr. 3 (April 2009): 1–30. http://dx.doi.org/10.1145/1507244.1507246.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Daviaud, Laure. „Register complexity and determinisation of max-plus automata“. ACM SIGLOG News 7, Nr. 2 (29.04.2020): 4–14. http://dx.doi.org/10.1145/3397619.3397621.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Isberner, Malte, Falk Howar und Bernhard Steffen. „Learning register automata: from languages to program structures“. Machine Learning 96, Nr. 1-2 (04.10.2013): 65–98. http://dx.doi.org/10.1007/s10994-013-5419-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Peng, Kai Bei, und Jin Tao Zhang. „Reconfigurable Boundary Scan Tester Using Cellular-Automata Register Technology“. Advanced Materials Research 1006-1007 (August 2014): 986–89. http://dx.doi.org/10.4028/www.scientific.net/amr.1006-1007.986.

Der volle Inhalt der Quelle

Annotation:

In this paper we reconfigure the input boundary-scan register to an operable test pattern generator that provides test patterns to the logic circuit for a predetermined number of clock cycles upon receipt of the built-in self-test control signal. The output boundary-scan register is reconfigurable to operate as an output response analyser that is driven by the logic circuit for the predetermined number of clock cycles upon receipt of the built-in self-test control signal. A family of input and output boundary-scan cells that can be reconfigured as a linear feedback shift register and as a multiple-input shift register is disclosed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Mukherjee, Chiradeep, Saradindu Panda, Asish K. Mukhopadhyay und Bansibadan Maji. „Towards the Design of Cost-efficient Generic Register Using Quantum-dot Cellular Automata“. Nanoscience & Nanotechnology-Asia 10, Nr. 4 (26.08.2020): 534–47. http://dx.doi.org/10.2174/2210681209666190412142207.

Der volle Inhalt der Quelle

Annotation:

Background: The advancement of VLSI in the application of emerging nanotechnology explores quantum-dot cellular automata (QCA) which has got wide acceptance owing to its ultra-high operating speed, extremely low power dissipation with a considerable reduction in feature size. The QCA architectures are emerging as a potential alternative to the conventional complementary metal oxide semiconductor (CMOS) technology. Experimental: Since the register unit has a crucial role in digital data transfer between the electronic devices, such study leading to the design of cost-efficient and highly reliable QCA register is expected to be a prudent area of research. A thorough survey on the existing literature shows that the generic models of Serial-in Serial Out (SISO), Serial-in-Parallel-Out (SIPO), Parallel-In- Serial-Out (PISO) and Parallel-in-Parallel-Out (PIPO) registers are inadequate in terms of design parameters like effective area, delay, O-Cost, Costα, etc. Results: This work introduces a layered T gate for the design of the D flip flop (LTD unit), which can be broadly used in SISO, SIPO, PISO, and PIPO register designs. For detection and reporting of high susceptible errors and defects at the nanoscale, the reliability and defect tolerant analysis of LTD unit are also carried out in this work. The QCA design metrics for the general register layouts using LTD unit is modeled. Conclusion: Moreover, the cost metrics for the proposed LTD layouts are thoroughly studied to check the functional complexity, fabrication difficulty and irreversible power dissipation of QCA register layouts.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Babari, Parvaneh, Manfred Droste und Vitaly Perevoshchikov. „Weighted register automata and weighted logic on data words“. Theoretical Computer Science 744 (Oktober 2018): 3–21. http://dx.doi.org/10.1016/j.tcs.2018.01.004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Purkayastha, Tamoghna, Debashis De und Tanay Chattopadhyay. „Universal shift register implementation using quantum dot cellular automata“. Ain Shams Engineering Journal 9, Nr. 2 (Juni 2018): 291–310. http://dx.doi.org/10.1016/j.asej.2016.01.011.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Mazowiecki, Filip, und Cristian Riveros. „Copyless cost-register automata: Structure, expressiveness, and closure properties“. Journal of Computer and System Sciences 100 (März 2019): 1–29. http://dx.doi.org/10.1016/j.jcss.2018.07.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Kozlitin, Oleg A. „On periodic properties of polylinear shift registers“. Discrete Mathematics and Applications 28, Nr. 1 (23.02.2018): 35–52. http://dx.doi.org/10.1515/dma-2018-0005.

Der volle Inhalt der Quelle

Annotation:

Abstract This paper continues the author’s studies in [4], [5], [6] on synthesis of generators of pseudorandom sequences on the basis of polylinear shift registers. The paper [9] puts forward a method of the study of periodic properties of such automata. In the present paper, this method is used for the study of the cyclic type of a polylinear shift register with irreducible characteristic polynomials.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Максимовский, Александр Юрьевич, Григорий Александрович Остапенко und Олег Николаевич Чопоров. „ABOUT PARAMETERS OF AUTOMATED MODELS FOR MONITORING INFORMATION SECURITY OF NETWORK OBJECTS, II“. ИНФОРМАЦИЯ И БЕЗОПАСНОСТЬ, Nr. 3(-) (01.12.2020): 327–36. http://dx.doi.org/10.36622/vstu.2020.23.3.001.

Der volle Inhalt der Quelle

Annotation:

В статье изучаются свойства сложных систем, представимых в виде сети автоматов, обладающих специальными свойствами. Данные свойства используются в интересах организации наблюдения за динамикой изменения (мониторинга) поведения состояния указанных систем в целях обеспечения надежного контроля функционирования. При этом в множество критериев контроля могут включаться результаты проверки соответствия троек входных последовательностей, последовательностей состояний и выходных последовательностей объектов контроля набору отношений, формируемых с использованием информации о свойствах рассматриваемых автоматных моделей сетевых объектов и, в частности, особенности функционирования указанных автоматных моделей. Предложены дальнейшие пути развития методов и средств выявления особенностей внешнего поведения автоматных моделей объектов контроля, способы построения и использования экспериментов с автоматами, а также отношений специального вида для автоматных моделей компонентов сложных систем и ассоциированных с ними комбинаторных объектов, определяемых на мультиграфах состояний соответствующих автоматов. Указаны общие подходы к применению автоматных моделей регистрового типа для мониторинга информационной безопасности сетевых объектов регистров сдвига или их обобщений, обладающие необходимыми свойствами. Получены новые результаты о возможностях и предложены новые подходы к выбору характеристик применения рассмотренных ранее автоматных моделей. Основное внимание уделено изучению групп автоматных моделей обобщенных недвоичных регистров сдвига и их обобщений, обладающих необходимыми свойствами. На основании этих результатов построены новые классы автоматных моделей параметров мониторинга информационной безопасности объектов сетевой инфраструктуры, которые включают не только основанные на контроле алгебраических и комбинаторных соотношений входных и выходных последовательностей указанных объектов, но и позволяют выявить потенциальные угрозы безопасности средствам контроля. The article studies the properties of complex systems that can be represented as a network of automata with special properties. These properties are used in the interests of organizing observation of the dynamics of changes (monitoring) the behavior of the state of these systems is in order to ensure reliable control over the functioning. In this case, the set of control criteria can include the results of checking the correspondence of triplets of input sequences, sequences of states and output sequences of control objects to a set of relations, generated using information about the properties of the considered automatic models of network objects and, in particular, the features of the functioning of these automatic models. Further ways of developing methods and means of identifying the features of the external behavior of automaton models of control objects, methods of constructing and using experiments with automata, as well as relations of a special kind for automata models of components of complex systems and associated combinatorial objects defined on the multigraphs of states of the corresponding automata. General approaches to the use of register-type automata models for monitoring information security of network objects of shift registers or their generalizations, which have the necessary properties, are indicated. New results on the possibilities are obtained and new approaches to the choice of characteristics of the application of the previously considered automatic models are proposed. The main attention is paid to the study of groups of automatic models of generalized non-binary shift registers of shift registers and their generalizations, which have the necessary properties. Based on these results, new classes of automata models of parameters for monitoring information security of network infrastructure objects were constructed, which include not only control-based algebraic and combinatorial relationships of the input and output sequences of the specified objects, but also allow identifying potential security threats to the controls themselves.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Vaandrager, Frits, und Abhisek Midya. „A Myhill-Nerode theorem for register automata and symbolic trace languages“. Theoretical Computer Science 912 (April 2022): 37–55. http://dx.doi.org/10.1016/j.tcs.2022.01.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Orlov, Alexei O., Ravi Kummamuru, R. Ramasubramaniam, Craig S. Lent, Gary H. Bernstein und Gregory L. Snider. „A Two-Stage Shift Register for Clocked Quantum-Dot Cellular Automata“. Journal of Nanoscience and Nanotechnology 2, Nr. 3 (01.07.2002): 351–55. http://dx.doi.org/10.1166/jnn.2002.109.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Clemente, Lorenzo, Sławomir Lasota, Ranko Lazić und Filip Mazowiecki. „Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems“. ACM Transactions on Computational Logic 20, Nr. 3 (16.07.2019): 1–31. http://dx.doi.org/10.1145/3326161.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

TAKATA, Yoshiaki, Akira ONISHI, Ryoma SENDA und Hiroyuki SEKI. „A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata“. IEICE Transactions on Information and Systems E106.D, Nr. 3 (01.03.2023): 294–302. http://dx.doi.org/10.1587/transinf.2022fcp0003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Singh, Balwinder, und Birinderjit Singh Kalyan. „Performance Analysis of Quantum Dot Cellular Automata (QCA) based Linear Feedback Shift Register (LFSR)“. International Journal of Computing and Digital Systems 9, Nr. 3 (01.05.2020): 545–51. http://dx.doi.org/10.12785/ijcds/090318.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Kummamuru, R. K., A. O. Orlov, R. Ramasubramaniam, C. S. Lent, G. H. Bernstein und G. L. Snider. „Operation of a quantum-dot cellular automata (QCA) shift register and analysis of errors“. IEEE Transactions on Electron Devices 50, Nr. 9 (September 2003): 1906–13. http://dx.doi.org/10.1109/ted.2003.816522.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Das, Jadav Chandra, und Debashis De. „Operational efficiency of novel SISO shift register under thermal randomness in quantum-dot cellular automata design“. Microsystem Technologies 23, Nr. 9 (26.07.2016): 4155–68. http://dx.doi.org/10.1007/s00542-016-3085-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Afrooz, Sonia, und Nima Jafari Navimipour. „Fault-Tolerant Design of a Shift Register at the Nanoscale Based on Quantum-dot Cellular Automata“. International Journal of Theoretical Physics 57, Nr. 9 (26.05.2018): 2598–614. http://dx.doi.org/10.1007/s10773-018-3781-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Melnyk, Oleksandr, Andriy Mykolushko und Arsen Myshynskyi. „Nanocircuits for Protection of the Cipher Information“. Electronics and Control Systems 1, Nr. 67 (12.05.2021): 61–68. http://dx.doi.org/10.18372/1990-5548.67.15607.

Der volle Inhalt der Quelle

Annotation:

While using side-channel attacks, cipher devices was defenseless to power and electromagnetic analysis attacks. These attacks are due to the use of low cost equipment. Currently, most of the cipher circuits are implemented on complementary metal-oxide-semiconductor. The disadvantage is the relationship between the data processing the curcuit to energy consumption. When processing the CMOS transistor logic "1" and the logic "0", through the transistor passes a different volume of current. If don't implement significant counteractions, it will allow another person to decrypt the key of the cipher module. A new logical approach to quantum-dot cellular automata and single-electron transistors is explored. The proposed approach has low power consumption and complicated clocking circuits. In theory and practice of cipher protection one of the key problems is the formation of binary pseudorandom sequences of maximum length of acceptable statistical characteristics. Generators of pseudorandom sequences usually based on linear shift registers with linear feedback. Here expanded the concept of linear shift register, believing that his every category (memory cell) can be in one of the states. Call registers are "generalized linear shift registers".

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Asthana, Amita, Dr Anil Kumar, Dr Preeta Sharan und Dr Sumita Mishra. „Design of Arm Processor’s Elements Using QCA“. International Journal of Engineering & Technology 7, Nr. 4.36 (09.12.2018): 306. http://dx.doi.org/10.14419/ijet.v7i4.36.23793.

Der volle Inhalt der Quelle

Annotation:

Quantum dot Cellular Automata is one of the promising future nano-technology for transistor-less computing which takes advantage of the coulomb force interacting between electrons. The aim of this paper is to consider the logical circuits of ARM processors and further reducing their size in nanometres like 2:1 multiplexer , D Flip Flop, scan Flip Flop, 2:1 multiplexer with enable, encoder, decoder, SR FF, shift register, memory cell and program counter are designed using QCAD tool . Their cell count, area, kink energy are taken in consideration to calculate power and energy dissipation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Sabbaghi-Nadooshan, Reza, Zahra Shahosseini und Davood Rezaeipour. „Design of New QCA LFSR and NLFSR for Grain-128 Stream Cipher“. Journal of Circuits, Systems and Computers 25, Nr. 02 (23.12.2015): 1650005. http://dx.doi.org/10.1142/s0218126616500055.

Der volle Inhalt der Quelle

Annotation:

The use of quantum-dot cellular automata (QCA) technology for the design of logic circuits has shown to increase data transfer rates up to 2 THz. In QCA technology, circuits are designed to have an ultra-small feature size as well as ultra-low power consumption. Grain-128 is one of the best stream ciphers in the final list of the eSTREAM project. In this paper, we have designed and simulated the main blocks of this algorithm including XOR gate, linear-feedback shift register (LFSR) and nonlinear-feedback shift register (NLFSR) using QCA technology. The designs of these blocks using the QCA Designer simulator are given and the main factors such as area, complexity and delay are estimated. Furthermore, ModelSim software is used to simulate HDLQ model of the QCA Grain-128 stream cipher algorithm. The results indicate that the main parameters of the proposed Grain-128, such as area and throughput, are improved as well.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Bouhmala, Noureddine, und Ole-Christoffer Granmo. „Stochastic Learning for SAT- Encoded Graph Coloring Problems“. International Journal of Applied Metaheuristic Computing 1, Nr. 3 (Juli 2010): 1–19. http://dx.doi.org/10.4018/jamc.2010070101.

Der volle Inhalt der Quelle

Annotation:

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Hoe, David H. K., Jonathan M. Comer, Juan C. Cerda, Chris D. Martinez und Mukul V. Shirvaikar. „Cellular Automata-Based Parallel Random Number Generators Using FPGAs“. International Journal of Reconfigurable Computing 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/219028.

Der volle Inhalt der Quelle

Annotation:

Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA), which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs) for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs) using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA) uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR). This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehardis used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehardtests.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Yaqoob, Salma, Suhaib Ahmed, Syed Farah Naz, Sadaf Bashir und Sparsh Sharma. „Design of efficient N‐bit shift register using optimized D flip flop in quantum dot cellular automata technology“. IET Quantum Communication 2, Nr. 2 (09.04.2021): 32–41. http://dx.doi.org/10.1049/qtc2.12008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Prakash, G., Mehdi Darbandi, N. Gafar, Noor H. Jabarullah und Mohammad Reza Jalali. „A New Design of 2-Bit Universal Shift Register Using Rotated Majority Gate Based on Quantum-Dot Cellular Automata Technology“. International Journal of Theoretical Physics 58, Nr. 9 (14.06.2019): 3006–24. http://dx.doi.org/10.1007/s10773-019-04181-w.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Kim, Hyun-Il, und Jun-Cheol Jeon. „Quantum LFSR Structure for Random Number Generation Using QCA Multilayered Shift Register for Cryptographic Purposes“. Sensors 22, Nr. 9 (06.05.2022): 3541. http://dx.doi.org/10.3390/s22093541.

Der volle Inhalt der Quelle

Annotation:

A random number generator (RNG), a cryptographic technology that plays an important role in security and sensor networks, can be designed using a linear feedback shift register (LFSR). This cryptographic transformation is currently done through CMOS. It has been developed by reducing the size of the gate and increasing the degree of integration, but it has reached the limit of integration due to the quantum tunneling phenomenon. Quantum-dot cellular automata (QCA), one of the quantum circuit design technologies to replace this, has superior performance compared to CMOS in most performance areas, such as space, speed, and power. Most of the LFSRs in QCA are designed as shift registers (SR), and most of the SR circuits proposed based on the existing QCA have a planar structure, so the cell area is large and the signal is unstable when a plane intersection is implemented. Therefore, in this paper, we propose a multilayered 2-to-1 QCA multiplexer and a D-latch, and we make blocks based on D-latch and connect these blocks to make SR. In addition, the LFSR structure is designed by adding an XOR operation to it, and we additionally propose an LFSR capable of dual-edge triggering. The proposed structures were completed with a very meticulous design technique to minimize area and latency using cell interaction, and they achieve high performance compared to many existing circuits. For the proposed structures, the cost and energy dissipation are calculated through simulation using QCADesigner and QCADesigner-E, and their efficiency is verified.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Garg, Pranav, Christof Löding, P. Madhusudan und Daniel Neider. „Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists“. Formal Methods in System Design 47, Nr. 1 (August 2015): 120–57. http://dx.doi.org/10.1007/s10703-015-0231-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Afrooz, Sonia, und Nima Jafari Navimipour. „Memory Designing Using Quantum-Dot Cellular Automata: Systematic Literature Review, Classification and Current Trends“. Journal of Circuits, Systems and Computers 26, Nr. 12 (August 2017): 1730004. http://dx.doi.org/10.1142/s0218126617300045.

Der volle Inhalt der Quelle

Annotation:

Quantum-dot cellular automata (QCA) has come out as one of the potential computational structures for the emerging nanocomputing systems. It has a large capacity in the development of circuits with high space density and dissipation of low heat and allows faster computers to develop with lower power consumption. The QCA is a new appliance to realize nanolevel digital devices and study and analyze their various parameters. It is also a potential technology for low force and high-density memory plans. Large memory designs in QCA show unique features because of their architectural structure. In QCA-based architectures, memory must be maintained in motion, i.e., the memory state has to be continuously moved through a set of QCA cells. These architectures have different features, such as the number of bits stored in a loop, access type (serial or parallel) and cell arrangement for the memory bank. However, the decisive features of the QCA memory cell design are the number of cells, to put off the use of energy. Although the review and study of the QCA-based memories are very important, there is no complete and systematic literature review about the systematical analyses of the state of the mechanisms in this field. Therefore, there are five main types to provide systematic reviews about the QCA-based memories; including read only memory (ROM), register, flip-flop, content addressable memory (CAM) and random access memory (RAM). Also, it has provided the advantages and disadvantages of the reviewed mechanisms and their important challenges so that some interesting lines for any coming research are provided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Maksimovskiy, Alexander. „On Two Classes of Automata Over Finite Rings, Based on the Isomorphism of the Shift Register and Their Application for the Protection of Information“. Voprosy kiberbezopasnosti, Nr. 1(29) (2019): 69–76. http://dx.doi.org/10.21681/2311-3456-2019-1-69-76.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

KAMINSKI, MICHAEL, und DANIEL ZEITLIN. „FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT“. International Journal of Foundations of Computer Science 21, Nr. 05 (Oktober 2010): 741–60. http://dx.doi.org/10.1142/s0129054110007532.

Der volle Inhalt der Quelle

Annotation:

In this paper we extend finite-memory automata with non-deterministic reassignment that allows an automaton to "guess" the future content of its registers, and introduce the corresponding notion of a regular expression over an infinite alphabet.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

GLADUN, O. M., und M. V. PUHACHOVA. „Genesis of the Demographic Registry in Ukraine“. Demography and social economy 3 (01.11.2022): 3–25. http://dx.doi.org/10.15407/dse2022.03.003.

Der volle Inhalt der Quelle

Annotation:

The state cannot function without accurate and reliable information about the number of its inhabitants, the gender and age structure of the population and its location on the territory of the country. For many decades, such information was obtained from population censuses, and in the intercensal period - from various additional sources. Later, so-called “electronic demographic registers” were created in developed countries, which made it possible to quickly update the necessary information about the population, store it and quickly process it. At the end of the last century, in many developed countries, demographic registers became the main source of information for conducting traditional population censuses, and later even partially or completely replaced them. Currently, due to various circumstances, Ukraine does not have a full-fledged demographic register and is only going through a difficult path to its formation. The purpose of this article is to study the process of creating a demographic register in Ukraine in a historical aspect. And its novelty lies in the fact that for the first time three attempts to develop a national demographic register are highlighted, analyzed and evaluated. The study is based on the application of systemic analysis to evaluate all attempts to create a Ukrainian demographic register; the use of complex systems research methods (analysis and synthesis) made it possible to analyze the components of all registers in detail and, on the basis of a comparative analysis, to determine the strengths and weaknesses of each version of the register. The application of a concrete-historical approach helped to study the processes of designing and creating registers taking into account the specific historical conditions in which they took place, and to find out the influence of these conditions on processes in question. To achieve the goal, the authors researched the projects of demographic registers developed at different times: the Automated Data Bank “Population” and the State Population Register of Ukraine. The reasons why these electronic information resources were never built were analyzed. The purpose of creation and possibilities of the introduced Unified State Demographic Register were also investigated. Its advantages and disadvantages are identified, its connection with other electronic registers operating in government and local self-government bodies is demonstrated. A comparison of the composition of the demographic characteristics of the two projects mentioned above and the register that is functioning today is presented. From the point of view of demographic focus and technological combination with other information systems, the project of the Automated Data Bank “Population” was the most perfect. The project structure of the next register was oversaturated with all possible information about the population, which was not necessary from the point of view of demographic needs. The Unified State Demographic Register was created with the aim of providing the population with documents of a new model, but was not aimed at fulfilling the role of a demographic register to the full extent.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Nehrey, Maryna, und Andrii Taranenko. „E-GOVERNANCE OF THE AGRICULTURAL SECTOR OF UKRAINE: STATE AGRARIAN REGISTER“. Bulletin of Taras Shevchenko National University of Kyiv. Economics, Nr. 222 (2023): 113–19. http://dx.doi.org/10.17721/1728-2667.2023/222-1/14.

Der volle Inhalt der Quelle

Annotation:

The paper aimed to examine the e-governance of the agricultural sector of Ukraine based on the State Agrarian Register. The digital transformation process of Ukrainian agriculture and the digital state register are considered. It was found that the main purpose of the platform is to provide financial and humanitarian assistance to farmers, both state and international. The background to its creation was excessive bureaucracy, lack of transparency, and corruption. From the very beginning, state support programs were offered on the basis of the state agency. More than 30,000 users registered in the first month. More than 30,000 users registered in the first month. In the next five months registered additional 70,000 users. Support from international donors was considered. The World Bank and the Food and Agriculture Organization of the United Nations have joined in supporting Ukrainian farmers. The expected results of the system implementation are simplified registration of farmers for financial support, automatic verification of their status through access to other state registers and cadastres, rapid application for financial support from the comfort of their homes or offices, rapid verification of eligibility for support, the ability to assess the effectiveness of support measures and publicity for the distribution of state support funds. A SWOT analysis of the State Agrarian Register was carried out. Threats include data leakage, cyber-attacks, and possible technical problems. Simplified access to information, optimization of farms and increased efficiency, increased transparency in the agricultural sector, improved access to finance, and improved traceability of the supply chain are the main benefits that Ukraine's agricultural sector could gain from the implementation of e-governance. The main opportunities are increasing the level of digital literacy of citizens and the growth of the agricultural sector through government/international support and the use of modern technologies.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

AWODUN, Mojirade Adejumoke. „Proposed Online Voters’ Registration Automated System in Election“. International Journal of Research and Innovation in Social Science VIII, Nr. II (2024): 1943–51. http://dx.doi.org/10.47772/ijriss.2024.802136.

Der volle Inhalt der Quelle

Annotation:

Voters’ registration is a process which qualifies a citizen to vote and also be voted for in any given election. A list of voter is generated from the voter registration called voter’s list. The manual voters register maintained in most of the under developed countries is causing a lot of electoral malpractices. The proposed system will maintain a central database for all registered voters, which will include their pictures and voters ID to guide against having multiple registrations. This study examined electoral act: national register of voters and qualification for registration. Appropriate conclusion was made.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Papaioannou, Evi, Angelos Vardakis und Christos Kaklamanis. „oPESA: ONLINE PLATFORM FOR AUTOMATIC EXAM-HALL SEAT ALLOCATION“. International Journal of Engineering Technologies and Management Research 5, Nr. 6 (27.02.2020): 51–65. http://dx.doi.org/10.29121/ijetmr.v5.i6.2018.245.

Der volle Inhalt der Quelle

Annotation:

We present oPESA, an online examination management system for exam-hall seating arrangement. oPESA is a platform built on PHP, HTML, CSS, JavaScript, jQuery and SQL. It is an open platform which can be accessed only by registered users, i.e., professors and students. Professors provide as input course details like title, examination date and room; additional input, like predetermined lists of students or list of constraints regarding the seating plan, can also be given. Students simply register for course examinations by providing their student ID as input. Whenever a student registers for an examination, oPESA immediately responds by automatically assigning an exam-hall seat to the student. Seat assignment is performed by an unbiased algorithm ensuring randomness and fairness. Results appear online but can also be downloaded and saved locally in .xls format. oPESA follows a responsive web design which allows it to automatically resize, hide, shrink or enlarge in order to look good on all devices (desktop computers, tablets, smartphones). oPESA suggests a very useful management tool for modern - highly-populated - higher education institutes which significantly facilitates the examination management process offering clarity and efficiency. Furthermore, oPESA could be also used for more general seat allocation purposes in the context of scientific, social and cultural events.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Biber, Douglas, Jesse Egbert und Mark Davies. „Exploring the composition of the searchable web: a corpus-based taxonomy of web registers“. Corpora 10, Nr. 1 (April 2015): 11–45. http://dx.doi.org/10.3366/cor.2015.0065.

Der volle Inhalt der Quelle

Annotation:

One major challenge for Web-As-Corpus research is that a typical Web search provides little information about the register of the documents that are searched. Previous research has attempted to address this problem (e.g., through the Automatic Genre Identification initiative), but with only limited success. As a result, we currently know surprisingly little about the distribution of registers on the web. In this study, we tackle this problem through a bottom-up user-based investigation of a large, representative corpus of web documents. We base our investigation on a much larger corpus than those used in previous research (48,571 web documents), and obtained through random sampling from across the full range of documents that are publically available on the searchable web. Instead of relying on individual expert coders, we recruit typical end-users of the Web for register coding, with each document in the corpus coded by four different raters. End-users identify basic situational characteristics of each web document, coded in a hierarchical manner. Those situational characteristics lead to general register categories, which eventually lead to lists of specific sub-registers. By working through a hierarchical decision tree, users are able to identify the register category of most Internet texts with a high degree of reliability. After summarising our methodological approach, this paper documents the register composition of the searchable web. Narrative registers are found to be the most prevalent, while Opinion and Informational Description/Explanation registers are also found to be extremely common. One of the major innovations of the approach adopted here is that it permits an empirical identification of ‘hybrid’ documents, which integrate characteristics from multiple general register categories (e.g., opinionated-narrative). These patterns are described and illustrated through sample Internet documents.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Kjos-Hanssen, Bjørn. „Automatic complexity of shift register sequences“. Discrete Mathematics 341, Nr. 9 (September 2018): 2409–17. http://dx.doi.org/10.1016/j.disc.2018.05.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Laippala, Veronika, Jesse Egbert, Douglas Biber und Aki-Juhani Kyröläinen. „Exploring the role of lexis and grammar for the stable identification of register in an unrestricted corpus of web documents“. Language Resources and Evaluation 55, Nr. 3 (25.01.2021): 757–88. http://dx.doi.org/10.1007/s10579-020-09519-z.

Der volle Inhalt der Quelle

Annotation:

AbstractThe Internet offers great possibilities for many scientific disciplines that utilize text data. However, the potential of online data can be limited by the lack of information on the genre or register of the documents, as register—whether a text is, e.g., a news article or a recipe—is arguably the most important predictor of linguistic variation (see Biber in Corpus Linguist Linguist Theory 8:9–37, 2012). Despite having received significant attention in recent years, the modeling of online registers has faced a number of challenges, and previous studies have presented contradictory results. In particular, these have concerned (1) the extent to which registers can be automatically identified in a large, unrestricted corpus of web documents and (2) the stability of the models, specifically the kinds of linguistic features that achieve the best performance while reflecting the registers instead of corpus idiosyncrasies. Furthermore, although the linguistic properties of registers vary importantly in a number of ways that may affect their modeling, this variation is often bypassed. In this article, we tackle these issues. We model online registers in the largest available corpus of online registers, the Corpus of Online Registers of English (CORE). Additionally, we evaluate the stability of the models towards corpus idiosyncrasies, analyze the role of different linguistic features in them, and examine how individual registers differ in these two aspects. We show that (1) competitive classification performance on a large-scale, unrestricted corpus can be achieved through a combination of lexico-grammatical features, (2) the inclusion of grammatical information improves the stability of the model, whereas many of the previously best-performing feature sets are less stable, and that (3) registers can be placed in a continuum based on the discriminative importance of lexis and grammar. These register-specific characteristics can explain the variation observed in previous studies concerning the automatic identification of online registers and the importance of different linguistic features for them. Thus, our results offer explanations for the jungle-likeness of online data and provide essential information on online registers for all studies using online data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Attie, Paul C., und Hana Chockler. „Automatic Verification of Fault-Tolerant Register Emulations“. Electronic Notes in Theoretical Computer Science 149, Nr. 1 (Februar 2006): 49–60. http://dx.doi.org/10.1016/j.entcs.2005.11.016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Yagain, Deepa, Sivanag Balla und Vijaya Krishna. „Efficient Audio Filter Using Folded Pipelining Architecture Based on Retiming Using Evolutionary Computation“. Journal of Circuits, Systems and Computers 24, Nr. 05 (08.04.2015): 1550068. http://dx.doi.org/10.1142/s0218126615500681.

Der volle Inhalt der Quelle

Annotation:

It is important in digital signal processing (DSP) architectures to minimize the silicon area of the integrated circuits. This can be achieved by reducing the number of functional units such as adders and multipliers. In literature, folding technique is used to reduce the functional units by executing multiple algorithm operations on a single functional unit. Register minimization techniques are used to reduce the number of registers in a folded architecture. Retiming is a technique that needs to be performed before applying folding. In this paper, retiming is performed based on nature inspired evolutionary computation method. This technique generates the database of solutions from which best solution can be picked for folding further. As a part of this work, an efficient folded noise removal audio filter prototype is designed as an application example using evolutionary computation-based retiming and folding with register minimization. Folding technique will however increase the number of registers while multiplexing datapath adder and multiplier elements. Register minimization technique is used after folding to reduce the number of registers. After obtaining retimed, folded filter architecture, low level synthesis is performed which involves mapping of datapath adder and multiplier blocks to actual hardware. Various architectures of adders and multipliers are compared in area-power-performance space and depending on the user defined constraint, folded architecture with specific combination of data path elements is mapped on to hardware. A framework is designed in this paper to automate the entire process which reduces the design cycle time. All the designed filters are targeted for ASIC implementation. The results are compared and are provided as part of simulation results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!