Information theory - тест
A) Seismic exploration B) Cryptographic use C) Bioinformatics D) Gambling
A) Analog processing methods B) High Shannon entropy C) Random seeds external to the software D) Integrated neural clusters
A) Via extractors B) Via digital noise C) By using semiotic signs D) Through Shannon entropy
A) Dynamic core hypothesis B) Free energy C) Min-entropy D) Effective information
A) Conditional entropy B) Thermal entropy C) Rényi entropy D) Algorithmic entropy
A) In semiotic code control B) In minimizing free energy C) In evaluating randomness in cryptographic systems D) In seismic oil exploration
A) Yes B) Only in cryptographic systems C) No D) Only for pseudorandom numbers
A) Search for extraterrestrial intelligence B) Bioinformatics C) Seismic oil exploration D) Black hole analysis
A) Strip off and separate unwanted noise from the desired seismic signal B) Generate secure pseudorandom numbers C) Minimize free energy in the brain D) Decode dominant social messages
A) Cryptographically secure pseudorandom number generators B) Information theory and digital signal processing C) Extractors and Rényi entropy D) Free energy principles
A) Doede Nauta and Winfried Nöth B) Gerald Edelman and Giulio Tononi C) Karl J. Friston and Andrey Kolmogorov D) Umberto Eco and Ferruccio Rossi-Landi
A) The separation of unwanted noise from seismic signals B) The minimization of free energy in a self-organized system C) The study of the internal processes of coding, filtering, and information processing D) The measurement of sufficient randomness in extractors
A) C.E. Shannon and R.V.L. Hartley B) Doede Nauta and Winfried Nöth C) Umberto Eco and Ferruccio Rossi-Landi D) Gerald Edelman and Karl J. Friston
A) By utilizing cryptographically secure pseudorandom seeds B) By using signs that exhibit a high degree of redundancy C) Through digital signal processing of seismic signals D) By applying the free energy principle
A) To study black holes and bioinformatics B) To analyze the integrated process organization of neural information C) To extract random numbers for cryptography D) To explore seismic oil deposits
A) The issue of seismic noise filtering B) The paradox of extraterrestrial intelligence C) The problem of algorithmic complexity D) The binding problem in cognitive neuroscience
A) R.V.L. Hartley and C.E. Shannon B) Umberto Eco and Ferruccio Rossi-Landi C) Doede Nauta and Winfried Nöth D) Gerald Edelman and Giulio Tononi
A) Effective information B) Shannon entropy C) Seismic signal processing D) Min-entropy
A) Analog methods of data transmission B) External cryptographic random seeds C) A high degree of redundancy in signs D) A reentrant process organization
A) The synchronization of neurophysiological activity between groups of neuronal populations B) The filtering of unwanted noise from desired seismic signals C) The generation of pseudorandom numbers using extractors D) The coding and filtering processes studied in semiotics
A) Charles Sanders Peirce B) Giulio Tononi C) Gerald Edelman D) Karl J. Friston
A) A cryptographic random number generator B) An analog seismic receiver C) A self-organized system D) A dominant social class
A) The semiotic information theory B) The Bayesian brain hypothesis C) The integrated information theory D) The dynamic core hypothesis
A) Phrenology B) Alchemy C) Search for extraterrestrial intelligence D) Astrology
A) Tectonic plates B) Seismic waves C) Neural clusters D) Black holes
A) Bioinformatics B) Biochemistry C) Biophysics D) Biomechanics
A) Cipher creation B) Gambling C) Crosswords D) Chess
A) Doede Nauta B) Umberto Eco C) R.V.L. Hartley D) Gerald Edelman
A) Giulio Tononi B) C.E. Shannon C) Winfried Nöth D) Ferruccio Rossi-Landi
A) Winfried Nöth B) Andrey Kolmogorov C) Charles Sanders Peirce D) Karl J. Friston
A) Integrated information theory B) History of information theory C) Dynamic core hypothesis D) Free energy principle
A) A brute force attack B) A block cipher C) A single organ D) A network
A) Information theory units B) Distinct physiological states C) Symmetric keys D) Unicity distances
A) How encryption keys are generated B) Why it ceases permanently C) Why brute force attacks succeed D) How it occurs
A) Cryptographic interactions B) Cardio-respiratory interactions C) Enigma machine interactions D) One-time pad interactions
A) Extreme environments B) Cryogenic laboratory environments C) Underground bunker environments D) Simulated virtual environments
A) The ban B) The bit C) The shannon D) The byte
A) The Enigma project B) The Ultra project C) The Venona project D) The Unicity project
A) Lorenz cipher code B) Symmetric key code C) One-time pad code D) Enigma machine code
A) It is extremely easy using symmetric keys B) It requires no computational effort C) It is much more difficult than it might first appear D) It is completely impossible under any circumstances
A) A conditional mutual attack B) An information-theoretic attack C) A network physiology attack D) A brute force attack
A) Unicity distance algorithms B) One-time pads C) Asymmetric algorithms D) Secret key algorithms
A) Transfer entropy B) Bans C) One-time pads D) Block ciphers
A) Block ciphers B) Transfer entropy C) Brute force D) Care
A) The Network Physiology project B) The Enigma project C) The Venona project D) The Ultra project
A) Lossy data compression B) Lossless data compression C) Channel coding D) Rate-distortion theory
A) Pragmatic information B) Channel resolvability C) Source-channel separation theorems D) Rate-distortion theory
A) Distortion functions B) Bits C) Entropy D) Bytes
A) The relay channel B) The broadcast channel C) The multiple-access channel D) The wiretap channel
A) The broadcast channel B) The wiretap channel C) The relay channel D) The multiple-access channel
A) The wiretap channel B) The relay channel C) The broadcast channel D) The multiple-access channel
A) Mutual information B) Conditional entropy C) Kullback-Leibler divergence D) Cross-entropy
A) Euclidean space B) Product space C) Vector space D) Metric space
A) 1 / pi B) -log2(pi) C) log2(pi) D) -ln(pi)
A) The geometric mean B) The weighted average C) The median D) The maximum value
A) 1 shannon B) No information C) 1000 shannons D) 2000 bits
A) 1952 B) 1960 C) 1939 D) 1948
A) 1950s B) 1940s C) 1930s D) 1920s
A) Artificial intelligence B) Quantum computing C) Molecular biology D) Telecommunication
A) 1 bit B) 2 bits C) 0.5 bits D) Zero
A) ZIP files B) Compact discs C) DSL D) Voyager missions
A) ZIP files B) Artificial intelligence C) DSL D) Mobile phones
A) Apollo missions B) Voyager missions C) Hubble telescope D) Curiosity rover
A) Steam engine B) Television C) Radio D) Compact disc
A) Mobile phones B) Airplanes C) Automobiles D) Electric guitars
A) The printing press B) The telegraph network C) The Internet D) The postal service
A) Cloud computing B) Optical computing C) Distributed computing D) Quantum computing
A) Art creation B) Architectural drafting C) Oil painting restoration D) Sculpture casting
A) Musical instrument design B) Vocal cord anatomy C) Acoustic room resonance D) Music
A) Ethics B) Aesthetics C) Epistemology D) Metaphysics
A) Vannevar Bush B) Harry Nyquist C) James Gleick D) Ralph Hartley
A) 1940 B) 1928 C) 1948 D) 1939
A) James Gleick B) Vannevar Bush C) Alan Turing D) Ludwig Boltzmann
A) Claude Shannon B) Harry Nyquist C) Alan Turing D) Ralph Hartley
A) PV = nRT B) E = mc2 C) H = log Sn D) W = K log m
A) The byte B) The decimal digit C) The baud D) The bit
A) Alan Turing B) Claude Shannon C) Ralph Hartley D) Harry Nyquist
A) James Gleick B) Rolf Landauer C) Vannevar Bush D) Harry Nyquist
A) Binary logarithm B) Natural logarithm C) Decimal logarithm D) Common logarithm
A) Common logarithm B) Natural logarithm C) Binary logarithm D) Base-two logarithm
A) Common logarithm B) Binary logarithm C) Base-e logarithm D) Natural logarithm
A) The most predictable state B) The lowest possible information content C) A deterministic sequence D) The most unpredictable state
A) Base-10 B) Base-e C) Base-2 D) Base-256
A) A Markov trial B) A Bernoulli trial C) An equiprobable trial D) A logarithmic trial
A) Equivocation B) Marginal entropy C) Mutual information D) Joint entropy
A) Pointwise mutual information B) Transinformation C) Log-likelihood ratio D) Kullback-Leibler divergence
A) Quantum mechanics B) Communication C) Thermodynamics D) Macroeconomics
A) Jensen-Shannon divergence B) Euclidean distance C) Mahalanobis distance D) Kullback-Leibler divergence
A) Mann-Whitney U test B) Log-likelihood ratio test C) Shapiro-Wilk test D) Student's t-test
A) Euclidean metric B) Inner product C) Semi-quasimetric D) Linear transformation
A) Bob B) Both C) Neither D) Alice
A) Alice B) Both will be equally surprised C) Bob D) It is impossible to determine
A) A discrete set B) An infinite continuous set C) A finite geometric set D) An empty set
A) Only in quantum states B) No C) Only in macroscopic mechanics D) Yes
A) {X1, X2, ..., X_n} B) {Y1, Y2, ..., Y_n} C) {X0, X1, ..., X_{n-1}} D) {X1, Y1, ..., X_n, Y_n}
A) An undefined value B) The same result C) Completely different results D) A result of zero
A) A negligible factor in modern systems B) A completely controllable variable C) An inherent fixed property D) An unpredictable random variable that changes constantly
A) e B) Hb C) p D) i
A) Erases the input bit B) Delays the input bit C) Flips the input bit D) Duplicates the input bit
A) Zero capacity B) Memory C) Ternary input D) Gaussian noise |
Створено з That Quiz —
сайт для створення тестів і оцінювання з математики та інших предметів.