Zobrazeno 1 - 10
of 182
pro vyhledávání: '"R. Vollmar"'
Publikováno v:
Parallel Computing. 23:1567-1576
In this introduction we review the basics of cellular automata and give a short survey of some areas of research concerning cellular automata. This is done to fit the papers of the present special issue into a general frame.
Autor:
Yanjun Zhang, Kenneth R. Vollmar
Publikováno v:
SIAM Journal on Discrete Mathematics. 6:329-333
The problem of counting the number $F( n,s )$ of Steiner-tree topologies with s Steiner points for n points on a circle is considered. The paper shows that $F( n,s )$ is closely related to the number $F^* ( n,s )$ of Steiner-tree topologies with s St
Autor:
Kenneth R. Vollmar
Publikováno v:
2006 IEEE Region 5 Conference.
The 8×8 IDCT (Inverse Discrete Cosine Transform) is an integral component of many standard digital image and video compression schemes, including JPEG baseline and the MPEG family of standards. A statistically-oriented standard, ANSI/IEEE 1180–199
Autor:
Kenneth R. Vollmar, Pete Sanderson
Publikováno v:
SIGCSE
We describe the implementation of "MARS," a GUI, Java-based simulator for the MIPS assembly language. MIPS, the computer architecture underlying the simulated assembly language, is widely used in industry and is the basis of the popular textbook Comp
Autor:
Pete Sanderson, Kenneth R. Vollmar
Publikováno v:
SIGCSE
Service learning is an educational philosophy that promotes active learning through community service. We have recently applied this approach in our computer science curriculum, specifically to our software engineering course. In order that other com
Publikováno v:
Theoretical Computer Science. 41:331-339
Let L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line Turing machines, and L[UONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line Turing machines with only universal states. This no
Autor:
R. Vollmar
Publikováno v:
Information Sciences. 8:259-270
In this paper a modified type of Turing machine is introduced and investigated: 1. (1) Information on the working tape “disappears” if it is not rewritten or reread during a certain length of time; 2. (2) states of the finite control are no longe
Autor:
R. Vollmar
Publikováno v:
International Journal of Theoretical Physics. 21:1007-1015
A proposal is made to measure the “efficiency” of cellular algorithms, implemented in cellular automata, roughly speaking by the ratio of the number of proper state changes and the product of time, and number of single automata. Such a definition
Autor:
W. O. Höllerer, R. Vollmar
Publikováno v:
Journal of Computer and System Sciences. 11:237-251
Cellular automata are modified in such a way that states of a single automaton become unreachable if they have not been rereached during a certain period depending on a function : The automaton then will assume the quiescent state. These ''forgetful'
Publikováno v:
Methods of Information in Medicine. 17:177-185
Voreilencle und begleitende EEG-Abschnitte von Rohdatensätzen, welche jeweils einen reizsynchronen EEG-Abschnitt und ein verborgenes evoziertes Emzelpotential enthalten, werden einer Fast-Fourier-Transformation (FFT) unterworfen. Auf einem grafische