Results 271 to 280 of about 729,727 (315)
Some of the next articles are maybe not open access.
Remarks on simulation of Boolean functions
Communications of the ACM, 1965Recently M. Morris Mano presented a method for performing Boolean OR, AND and NOT operations by means of arithmetic and conditional transfer operations in a decimal computer lacking builtin logical instructions [1]. When A , B , C are variables whose defined value is 0
openaire +1 more source
Deductive Fault Simulation with Functional Blocks
IEEE Transactions on Computers, 1978This paper presents a method of propagating the effects of faults through functional blocks using the deductive (fault list) technique. An extension of the method is shown to be effective for simulating internal faults in functional blocks. The techniques presented here have been used for implementing the functional simulation capability in the Logic ...
Premachandran R. Menon +1 more
openaire +1 more source
Functional and simulated visual loss
2016Nonorganic visual loss (NOVL) is the cause of a large number of referrals to neurologists and ophthalmologists and is a frequent area of overlap between neurologists, ophthalmologists, and psychiatrists. NOVL is the presence of visual impairment without an organic cause for disease despite a thorough and comprehensive investigation. A diagnosis of NOVL
M, Dattilo +3 more
openaire +2 more sources
A Tool for Structured Functional Simulation
IEEE Journal on Selected Areas in Communications, 1984BLOSIM is a general purpose time-driven (as opposed to event-driven) simulation language. It is written in C language, and is intended to provide a highly structured environment for simulations, thereby making practical the accumulation of libraries of simulation routines which can be reused and making multiprogrammer simulation efforts more practical.
openaire +1 more source
Function simulation, graph grammars and colourings
International Journal of Computer Mathematics, 2013We prove that to any partial function defined on a finite set, there corresponds an infinite class of graphs that could be generated by a graph grammar such that each graph in the class represents the function in the sense that evaluation of the function at any point x of its domain can be simulated by finding the unique extension of a partial vertex ...
Amir Daneshgar +2 more
openaire +2 more sources
Simulated Annealing for noisy cost functions
Journal of Global Optimization, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutjahr, W., Pflug, G.C.
openaire +3 more sources
Functional Simulation Using Spreadsheets
SIMULATION, 1999In this paper, a functional simulation method using modern spreadsheet programs is dis cussed and evaluated. This method is based on simulating the basic blocks that constitute a system and in connecting these blocks together using a graphical interface. The simulation can be customized using toolbars, menus, help and dialog sheets. It is characterized
openaire +1 more source
Simulating Software Architectures for Functional Analysis
Seventh Working IEEE/IFIP Conference on Software Architecture (WICSA 2008), 2008Simulation is a mean for verifying the quality of an architectural specification. Some approaches have been proposed in the past. Each approach has its own internal simulation engine, and allows for certain types of simulations. Goal of this paper is to propose SASlM, a software architecture-level simulation technique for modeling and simulating ...
MUCCINI, HENRY, PELLICCIONE, PATRIZIO
openaire +1 more source
Simulation of Function Generator
Advanced Materials Research, 2014The function generator is the classic analog adder circuit, either independently or as an intermediate for its links embedded in complex circuits, have a very wide range of applications. Function generator can be used as the signal source to produce for research, teaching, experimental signals for different purposes such as how to make it more accurate
Xiao Long Tan, Jia Zhou, Wen Bin Wang
openaire +1 more source
Functional Partitioning and Simulation of Digital Circuits
IEEE Transactions on Computers, 1970In this paper we present a method for obtaining a functional partitioning of the logic of a computer. It is shown that given a basic function to be performed, such as addition, the computer logic can be partitioned into four disjoint sets, namely the active information logic I, the semiactive flip-flops l, the activated control logic c, and the dormant
openaire +2 more sources

