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