Search results for "register"

Optimal implementation of neural activation functions in programmable logic using fuzzy logic

2006

Abstract This work presents a methodology for implementing neural activation function in programmable logic using tools from fuzzy logic. This methodology will allow implementing these intrinsic non-linear functions using comparators and simple linear modellers, easily implemented in programmable logic. This work is particularized to the case of a hyperbolic tangent, the most common function in neural models, showing the excellent results yielded with the proposed approximation.

Fonti documentarie e testimonianze manoscritte per lo studio di due ospedali di Sciacca (secoli XIV-XV)

2021

Il saggio mira a mettere in rilievo l’utilità che una specifica tipologia di fonte, il testamento, può rivestire per la storia degli enti assistenziali, analizzando il caso studio di Sciacca per il quale si nota una particolare ricchezza di testimonianze. Dei due testamenti con cui il mercante Antonio Pardo stabiliva la fondazione dell’ospedale di Santa Margherita e il miles Ferrerio Ferreri quella dell’ospedale di Santa Maria della Misericordia esistono diversi transunti dovuti alle complesse vicende vissute dalle due strutture, la cui storia è riportata anche in manoscritti del XVIII secolo. Il confronto e l’integrazione dei dati offerti dalle testimonianze consentono di fornire elementi …

Generation of multidimensional random pulses for radioactivity measurements

2000

Multidimensional binary pseudo-random pulses are extremely useful for the set-up calibration and testing of radioactivity measuring equipment. A new method of generation of such signals, based on the parting operation of labeled pulse trains, is presented. The concept of a general coincidence ratio is introduced. Digital window comparators and prohibited or permitted state programmers capable of performing the parting operation and controlling the values of the coincidence ratio are proposed.

Research and Implementation of Energy Dispersal Algorithm for DRM System

2020

The article investigates the randomization algorithm of the OFDM signal energy used in modern digital broadcasting systems. Transmission part of the DRM system was modeled in MATLAB/Simulink software environment, bit sequences allocation tests were conducted using the original information signal and the corresponding modulation symbols with a scrambling algorithm and without it.

El componente pragmático en los diccionarios: Implicaciones para la Lexicografía

2015

Dictionaries are a list of words, simple or complex, that are treated as entries (lexical items). It is usual to assert several components: the lemma or headword, named after its most neutral form, followed by an indication of the main inflections of its category: genre and number if they are names, syntactic class if they are verbs. Sometimes, indications of it are made in other aspects: etymology, pronunciation, marks of placement, area of use, register, frequency of use, etc.Among all the group, it is pointed out an area that grows daily, painstakingly, in lexicographic works: the pragmatic component. Most of the words are referential (names, verbs, adverbs), but others correspond to lan…

Trade between Sweden and Portugal in the Eighteenth Century : Assessing the Reliability of STRO Compared to Swedish and Portuguese Sources

2018

Errors in Monte Carlo simulations using shift register random number generators

1996

We report large systematic errors in Monte Carlo simulations of the tricritical Blume-Capel model using single spin Metropolis updating. The error, manifest as a $20\%$ asymmetry in the magnetisation distribution, is traced to the interplay between strong triplet correlations in the shift register random number generator and the large tricritical clusters. The effect of these correlations is visible only when the system volume is a multiple of the random number generator lag parameter. No such effects are observed in related models.

Solving Graph Coloring Problems Using Learning Automata

2008

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.

E-learning approach of the graph coloring problem applied to register allocation in embedded systems

2016

The main aim of this paper consists in developing an effective e-learning tool, focused on evolutionary algorithms, in order to solve the graph coloring problem. Subsidiary, we apply graph coloring for register allocation in embedded systems. From didactic viewpoint, our tool has benefits in the learning process because it helps students to observe the relationship between the graph coloring problem and CPU registers allocation with the help of four developed modules: the genetic algorithm, the graphical viewer, the interference graph for a C program and a web application which collects the simulation results. All these applications are combined by a graphical interface which allows the use…

Quantum Real - Time Turing Machine

2001

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.